{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T20:01:14Z","timestamp":1766088074397,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF award","award":["2143058"],"award-info":[{"award-number":["2143058"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,19]]},"DOI":"10.1145\/3583668.3594596","type":"proceedings-article","created":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T22:28:38Z","timestamp":1686954518000},"page":"253-261","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["On the Amortized Communication Complexity of Byzantine Broadcast"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-6357-3515","authenticated-orcid":false,"given":"Jun","family":"Wan","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, Massachusetts, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-2201-9640","authenticated-orcid":false,"given":"Atsuki","family":"Momose","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, Illinois, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3437-7570","authenticated-orcid":false,"given":"Ling","family":"Ren","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, Illinois, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5605-1048","authenticated-orcid":false,"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, Pennsylvania, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4398-3428","authenticated-orcid":false,"given":"Zhuolun","family":"Xiang","sequence":"additional","affiliation":[{"name":"Aptos, Palo Alto, California, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"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\/3293611.3331629"},{"key":"e_1_3_2_1_2_1","volume-title":"Sync HotStuff: Simple and Practical Synchronous State Machine Replication. In 2020 IEEE Symposium on Security and Privacy (SP). 106--118","author":"Abraham Ittai","year":"2020","unstructured":"Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Maofan Yin. 2020. Sync HotStuff: Simple and Practical Synchronous State Machine Replication. In 2020 IEEE Symposium on Security and Privacy (SP). 106--118."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the 20th Annual Symposium on the Theory of Computing (STOC'88)","author":"Ben-Or Michael","year":"1988","unstructured":"Michael Ben-Or, Shafi Goldwasser, and Avi Widgerson. 1988. Completeness theorems for noncryptographic fault-tolerant distributed computations. In Proceedings of the 20th Annual Symposium on the Theory of Computing (STOC'88). 1--10."},{"volume-title":"Computer science","author":"Berman Piotr","key":"e_1_3_2_1_5_1","unstructured":"Piotr Berman, Juan A Garay, and Kenneth J Perry. 1992. Bit optimal distributed consensus. In Computer science. Springer, 313--321."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_13"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36288-6_3"},{"volume-title":"Introduction to reliable and secure distributed programming","author":"Cachin Christian","key":"e_1_3_2_1_8_1","unstructured":"Christian Cachin, Rachid Guerraoui, and Lu\u00eds Rodrigues. 2011. Introduction to reliable and secure distributed programming. Springer Science & Business Media."},{"key":"e_1_3_2_1_9_1","volume-title":"Not a coincidence: Sub-quadratic asynchronous byzantine agreement whp. arXiv preprint arXiv:2002.06545","author":"Cohen Shir","year":"2020","unstructured":"Shir Cohen, Idit Keidar, and Alexander Spiegelman. 2020. Not a coincidence: Sub-quadratic asynchronous byzantine agreement whp. arXiv preprint arXiv:2002.06545 (2020)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1060"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933082"},{"key":"e_1_3_2_1_15_1","volume-title":"Optimal extension protocols for byzantine broadcast and agreement. Distributed Computing","author":"Ganesh Chaya","year":"2020","unstructured":"Chaya Ganesh and Arpita Patra. 2020. Optimal extension protocols for byzantine broadcast and agreement. Distributed Computing (2020), 1--19."},{"key":"e_1_3_2_1_16_1","volume-title":"Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback. arXiv preprint arXiv:2106.10362","author":"Gelashvili Rati","year":"2021","unstructured":"Rati Gelashvili, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander Spiegelman, and Zhuolun Xiang. 2021. Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback. arXiv preprint arXiv:2106.10362 (2021)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0347-3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06944-4_4"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_1_20_1","volume-title":"Non-interactive distributed key generation and key resharing. Cryptology ePrint Archive","author":"Groth Jens","year":"2021","unstructured":"Jens Groth. 2021. Non-interactive distributed key generation and key resharing. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_28"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989727.1989732"},{"volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Kursawe Klaus","key":"e_1_3_2_1_23_1","unstructured":"Klaus Kursawe and Victor Shoup. 2005. Optimistic asynchronous atomic broadcast. In International Colloquium on Automata, Languages, and Programming. Springer, 204--215."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993809"},{"key":"e_1_3_2_1_25_1","volume-title":"Bolt-dumbo transformer: Asynchronous consensus as fast as pipelined bft. arXiv preprint arXiv:2103.09425","author":"Lu Yuan","year":"2021","unstructured":"Yuan Lu, Zhenliang Lu, and Qiang Tang. 2021. Bolt-dumbo transformer: Asynchronous consensus as fast as pipelined bft. arXiv preprint arXiv:2103.09425 (2021)."},{"key":"e_1_3_2_1_26_1","volume-title":"Optimal Communication Complexity of Authenticated Byzantine Agreement. In 35th International Symposium on Distributed Computing (DISC","author":"Momose Atsuki","year":"2021","unstructured":"Atsuki Momose and Ling Ren. 2021. Optimal Communication Complexity of Authenticated Byzantine Agreement. In 35th International Symposium on Distributed Computing (DISC 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_27_1","volume-title":"Improved Extension Protocols for Byzantine Broadcast and Agreement. In 34th International Symposium on Distributed Computing (DISC","author":"Nayak Kartik","year":"2020","unstructured":"Kartik Nayak, Ling Ren, Elaine Shi, Nitin H Vaidya, and Zhuolun Xiang. 2020. Improved Extension Protocols for Byzantine Broadcast and Agreement. In 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_47"},{"key":"e_1_3_2_1_29_1","volume-title":"International Conference On Principles Of Distributed Systems. Springer, 88--102","author":"Ramasamy HariGovind V","year":"2005","unstructured":"HariGovind V Ramasamy and Christian Cachin. 2005. Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast. In International Conference On Principles Of Distributed Systems. Springer, 88--102."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"e_1_3_2_1_31_1","volume-title":"35th International Symposium on Distributed Computing.","author":"Spiegelman Alexander","year":"2021","unstructured":"Alexander Spiegelman. 2021. In Search for an Optimal Authenticated Byzantine Agreement. In 35th International Symposium on Distributed Computing."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_14"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"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.3594596","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583668.3594596","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.3594596"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,16]]},"references-count":33,"alternative-id":["10.1145\/3583668.3594596","10.1145\/3583668"],"URL":"https:\/\/doi.org\/10.1145\/3583668.3594596","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"}}]}}