{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:50:17Z","timestamp":1782971417730,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","funder":[{"name":"Israeli Science Foundation","award":["2084\/18"],"award-info":[{"award-number":["2084\/18"]}]},{"name":"Israeli Science Foundation","award":["1042\/22"],"award-info":[{"award-number":["1042\/22"]}]},{"name":"Israeli Science Foundation","award":["800\/22"],"award-info":[{"award-number":["800\/22"]}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["949083"],"award-info":[{"award-number":["949083"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733536","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"326-336","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-4197-015X","authenticated-orcid":false,"given":"Orr","family":"Fischer","sequence":"first","affiliation":[{"name":"Bar Ilan University, Ramat Gan, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2357-2445","authenticated-orcid":false,"given":"Merav","family":"Parter","sequence":"additional","affiliation":[{"name":"Weizmann, Rehovot, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"394","article-title":"Asymptotically Optimal Two-Round Perfectly Secure Message Transmission","volume":"4117","author":"Agarwal Saurabh","year":"2006","unstructured":"Saurabh Agarwal, Ronald Cramer, and Robbert de Haan. 2006. Asymptotically Optimal Two-Round Perfectly Secure Message Transmission. In Advances in Cryptology (CRYPTO), Vol. 4117. 394\u2013408.","journal-title":"Advances in Cryptology (CRYPTO)"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-017-0303-5"},{"key":"e_1_3_2_1_3_1","volume-title":"Byzantine Connectivity Testing in the Congested Clique. In 36th International Symposium on Distributed Computing (DISC), Christian Scheideler (Ed.)","volume":"246","author":"Augustine John","year":"2022","unstructured":"John Augustine, Anisur Rahaman Molla, Gopal Pandurangan, and Yadu Vasudev. 2022. Byzantine Connectivity Testing in the Congested Clique. In 36th International Symposium on Distributed Computing (DISC), Christian Scheideler (Ed.), Vol. 246. 7:1\u20137:21."},{"key":"e_1_3_2_1_4_1","volume-title":"Constant Degree Networks for Almost-Everywhere Reliable Transmission. arXiv preprint arXiv:2501.00337","author":"Bafna Mitali","year":"2024","unstructured":"Mitali Bafna and Dor Minzer. 2024. Constant Degree Networks for Almost-Everywhere Reliable Transmission. arXiv preprint arXiv:2501.00337 (2024)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.286303"},{"key":"e_1_3_2_1_6_1","volume-title":"Cryptographic Protocols Provably Secure Against Dynamic Adversaries. In Workshop on the Theory and Application of Cryptographic Techniques (EUROCRYPT), Rainer A. Rueppel (Ed.)","volume":"658","author":"Beaver Donald","year":"1992","unstructured":"Donald Beaver and Stuart Haber. 1992. Cryptographic Protocols Provably Secure Against Dynamic Adversaries. In Workshop on the Theory and Application of Cryptographic Techniques (EUROCRYPT), Rainer A. Rueppel (Ed.), Vol. 658. Springer, 307\u2013323."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01187072"},{"key":"e_1_3_2_1_8_1","volume-title":"30th Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 410\u2013415","author":"Berman Piotr","unstructured":"Piotr Berman, Juan A. Garay, and Kenneth J. Perry. 1989. Towards Optimal Distributed Consensus (Extended Abstract). In 30th Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 410\u2013415."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230807"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.93"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.10.019"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.214134"},{"key":"e_1_3_2_1_14_1","volume-title":"On fast and robust information spreading in the vertex-congest model. Theoretical Computer Science","author":"Censor-Hillel Keren","year":"2017","unstructured":"Keren Censor-Hillel and Tariq Toukan. 2017. On fast and robust information spreading in the vertex-congest model. Theoretical Computer Science (2017)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-013-9176-3"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2312.07747"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1709404.1709409"},{"key":"e_1_3_2_1_18_1","volume-title":"On the Round Complexity of Randomized Byzantine Agreement. In 33rd International Symposium on Distributed Computing (DISC). 12:1\u201312:17","author":"Cohen Ran","year":"2019","unstructured":"Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, and Alex Samorodnitsky. 2019. On the Round Complexity of Randomized Byzantine Agreement. In 33rd International Symposium on Distributed Computing (DISC). 12:1\u201312:17."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-013-7131-9"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3297715"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/138027.138036"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)90776-8"},{"key":"e_1_3_2_1_24_1","volume-title":"22nd International Symposium (DISC). 167\u2013181","author":"Dolev Danny","unstructured":"Danny Dolev and Ezra N. Hoch. 2008. Constant-Space Localized Byzantine Consensus. In Distributed Computing, 22nd International Symposium (DISC). 167\u2013181."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217061"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539790187084"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-12689-9_99"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594578"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2505.05735"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335363"},{"key":"e_1_3_2_1_31_1","volume-title":"8th International Workshop (WDAG)","volume":"857","author":"Garay Juan A.","year":"1994","unstructured":"Juan A. Garay. 1994. Reaching (and Maintaining) Agreement in the Presence of Mobile Faults (Extended Abstract). In Distributed Algorithms, 8th International Workshop (WDAG), Vol. 857. 253\u2013264."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794265232"},{"key":"e_1_3_2_1_33_1","volume-title":"Simple and efficient reliable broadcast in the presence of byzantine processes. arXiv preprint arXiv:1510.06882","author":"Imbs Damien","year":"2015","unstructured":"Damien Imbs and Michel Raynal. 2015. Simple and efficient reliable broadcast in the presence of byzantine processes. arXiv preprint arXiv:1510.06882 (2015)."},{"key":"e_1_3_2_1_34_1","volume-title":"Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Jayanti Siddhartha","unstructured":"Siddhartha Jayanti, Srinivasan Raghuraman, and Nikhil Vyas. 2020. Efficient Constructions for Almost-Everywhere Secure Computation. In Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vol. 12106. 159\u2013183."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054893"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_27"},{"key":"e_1_3_2_1_37_1","volume-title":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC). 327\u2013336","author":"Khan Muhammad Samir","unstructured":"Muhammad Samir Khan, Syed Shalan Naqvi, and Nitin H. Vaidya. 2019. Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC). 327\u2013336."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011807"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3051093"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48405-1_38"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030434"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2501983"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_1_44_1","volume-title":"Distributed Computing - 26th International Symposium (DISC). 253\u2013266.","author":"Maurer Alexandre","unstructured":"Alexandre Maurer and S\u00e9bastien Tixeuil. 2012. On Byzantine Broadcast in Loosely Connected Networks. In Distributed Computing - 26th International Symposium (DISC). 253\u2013266."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/112600.112605"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/1062032.1711012"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028994"},{"key":"e_1_3_2_1_49_1","volume-title":"International Symposium (SIGAL). 358\u2013367","author":"Santoro Nicola","year":"1990","unstructured":"Nicola Santoro and Peter Widmayer. 1990. Distributed Function Evaluation in the Presence of Transmission Faults. In Algorithms, International Symposium (SIGAL). 358\u2013367."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216031"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1099"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767453"}],"event":{"name":"PODC '25: ACM Symposium on Principles of Distributed Computing","location":"Hotel Las Brisas Huatulco Huatulco Mexico","acronym":"PODC '25","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733536","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:26:31Z","timestamp":1749824791000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733536"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":52,"alternative-id":["10.1145\/3732772.3733536","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733536","relation":{},"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}