{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:48Z","timestamp":1750219788997,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":70,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T00:00:00Z","timestamp":1686873600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Union's Horizon 2020 research and innovation programme","award":["949083"],"award-info":[{"award-number":["949083"]}]},{"name":"Israeli Science Foundation","award":["2084\/18"],"award-info":[{"award-number":["2084\/18"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,19]]},"DOI":"10.1145\/3583668.3594578","type":"proceedings-article","created":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T22:28:38Z","timestamp":1686954518000},"page":"262-273","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Distributed CONGEST Algorithms against Mobile Adversaries"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-4197-015X","authenticated-orcid":false,"given":"Orr","family":"Fischer","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2357-2445","authenticated-orcid":false,"given":"Merav","family":"Parter","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}]}],"member":"320","published-online":{"date-parts":[[2023,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77618"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.286303"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611474"},{"key":"e_1_3_2_1_4_1","volume-title":"Fifth Theory of Cryptography Conference (TCC) (Lecture Notes in Computer Science","volume":"230","author":"Beerliov\u00e1-Trub\u00edniov\u00e1 Zuzana","year":"2008","unstructured":"Zuzana Beerliov\u00e1-Trub\u00edniov\u00e1 and Martin Hirt. 2008. Perfectly-Secure MPC with Linear Communication Complexity. In Theory of Cryptography, Fifth Theory of Cryptography Conference (TCC) (Lecture Notes in Computer Science, Vol. 4948), Ran Canetti (Ed.). Springer, 213--230."},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4","author":"Ben-Or Michael","year":"1988","unstructured":"Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4, 1988, Chicago, Illinois, USA. 1--10."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01187072"},{"key":"e_1_3_2_1_7_1","volume-title":"30th Annual Symposium on Foundations of Computer Science, Research Triangle Park","author":"Berman Piotr","year":"1989","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, Research Triangle Park, North Carolina, USA, 30 October -- 1 November 1989. IEEE Computer Society, 410--415."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230807"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.10.019"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.214134"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/646759.705843"},{"key":"e_1_3_2_1_13_1","volume-title":"9th Innovations in Theoretical Computer Science Conference, ITCS 2018","volume":"20","author":"Censor-Hillel Keren","year":"2018","unstructured":"Keren Censor-Hillel, Ran Gelles, and Bernhard Haeupler. 2018. Making Asynchronous Distributed Computations Robust to Channel Noise. In 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11--14, 2018, Cambridge, MA, USA (LIPIcs, Vol. 94), Anna R. Karlin (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 50:1--50:20."},{"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.1109\/SFCS.1985.55"},{"key":"e_1_3_2_1_16_1","volume-title":"47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8--11, 2020, Saarbr\u00fccken, Germany (Virtual Conference). 33:1--33:18","author":"Chuzhoy Julia","year":"2020","unstructured":"Julia Chuzhoy, Merav Parter, and Zihan Tan. 2020. On Packing Low-Diameter Spanning Trees. In 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8--11, 2020, Saarbr\u00fccken, Germany (Virtual Conference). 33:1--33:18."},{"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 2019","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 2019, October 14--18, 2019, Budapest, Hungary. 12:1--12: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.1016\/0196-6774(82)90004-9"},{"key":"e_1_3_2_1_21_1","volume-title":"Perfectly Secure Message Transmission. In 31st Annual Symposium on Foundations of Computer Science, St","author":"Dolev Danny","year":"1990","unstructured":"Danny Dolev, Cynthia Dwork, Orli Waarts, and Moti Yung. 1990. Perfectly Secure Message Transmission. In 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22--24, 1990, Volume I. IEEE Computer Society, 36--45."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)90776-8"},{"volume-title":"22nd International Symposium, DISC 2008, Arcachon, France, September 22--24, 2008. Proceedings. 167--181","author":"Dolev Danny","key":"e_1_3_2_1_23_1","unstructured":"Danny Dolev and Ezra N. Hoch. 2008. Constant-Space Localized Byzantine Consensus. In Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22--24, 2008. Proceedings. 167--181."},{"key":"e_1_3_2_1_24_1","volume-title":"SCN 2016, Amalfi, Italy, August 31 -- September 2, 2016, Proceedings (Lecture Notes in Computer Science","volume":"548","author":"Dolev Shlomi","year":"2016","unstructured":"Shlomi Dolev, Karim El Defrawy, Joshua Lampkins, Rafail Ostrovsky, and Moti Yung. 2016. Proactive Secret Sharing with a Dishonest Majority. In Security and Cryptography for Networks - 10th International Conference, SCN 2016, Amalfi, Italy, August 31 -- September 2, 2016, Proceedings (Lecture Notes in Computer Science, Vol. 9841), Vassilis Zikas and Roberto De Prisco (Eds.). Springer, 529--548."},{"volume-title":"From Database to Cyber Security - Essays Dedicated to Sushil Jajodia on the Occasion of His 70th Birthday (Lecture Notes in Computer Science","author":"Eldefrawy Karim","key":"e_1_3_2_1_25_1","unstructured":"Karim Eldefrawy, Rafail Ostrovsky, and Moti Yung. 2018. Theoretical Foundations for Mobile Target Defense: Proactive Secret Sharing and Secure Multiparty Computation. In From Database to Cyber Security - Essays Dedicated to Sushil Jajodia on the Occasion of His 70th Birthday (Lecture Notes in Computer Science, Vol. 11170), Pierangela Samarati, Indrajit Ray, and Indrakshi Ray (Eds.). Springer, 470--486."},{"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.48550\/arXiv.2305.14300"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335363"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/333979.333980"},{"key":"e_1_3_2_1_31_1","volume-title":"8th International Workshop, WDAG '94, Terschelling, The Netherlands, September 29 -- October 1, 1994, Proceedings (Lecture Notes in Computer Science","volume":"264","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 '94, Terschelling, The Netherlands, September 29 -- October 1, 1994, Proceedings (Lecture Notes in Computer Science, Vol. 857), Gerard Tel and Paul M. B. Vit\u00e1nyi (Eds.). Springer, 253--264."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794265232"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000079"},{"key":"e_1_3_2_1_34_1","volume-title":"Efficient and Explicit Coding for Interactive Communication. In IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011","author":"Gelles Ran","year":"2011","unstructured":"Ran Gelles, Ankur Moitra, and Amit Sahai. 2011. Efficient and Explicit Coding for Interactive Communication. In IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22--25, 2011, Rafail Ostrovsky (Ed.). IEEE Computer Society, 768--777."},{"key":"e_1_3_2_1_35_1","volume-title":"42nd International Colloquium, (ICALP)","volume":"9135","author":"Ghaffari Mohsen","year":"2015","unstructured":"Mohsen Ghaffari. 2015. Distributed Broadcast Revisited: Towards Universal Optimality. In Automata, Languages, and Programming - 42nd International Colloquium, (ICALP), Vol. 9135. Springer, 638--649."},{"key":"e_1_3_2_1_36_1","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing","author":"Goldreich Oded","year":"1987","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA, Alfred V. Aho (Ed.). ACM, 218--229."},{"key":"e_1_3_2_1_37_1","volume-title":"35th International Symposium on Distributed Computing, DISC 2021, October 4--8, 2021, Freiburg, Germany (Virtual Conference) (LIPIcs","volume":"19","author":"Hitron Yael","year":"2021","unstructured":"Yael Hitron and Merav Parter. 2021. Broadcast CONGEST Algorithms against Adversarial Edges. In 35th International Symposium on Distributed Computing, DISC 2021, October 4--8, 2021, Freiburg, Germany (Virtual Conference) (LIPIcs, Vol. 209), Seth Gilbert (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 23:1--23:19."},{"key":"e_1_3_2_1_38_1","volume-title":"35th International Symposium on Distributed Computing, DISC 2021, October 4--8, 2021, Freiburg, Germany (Virtual Conference) (LIPIcs","volume":"18","author":"Hitron Yael","year":"2021","unstructured":"Yael Hitron and Merav Parter. 2021. General CONGEST Compilers against Adversarial Edges. In 35th International Symposium on Distributed Computing, DISC 2021, October 4--8, 2021, Freiburg, Germany (Virtual Conference) (LIPIcs, Vol. 209), Seth Gilbert (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 24:1--24:18."},{"key":"e_1_3_2_1_39_1","volume-title":"Broadcast CONGEST Algorithms Against Eavesdroppers. In 36th International Symposium on Distributed Computing, DISC 2022","volume":"19","author":"Hitron Yael","year":"2022","unstructured":"Yael Hitron, Merav Parter, and Eylon Yogev. 2022. Broadcast CONGEST Algorithms Against Eavesdroppers. In 36th International Symposium on Distributed Computing, DISC 2022, October 25--27, 2022, Augusta, Georgia, USA (LIPIcs, Vol. 246), Christian Scheideler (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 27:1--27:19."},{"key":"e_1_3_2_1_40_1","volume-title":"Secure Distributed Network Optimization Against Eavesdroppers. In 14th Innovations in Theoretical Computer Science Conference, ITCS 2023","author":"Hitron Yael","year":"2023","unstructured":"Yael Hitron, Merav Parter, and Eylon Yogev. 2023. Secure Distributed Network Optimization Against Eavesdroppers. In 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10--13, 2023, Cambridge, Massachusetts, USA."},{"key":"e_1_3_2_1_41_1","volume-title":"Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016","author":"William","year":"2016","unstructured":"William M. Hoza and Leonard J. Schulman. 2016. The Adversarial Noise Threshold for Distributed Protocols. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10--12, 2016, Robert Krauthgamer (Ed.). SIAM, 240--258."},{"key":"e_1_3_2_1_42_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_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2004.1269720"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195422"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_27"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331619"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011807"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539704441848"},{"key":"e_1_3_2_1_50_1","volume-title":"DISC 2012, Salvador, Brazil, October 16--18, 2012. Proceedings. 253--266","author":"Maurer Alexandre","year":"2012","unstructured":"Alexandre Maurer and S\u00e9bastien Tixeuil. 2012. On Byzantine Broadcast in Loosely Connected Networks. In Distributed Computing - 26th International Symposium, DISC 2012, Salvador, Brazil, October 16--18, 2012. Proceedings. 253--266."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-36.1.445"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/112600.112605"},{"key":"e_1_3_2_1_53_1","volume-title":"Small Cuts and Connectivity Certificates: A Fault Tolerant Approach. In 33rd International Symposium on Distributed Computing (DISC","author":"Parter Merav","year":"2019","unstructured":"Merav Parter. 2019. Small Cuts and Connectivity Certificates: A Fault Tolerant Approach. In 33rd International Symposium on Distributed Computing (DISC 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.102"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.101"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331620"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJACT.2009.023467"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230220503"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.5555\/1062032.1711012"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195462"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028994"},{"key":"e_1_3_2_1_65_1","volume-title":"International Symposium SIGAL '90, Tokyo, Japan, August 16--18, 1990, Proceedings. 358--367","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 '90, Tokyo, Japan, August 16--18, 1990, Proceedings. 358--367."},{"key":"e_1_3_2_1_66_1","volume-title":"Communication on Noisy Channels: A Coding Theorem for Computation. In 33rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 724--733","author":"Schulman Leonard J.","year":"1992","unstructured":"Leonard J. Schulman. 1992. Communication on Noisy Channels: A Coding Theorem for Computation. In 33rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, 724--733."},{"key":"e_1_3_2_1_67_1","volume-title":"12th Australasian Conference, ACISP (Lecture Notes in Computer Science","volume":"473","author":"Srinathan Kannan","unstructured":"Kannan Srinathan, Prasad Raghavendra, and C. Pandu Rangan. 2007. On Proactive Perfectly Secure Message Transmission. In Information Security and Privacy, 12th Australasian Conference, ACISP (Lecture Notes in Computer Science, Vol. 4586). Springer, 461--473."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216031"},{"key":"e_1_3_2_1_69_1","unstructured":"Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract). In FOCS."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767453"}],"event":{"name":"PODC '23: 2023 ACM Symposium on Principles of Distributed Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Orlando FL USA","acronym":"PODC '23"},"container-title":["Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594578","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583668.3594578","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:55Z","timestamp":1750178275000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,16]]},"references-count":70,"alternative-id":["10.1145\/3583668.3594578","10.1145\/3583668"],"URL":"https:\/\/doi.org\/10.1145\/3583668.3594578","relation":{},"subject":[],"published":{"date-parts":[[2023,6,16]]},"assertion":[{"value":"2023-06-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}