{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T22:21:28Z","timestamp":1762035688240,"version":"build-2065373602"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2021,3,16]],"date-time":"2021-03-16T00:00:00Z","timestamp":1615852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2021,3,16]]},"abstract":"<jats:p>The development of reliable distributed systems often relies on Byzantine Agreement (BA) [26]. In this problem, a set of correct processes aim to reach a common decision, despite the presence of malicious ones. BA has been around for four decades, yet practical use-cases for it in large-scale systems have emerged only in the last decade. One major application for BA is cryptocurrencies. For example, Bitcoin [30], the rst cryptocurrency, requires a large set of users to agree on the state of the blockchain. Since Bitcoin is a real currency with real value, the need to protect it against Byzantine users is crucial. Following Bitcoin, many other blockchains and FinTech platforms have emerged, e.g., [6,21,30,36]. Consequently, an efficient implementation, in terms of communication, has become one of the main foci of BA solutions.<\/jats:p>","DOI":"10.1145\/3457588.3457600","type":"journal-article","created":{"date-parts":[[2021,3,16]],"date-time":"2021-03-16T22:06:51Z","timestamp":1615932411000},"page":"71-80","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Byzantine Agreement with Less Communication"],"prefix":"10.1145","volume":"52","author":[{"given":"Shir","family":"Cohen","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Idit","family":"Keidar","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Oded","family":"Naor","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2021,3,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331629"},{"key":"e_1_2_1_2_1","volume-title":"Optimal- Resilience, One-Message BFT Devil. CoRR, abs\/1803.05069","author":"Abraham Ittai","year":"2018","unstructured":"Ittai Abraham , Guy Golan-Gueta , and Dahlia Malkhi . Hot-Stu the Linear , Optimal- Resilience, One-Message BFT Devil. CoRR, abs\/1803.05069 , 2018 . Ittai Abraham, Guy Golan-Gueta, and Dahlia Malkhi. Hot-Stu the Linear, Optimal- Resilience, One-Message BFT Devil. CoRR, abs\/1803.05069, 2018."},{"key":"e_1_2_1_3_1","first-page":"118","volume-title":"2020 IEEE Symposium on Security and Privacy (SP)","author":"Abraham Ittai","unstructured":"Ittai Abraham , Dahlia Malkhi , Kartik Nayak , Ling Ren , and Maofan Yin . Sync HotStu : Simple and practical synchronous state machine replication . In 2020 IEEE Symposium on Security and Privacy (SP) , pages 106{ 118 . IEEE, 2020. Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Maofan Yin. Sync HotStu : Simple and practical synchronous state machine replication. In 2020 IEEE Symposium on Security and Privacy (SP), pages 106{118. IEEE, 2020."},{"key":"e_1_2_1_4_1","volume-title":"Validated asynchronous byzantine agreement with optimal resilience and asymptotically optimal time and word communication. CoRR, abs\/1811.01332","author":"Abraham Ittai","year":"2018","unstructured":"Ittai Abraham , Dahlia Malkhi , and Alexander Spiegelman . Validated asynchronous byzantine agreement with optimal resilience and asymptotically optimal time and word communication. CoRR, abs\/1811.01332 , 2018 . Ittai Abraham, Dahlia Malkhi, and Alexander Spiegelman. Validated asynchronous byzantine agreement with optimal resilience and asymptotically optimal time and word communication. CoRR, abs\/1811.01332, 2018."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331612"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806707"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/166961.167018"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806706"},{"key":"e_1_2_1_11_1","volume-title":"Casper the friendly nality gadget. arXiv preprint arXiv:1710.09437","author":"Buterin Vitalik","year":"2017","unstructured":"Vitalik Buterin and Virgil Griffith . Casper the friendly nality gadget. arXiv preprint arXiv:1710.09437 , 2017 . Vitalik Buterin and Virgil Griffith. Casper the friendly nality gadget. arXiv preprint arXiv:1710.09437, 2017."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/646766.704283"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0318-0"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"e_1_2_1_15_1","volume-title":"Algorand agreement: Super fast and partition resilient byzantine agreement. IACR Cryptology ePrint Archive","author":"Chen Jing","year":"2018","unstructured":"Jing Chen , Sergey Gorbunov , Silvio Micali , and Georgios Vlachos . Algorand agreement: Super fast and partition resilient byzantine agreement. IACR Cryptology ePrint Archive , 2018 :377, 2018. Jing Chen, Sergey Gorbunov, Silvio Micali, and Georgios Vlachos. Algorand agreement: Super fast and partition resilient byzantine agreement. IACR Cryptology ePrint Archive, 2018:377, 2018."},{"key":"e_1_2_1_16_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 . Not a coincidence: Sub-quadratic asynchronous byzantine agreement whp. arXiv preprint arXiv:2002.06545 , 2020 . Shir Cohen, Idit Keidar, and Alexander Spiegelman. Not a coincidence: Sub-quadratic asynchronous byzantine agreement whp. arXiv preprint arXiv:2002.06545, 2020."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417262"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989727.1989732"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488658"},{"key":"e_1_2_1_25_1","first-page":"6","article-title":"Consensus without mining","volume":"0","author":"Kwon Jae","year":"2014","unstructured":"Jae Kwon . Tendermint : Consensus without mining . Draft v. 0 . 6 , fall, 1(11), 2014 . Jae Kwon. Tendermint: Consensus without mining. Draft v. 0.6, fall, 1(11), 2014.","journal-title":"Draft"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796482"},{"key":"e_1_2_1_28_1","volume-title":"Optimal communication complexity of byzantine consensus under honest majority. arXiv preprint arXiv:2007.13175","author":"Momose Atsuki","year":"2020","unstructured":"Atsuki Momose and Ling Ren . Optimal communication complexity of byzantine consensus under honest majority. arXiv preprint arXiv:2007.13175 , 2020 . Atsuki Momose and Ling Ren. Optimal communication complexity of byzantine consensus under honest majority. arXiv preprint arXiv:2007.13175, 2020."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785953"},{"key":"e_1_2_1_30_1","volume-title":"Bitcoin: A peer-to-peer electronic cash system","author":"Nakamoto Satoshi","year":"2009","unstructured":"Satoshi Nakamoto . Bitcoin: A peer-to-peer electronic cash system , 2009 . Satoshi Nakamoto. Bitcoin: A peer-to-peer electronic cash system, 2009."},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the Cryptoeconomic Systems Conference (CES'20)","author":"Naor Oded","year":"2020","unstructured":"Oded Naor , Mathieu Baudet , Dahlia Malkhi , and Alexander Spiegelman . Cogsworth : Byzantine view synchronization . In Proceedings of the Cryptoeconomic Systems Conference (CES'20) , 2020 . Oded Naor, Mathieu Baudet, Dahlia Malkhi, and Alexander Spiegelman. Cogsworth: Byzantine view synchronization. In Proceedings of the Cryptoeconomic Systems Conference (CES'20), 2020."},{"key":"e_1_2_1_32_1","volume-title":"34th International Symposium on Distributed Computing (DISC)","author":"Naor Oded","year":"2020","unstructured":"Oded Naor and Idit Keidar . Expected Linear Round Synchronization: The missing link for Linear Byzantine SMR . In 34th International Symposium on Distributed Computing (DISC) , 2020 . Oded Naor and Idit Keidar. Expected Linear Round Synchronization: The missing link for Linear Byzantine SMR. In 34th International Symposium on Distributed Computing (DISC), 2020."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"e_1_2_1_34_1","unstructured":"Matthieu Rambaud. Lower bounds for authenticated randomized byzantine consensus under (partial) synchrony: The limits of standalone digital signatures.  Matthieu Rambaud. Lower bounds for authenticated randomized byzantine consensus under (partial) synchrony: The limits of standalone digital signatures."},{"key":"e_1_2_1_35_1","volume-title":"search for a linear byzantine agreement. arXiv preprint arXiv:2002.06993","author":"Spiegelman Alexander","year":"2020","unstructured":"Alexander Spiegelman . In search for a linear byzantine agreement. arXiv preprint arXiv:2002.06993 , 2020 . Alexander Spiegelman. In search for a linear byzantine agreement. arXiv preprint arXiv:2002.06993, 2020."},{"key":"e_1_2_1_36_1","volume-title":"Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper, 151(2014):1{32","author":"Gavin Wood","year":"2014","unstructured":"Gavin Wood et al. Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper, 151(2014):1{32 , 2014 . Gavin Wood et al. Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper, 151(2014):1{32, 2014."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3457588.3457600","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3457588.3457600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:07Z","timestamp":1750195687000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3457588.3457600"}},"subtitle":["Recent Advances"],"short-title":[],"issued":{"date-parts":[[2021,3,16]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3,16]]}},"alternative-id":["10.1145\/3457588.3457600"],"URL":"https:\/\/doi.org\/10.1145\/3457588.3457600","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2021,3,16]]},"assertion":[{"value":"2021-03-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}