{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:16:49Z","timestamp":1783009009747,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2018YFA070470"],"award-info":[{"award-number":["2018YFA070470"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shandong Provincial Key Research and Development Program","award":["2021CXGC010106"],"award-info":[{"award-number":["2021CXGC010106"]}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR00112020021, N66001-15-C-4071"],"award-info":[{"award-number":["HR00112020021, N66001-15-C-4071"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1718135, 1801564, 1915763, 1931714"],"award-info":[{"award-number":["1718135, 1801564, 1915763, 1931714"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538475","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"399-417","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation"],"prefix":"10.1145","author":[{"given":"Nicolas","family":"Alhaddad","sequence":"first","affiliation":[{"name":"Boston University, Boston, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sourav","family":"Das","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sisi","family":"Duan","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ling","family":"Ren","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mayank","family":"Varia","sequence":"additional","affiliation":[{"name":"Boston University, Boston, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhuolun","family":"Xiang","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haibin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538451"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467914"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467899"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538476"},{"key":"e_1_3_2_2_5_1","volume-title":"Succinct erasure coding proof systems. Cryptology ePrint Archive","author":"Alhaddad Nicolas","year":"2021","unstructured":"Nicolas Alhaddad , Sisi Duan , Mayank Varia , and Haibin Zhang . Succinct erasure coding proof systems. Cryptology ePrint Archive , 2021 . Nicolas Alhaddad, Sisi Duan, Mayank Varia, and Haibin Zhang. Succinct erasure coding proof systems. Cryptology ePrint Archive, 2021."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167109"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36288-6_3"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9005-7"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1766171.1766207"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/647097.717005"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-004-0314-9"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_31"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2005.9"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_2_2_17_1","volume-title":"Fundamental limits of byzantine agreement. arXiv preprint arXiv:2009.10965","author":"Chen Jinyuan","year":"2020","unstructured":"Jinyuan Chen . Fundamental limits of byzantine agreement. arXiv preprint arXiv:2009.10965 , 2020 . Jinyuan Chen. Fundamental limits of byzantine agreement. arXiv preprint arXiv:2009.10965, 2020."},{"key":"e_1_3_2_2_18_1","volume-title":"35th International Symposium on Distributed Computing (DISC 2021","author":"Chen Jinyuan","year":"2021","unstructured":"Jinyuan Chen . Optimal error-free multi-valued byzantine agreement . In 35th International Symposium on Distributed Computing (DISC 2021 ). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik , 2021 . Jinyuan Chen. Optimal error-free multi-valued byzantine agreement. In 35th International Symposium on Distributed Computing (DISC 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 2021."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484808"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833584"},{"key":"e_1_3_2_2_21_1","volume-title":"Bounds on information exchange for byzantine agreement. Journal of the ACM (JACM), 32(1):191--204","author":"Dolev Danny","year":"1985","unstructured":"Danny Dolev and R\u00fcdiger Reischuk . Bounds on information exchange for byzantine agreement. Journal of the ACM (JACM), 32(1):191--204 , 1985 . Danny Dolev and R\u00fcdiger Reischuk. Bounds on information exchange for byzantine agreement. Journal of the ACM (JACM), 32(1):191--204, 1985."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243812"},{"key":"e_1_3_2_2_23_1","volume-title":"ACM CCS","author":"Duan Sisi","year":"2022","unstructured":"Sisi Duan and Haibin Zhang . Pace : Fully parallelizable bft from reproposable byzantine agreement . ACM CCS , 2022 . Sisi Duan and Haibin Zhang. Pace: Fully parallelizable bft from reproposable byzantine agreement. ACM CCS, 2022."},{"key":"e_1_3_2_2_24_1","volume-title":"Waterbear: Information-theoretic asynchronous bft made practical. Cryptology ePrint Archive","author":"Duan Sisi","year":"2022","unstructured":"Sisi Duan , Haibin Zhang , and Boxin Zhao . Waterbear: Information-theoretic asynchronous bft made practical. Cryptology ePrint Archive , 2022 . Sisi Duan, Haibin Zhang, and Boxin Zhao. Waterbear: Information-theoretic asynchronous bft made practical. Cryptology ePrint Archive, 2022."},{"key":"e_1_3_2_2_25_1","volume-title":"Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2):374--382","author":"Fischer Michael J","year":"1985","unstructured":"Michael J Fischer , Nancy A Lynch , and Michael S Paterson . Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2):374--382 , 1985 . Michael J Fischer, Nancy A Lynch, and Michael S Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2):374--382, 1985."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3789-9_5"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2017.05.005"},{"key":"e_1_3_2_2_28_1","volume-title":"OPODIS 2020","author":"Guerraoui Rachid","year":"2021","unstructured":"Rachid Guerraoui , Jovan Komatovic , Petr Kuznetsov , Yvonne-Anne Pignolet , Dragos-Adrian Seredinschi , and Andrei Tonkikh . Dynamic byzantine reliable broadcast . In OPODIS 2020 , 2021 . Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, and Andrei Tonkikh. Dynamic byzantine reliable broadcast. In OPODIS 2020, 2021."},{"key":"e_1_3_2_2_29_1","volume-title":"DISC 2019","author":"Guerraoui Rachid","year":"2019","unstructured":"Rachid Guerraoui , Petr Kuznetsov , Matteo Monti , Matej Pavlovic , and Dragos-Adrian Seredinschi . Scalable byzantine reliable broadcast . In DISC 2019 , 2019 . Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, and Dragos-Adrian Seredinschi. Scalable byzantine reliable broadcast. In DISC 2019, 2019."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417262"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281122"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467905"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3423364"},{"key":"e_1_3_2_2_34_1","volume-title":"Mib: Asynchronous bft with more replicas. arXiv preprint arXiv:2108.04488","author":"Liu Chao","year":"2021","unstructured":"Chao Liu , Sisi Duan , and Haibin Zhang . Mib: Asynchronous bft with more replicas. arXiv preprint arXiv:2108.04488 , 2021 . Chao Liu, Sisi Duan, and Haibin Zhang. Mib: Asynchronous bft with more replicas. arXiv preprint arXiv:2108.04488, 2021."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354238"},{"key":"e_1_3_2_2_36_1","volume-title":"The theory of error correcting codes","author":"MacWilliams Florence Jessie","year":"1977","unstructured":"Florence Jessie MacWilliams and Neil James Alexander Sloane . The theory of error correcting codes , volume 16 . Elsevier , 1977 . Florence Jessie MacWilliams and Neil James Alexander Sloane. The theory of error correcting codes, volume 16. Elsevier, 1977."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_2_2_38_1","volume-title":"34th International Symposium on Distributed Computing (DISC 2020","author":"Nayak Kartik","year":"2020","unstructured":"Kartik Nayak , Ling Ren , Elaine Shi , Nitin H Vaidya , and Zhuolun Xiang . Improved extension protocols for byzantine broadcast and agreement . In 34th International Symposium on Distributed Computing (DISC 2020 ). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik , 2020 . Kartik Nayak, Ling Ren, Elaine Shi, Nitin H Vaidya, and Zhuolun Xiang. Improved extension protocols for byzantine broadcast and agreement. In 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 2020."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25873-2_4"},{"key":"e_1_3_2_2_40_1","first-page":"253","volume-title":"FAST","author":"Plank James S.","year":"2009","unstructured":"James S. Plank , Jianqiang Luo , Catherine D. Schuman , Lihao Xu , and Zooko Wilcox-O'Hearn . A performance evaluation and examination of open-source erasure coding libraries for storage . In FAST , pages 253 -- 265 . USENIX, 2009 . James S. Plank, Jianqiang Luo, Catherine D. Schuman, Lihao Xu, and Zooko Wilcox-O'Hearn. A performance evaluation and examination of open-source erasure coding libraries for storage. In FAST, pages 253--265. USENIX, 2009."},{"key":"e_1_3_2_2_41_1","first-page":"173","volume-title":"NCA","author":"Plank James S","year":"2006","unstructured":"James S Plank and Lihao Xu . Optimizing cauchy reed-solomon codes for fault-tolerant network storage applications . In NCA , pages 173 -- 180 . IEEE, 2006 . James S Plank and Lihao Xu. Optimizing cauchy reed-solomon codes for fault-tolerant network storage applications. In NCA, pages 173--180. IEEE, 2006."},{"key":"e_1_3_2_2_42_1","volume-title":"Polynomial codes over certain finite fields. Journal of the society for industrial and applied mathematics, 8(2):300--304","author":"Reed Irving S","year":"1960","unstructured":"Irving S Reed and Gustave Solomon . Polynomial codes over certain finite fields. Journal of the society for industrial and applied mathematics, 8(2):300--304 , 1960 . Irving S Reed and Gustave Solomon. Polynomial codes over certain finite fields. Journal of the society for industrial and applied mathematics, 8(2):300--304, 1960."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/191177.191194"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_15"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/800222.806744"},{"key":"e_1_3_2_2_46_1","volume-title":"December 30","author":"Welch Lloyd R","year":"1986","unstructured":"Lloyd R Welch and Elwyn R Berlekamp . Error correction for algebraic block codes , December 30 1986 . US Patent 4,633,470. Lloyd R Welch and Elwyn R Berlekamp. Error correction for algebraic block codes, December 30 1986. US Patent 4,633,470."},{"key":"e_1_3_2_2_47_1","volume-title":"hbacss: How to robustly share many secrets. In (To appear) Proceedings of the 29th Annual Network and Distributed System Security Symposium","author":"Yurek Thomas","year":"2022","unstructured":"Thomas Yurek , Licheng Luo , Jaiden Fairoze , Aniket Kate , and Andrew Miller . hbacss: How to robustly share many secrets. In (To appear) Proceedings of the 29th Annual Network and Distributed System Security Symposium , 2022 . Thomas Yurek, Licheng Luo, Jaiden Fairoze, Aniket Kate, and Andrew Miller. hbacss: How to robustly share many secrets. In (To appear) Proceedings of the 29th Annual Network and Distributed System Security Symposium, 2022."}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","location":"Salerno Italy","acronym":"PODC '22","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538475","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538475","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538475","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:21Z","timestamp":1750191141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":47,"alternative-id":["10.1145\/3519270.3538475","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538475","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}