{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:55Z","timestamp":1750220335558,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538458","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"421-423","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Make Every Word Count: Adaptive Byzantine Agreement with Fewer Words"],"prefix":"10.1145","author":[{"given":"Shir","family":"Cohen","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Idit","family":"Keidar","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Alexander","family":"Spiegelman","sequence":"additional","affiliation":[{"name":"Aptos, Palo Alto, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_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 . 2018. Hot-Stuff the Linear , Optimal-Resilience, One-Message BFT Devil. CoRR abs\/1803.05069 ( 2018 ). Ittai Abraham, Guy Golan-Gueta, and Dahlia Malkhi. 2018. Hot-Stuff the Linear, Optimal-Resilience, One-Message BFT Devil. CoRR abs\/1803.05069 (2018)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2_1","DOI":"10.1145\/3293611.3331612"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_3_1","DOI":"10.5555\/647097.717005"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_4_1","DOI":"10.5555\/646766.704283"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_5_1","DOI":"10.1007\/s00145-005-0318-0"},{"key":"e_1_3_2_2_6_1","volume-title":"34th International Symposium on Distributed Computing (DISC","author":"Cohen Shir","year":"2020","unstructured":"Shir Cohen , Idit Keidar , and Alexander Spiegelman . 2020 . Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP . In 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz- Zentrum f\u00fcr Informatik. Shir Cohen, Idit Keidar, and Alexander Spiegelman. 2020. Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP. In 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz- Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_2_7_1","volume-title":"Make Every Word Count: Adaptive BA with Fewer Words. arXiv preprint arXiv:2202.09123","author":"Cohen Shir","year":"2022","unstructured":"Shir Cohen , Idit Keidar , and Alexander Spiegelman . 2022. Make Every Word Count: Adaptive BA with Fewer Words. arXiv preprint arXiv:2202.09123 ( 2022 ). Shir Cohen, Idit Keidar, and Alexander Spiegelman. 2022. Make Every Word Count: Adaptive BA with Fewer Words. arXiv preprint arXiv:2202.09123 (2022)."},{"key":"e_1_3_2_2_8_1","volume-title":"Conference on the Theory and Application of Cryptographic Techniques. Springer, 120--127","author":"Desmedt Yvo","year":"1987","unstructured":"Yvo Desmedt . 1987 . Society and group oriented cryptography: A new concept . In Conference on the Theory and Application of Cryptographic Techniques. Springer, 120--127 . Yvo Desmedt. 1987. Society and group oriented cryptography: A new concept. In Conference on the Theory and Application of Cryptographic Techniques. Springer, 120--127."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_9_1","DOI":"10.1137\/0212045"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_10_1","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_2_11_1","volume-title":"Optimal Communication Complexity of Authenticated Byzantine Agreement. arXiv preprint arXiv:2007.13175","author":"Momose Atsuki","year":"2020","unstructured":"Atsuki Momose and Ling Ren . 2020. Optimal Communication Complexity of Authenticated Byzantine Agreement. arXiv preprint arXiv:2007.13175 ( 2020 ). Atsuki Momose and Ling Ren. 2020. Optimal Communication Complexity of Authenticated Byzantine Agreement. arXiv preprint arXiv:2007.13175 (2020)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_12_1","DOI":"10.5555\/1756169.1756190"},{"key":"e_1_3_2_2_13_1","volume-title":"35th International Symposium on Distributed Computing (DISC","author":"Spiegelman Alexander","year":"2021","unstructured":"Alexander Spiegelman . 2021 . In search for an optimal authenticated byzantine agreement . In 35th International Symposium on Distributed Computing (DISC 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. Alexander Spiegelman. 2021. In search for an optimal authenticated byzantine agreement. In 35th International Symposium on Distributed Computing (DISC 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."}],"event":{"sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"PODC '22","name":"PODC '22: ACM Symposium on Principles of Distributed Computing","location":"Salerno Italy"},"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.3538458","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538458","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.3538458"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":13,"alternative-id":["10.1145\/3519270.3538458","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538458","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"}}]}}