{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:44:34Z","timestamp":1782927874643,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Singapore Ministry of Education","award":["MOET32024-0004"],"award-info":[{"award-number":["MOET32024-0004"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,6]]},"DOI":"10.1145\/3796701.3815911","type":"proceedings-article","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:40:43Z","timestamp":1782924043000},"page":"550-511","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-7794-8264","authenticated-orcid":false,"given":"Michael Yiqing","family":"Hu","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6146-5871","authenticated-orcid":false,"given":"Alvin Hong Yao","family":"Yan","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3530-7662","authenticated-orcid":false,"given":"Jialin","family":"Li","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Revisited. Proceedings of the ACM Symposium on Principles of Distributed Computing.","author":"Abraham Ittai","year":"2019","unstructured":"Ittai Abraham, T-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, and Elaine Shi. 2019. Communication Complexity of Byzantine Agreement, Revisited. Proceedings of the ACM Symposium on Principles of Distributed Computing."},{"key":"e_1_3_2_1_2_1","first-page":"118","article-title":"Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme","volume":"2002","author":"Boldyreva Alexandra","year":"2002","unstructured":"Alexandra Boldyreva. 2002. Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme. IACR Cryptol. ePrint Arch. 2002 (2002), 118.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Dan Boneh Manu Drijvers and Gregory Neven. 2018. Compact Multi-Signatures for Smaller Blockchains. In IACR Cryptology ePrint Archive.","DOI":"10.1007\/978-3-030-03329-3_15"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s00145-005-0318-0","article-title":"Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography","volume":"18","author":"Cachin Christian","year":"2000","unstructured":"Christian Cachin, Klaus Kursawe, and Victor Shoup. 2000. Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography. Journal of Cryptology 18 (2000), 219\u2013246.","journal-title":"Journal of Cryptology"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.64"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3732772.3733520"},{"key":"e_1_3_2_1_9_1","volume-title":"Every Bit Counts in Consensus. ArXiv abs\/2306.00431","author":"Civit Pierre","year":"2023","unstructured":"Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Matteo Monti, and Manuel Vidigueira. 2023. Every Bit Counts in Consensus. ArXiv abs\/2306.00431 (2023)."},{"key":"e_1_3_2_1_10_1","volume-title":"International Symposium on Distributed Computing.","author":"Cohen Shir","year":"2020","unstructured":"Shir Cohen, Idit Keidar, and Alexander Spiegelman. 2020. Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP. In International Symposium on Distributed Computing."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756169.1756200"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the Seventeenth European Conference on Computer Systems","author":"Danezis George","year":"2021","unstructured":"George Danezis, Eleftherios Kokoris-Kogias, Alberto Sonnino, and Alexander Spiegelman. 2021. Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus. Proceedings of the Seventeenth European Conference on Computer Systems (2021)."},{"key":"e_1_3_2_1_13_1","volume-title":"Byzantine Consensus in the Random Asynchronous Model. In 39th International Symposium on Distributed Computing (DISC","author":"Danezis George","year":"2025","unstructured":"George Danezis, Jovan Komatovic, Lefteris Kokoris-Kogias, Alberto Sonnino, and Igor Zablotchi. 2025. Byzantine Consensus in the Random Asynchronous Model. In 39th International Symposium on Distributed Computing (DISC 2025)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484808"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","author":"Giridharan Neil","year":"2022","unstructured":"Neil Giridharan, Lefteris Kokoris-Kogias, Alberto Sonnino, and Alexander Spiegelman. 2022. Bullshark: DAG BFT Protocols Made Practical. Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (2022)."},{"key":"e_1_3_2_1_17_1","volume-title":"Alvin Hong Yao Yan","author":"Hu Jialin Li Michael Yiqing","year":"2026","unstructured":"Michael Yiqing Hu Jialin Li, Alvin Hong Yao Yan. 2026. Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience. ArXiv (2026)."},{"key":"e_1_3_2_1_18_1","volume-title":"On expected constant-round protocols for Byzantine agreement. Electron. Colloquium Comput. Complex. TR06","author":"Katz Jonathan","year":"2006","unstructured":"Jonathan Katz and Chiu-Yuen Koo. 2006. On expected constant-round protocols for Byzantine agreement. Electron. Colloquium Comput. Complex. TR06 (2006)."},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing","author":"Keidar Idit","year":"2021","unstructured":"Idit Keidar, Eleftherios Kokoris-Kogias, Oded Naor, and Alexander Spiegelman. 2021. All You Need is DAG. Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (2021)."},{"key":"e_1_3_2_1_20_1","volume-title":"Optimal Communication Complexity of Authenticated Byzantine Agreement. In International Symposium on Distributed Computing.","author":"Momose Atsuki","year":"2021","unstructured":"Atsuki Momose and Ling Ren. 2021. Optimal Communication Complexity of Authenticated Byzantine Agreement. In International Symposium on Distributed Computing."},{"key":"e_1_3_2_1_21_1","first-page":"877","article-title":"Towards Improving Throughput and Scalability of DAG-based BFT SMR","volume":"2025","author":"Shrestha Nibesh","year":"2025","unstructured":"Nibesh Shrestha and Aniket Kate. 2025. Towards Improving Throughput and Scalability of DAG-based BFT SMR. IACR Cryptol. ePrint Arch. 2025 (2025), 877.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594596"},{"key":"e_1_3_2_1_23_1","first-page":"664","article-title":"Pando: Extremely Scalable BFT Based on Committee Sampling","volume":"2024","author":"Wang Xin","year":"2024","unstructured":"Xin Wang, Haochen Wang, Haibin Zhang, and Sisi Duan. 2024. Pando: Extremely Scalable BFT Based on Committee Sampling. IACR Cryptol. ePrint Arch. 2024 (2024), 664.","journal-title":"IACR Cryptol. ePrint Arch."}],"event":{"name":"PODC '26: ACM Symposium on Principles of Distributed Computing","location":"Egham United Kingdom","acronym":"PODC '26","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\/3796701.3815911","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:48:02Z","timestamp":1782924482000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3796701.3815911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":23,"alternative-id":["10.1145\/3796701.3815911","10.1145\/3796701"],"URL":"https:\/\/doi.org\/10.1145\/3796701.3815911","relation":{},"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"2026-07-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}