{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:40:58Z","timestamp":1782970858995,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":71,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["MOE-T2EP20122-0014"],"award-info":[{"award-number":["MOE-T2EP20122-0014"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["200021_215383"],"award-info":[{"award-number":["200021_215383"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["40B2-0_218648"],"award-info":[{"award-number":["40B2-0_218648"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3662158.3662792","type":"proceedings-article","created":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T14:38:06Z","timestamp":1717598286000},"page":"145-156","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["DARE to Agree: Byzantine Agreement With Optimal Resilience and Adaptive Communication"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2394-1201","authenticated-orcid":false,"given":"Pierre","family":"Civit","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7962-0677","authenticated-orcid":false,"given":"Muhammad Ayaz","family":"Dzulfikar","sequence":"additional","affiliation":[{"name":"NUS Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3298-7412","authenticated-orcid":false,"given":"Seth","family":"Gilbert","sequence":"additional","affiliation":[{"name":"NUS Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4794-8902","authenticated-orcid":false,"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9714-4079","authenticated-orcid":false,"given":"Jovan","family":"Komatovic","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5821-2571","authenticated-orcid":false,"given":"Manuel","family":"Vidigueira","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095810.1095817"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331629"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.OPODIS.2017.25"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331612"},{"key":"e_1_3_2_1_5_1","unstructured":"Ittai Abraham Kartik Nayak and Nibesh Shrestha. 2023. Communication and Round Efficient Parallel Broadcast Protocols. IACR Cryptol. ePrint Arch. (2023) 1172. https:\/\/eprint.iacr.org\/2023\/1172"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46215.2023.10179436"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"Michael Ben-Or Shafi Goldwasser and Avi Wigderson. 2019. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali Oded Goldreich (Ed.). ACM 351--371. 10.1145\/3335741.3335756","DOI":"10.1145\/3335741.3335756"},{"key":"e_1_3_2_1_8_1","volume-title":"Computer science: research and applications","author":"Berman Piotr","unstructured":"Piotr Berman, Juan A Garay, and Kenneth J Perry. 1992. Bit Optimal Distributed Consensus. In Computer science: research and applications. Springer, 313--321."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22963-3_17"},{"key":"e_1_3_2_1_10_1","first-page":"1","article-title":"Communication Lower Bounds for Cryptographic Broadcast Protocols. In 37th International Symposium on Distributed Computing (DISC). L'Aquila","volume":"10","author":"Blum Erica","year":"2023","unstructured":"Erica Blum, Elette Boyle, Ran Cohen, and Chen-Da Liu-Zhang. 2023. Communication Lower Bounds for Cryptographic Broadcast Protocols. In 37th International Symposium on Distributed Computing (DISC). L'Aquila, Italy, 10:1--10:19.","journal-title":"Italy"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_13"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467897"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2018.24"},{"key":"e_1_3_2_1_14_1","volume-title":"Tendermint: Byzantine Fault Tolerance in the Age of Blockchains. Ph. D. Dissertation","author":"Buchman Ethan","year":"2016","unstructured":"Ethan Buchman. 2016. Tendermint: Byzantine Fault Tolerance in the Age of Blockchains. Ph. D. Dissertation. University of Guelph."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2004.24"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45388-6_9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.02.001"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594599"},{"key":"e_1_3_2_1_20_1","volume-title":"36th International Symposium on Distributed Computing (DISC","author":"Civit Pierre","year":"2022","unstructured":"Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, and Manuel Vidigueira. 2022. Byzantine Consensus Is \u0398 (n2): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony!. In 36th International Symposium on Distributed Computing (DISC 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_21_1","volume-title":"Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, and Manuel Vidigueira.","author":"Civit Pierre","year":"2024","unstructured":"Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, and Manuel Vidigueira. 2024. DARE to agree: Byzantine Agreement with Optimal Resilience and Adaptive Communication. Cryptology ePrint Archive (2024)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2023.13"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2311.08060"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594567"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90004-Y"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06944-4_9"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-47751-5_3"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2020.25"},{"key":"e_1_3_2_1_29_1","volume-title":"Make Every Word Count: Adaptive Byzantine Agreement with Fewer Words. In 26th International Conference on Principles of Distributed Systems (OPODIS","author":"Cohen Shir","year":"2023","unstructured":"Shir Cohen, Idit Keidar, and Alexander Spiegelman. 2023. Make Every Word Count: Adaptive Byzantine Agreement with Fewer Words. In 26th International Conference on Principles of Distributed Systems (OPODIS 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_30_1","first-page":"2019","article-title":"From Byzantine Consensus to Blockchain Consensus","volume":"41","author":"Correia Miguel","year":"2019","unstructured":"Miguel Correia. 2019. From Byzantine Consensus to Blockchain Consensus. Essentials of Blockchain Technology 41 (2019), 2019.","journal-title":"Essentials of Blockchain Technology"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2018.8548057"},{"key":"e_1_3_2_1_32_1","volume-title":"Powers of Tau in Asynchrony. 31st Annual Network and Distributed System Security Symposium, NDSS 2024","author":"Das Sourav","year":"2024","unstructured":"Sourav Das, Zhuolun Xiang, and Ling Ren. 2024. Powers of Tau in Asynchrony. 31st Annual Network and Distributed System Security Symposium, NDSS 2024, San Diego, California, USA, February 26 - March 1, 2024 (2024). https:\/\/eprint.iacr.org\/2022\/1683"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16715-2_7"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_1_35_1","volume-title":"Symposium on Discrete Algorithms (SODA) (2024","author":"Elsheimy Fatima","year":"2024","unstructured":"Fatima Elsheimy, Giorgos Tsimos, and Charalampos Papamanthou. 2024. Deterministic Byzantine Agreement with Adaptive O(n\u00b7 f) Communication. Symposium on Discrete Algorithms (SODA) (2024), 1723. https:\/\/eprint.iacr.org\/2023\/1723"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/323596.323602"},{"key":"e_1_3_2_1_37_1","volume-title":"Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model. In Conference on the Theory and Application of Cryptographic Techniques. Springer, 135--155","author":"Galil Zvi","year":"1987","unstructured":"Zvi Galil, Stuart Haber, and Moti Yung. 1987. Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model. In Conference on the Theory and Application of Cryptographic Techniques. Springer, 135--155."},{"key":"e_1_3_2_1_38_1","unstructured":"Sanjam Garg Abhishek Jain Pratyay Mukherjee Rohit Sinha Mingyuan Wang and Yinuo Zhang. 2023. hinTS: Threshold Signatures with Silent Setup. IACR Cryptol. ePrint Arch. (2023) 567. https:\/\/eprint.iacr.org\/2023\/567"},{"key":"e_1_3_2_1_39_1","volume-title":"Brief Announcement: Scalable Agreement Protocols with Optimal Optimistic Efficiency. 37th International Symposium on Distributed Computing, (DISC)","author":"Gelles Yuval","year":"2023","unstructured":"Yuval Gelles and Ilan Komargodski. 2023. Brief Announcement: Scalable Agreement Protocols with Optimal Optimistic Efficiency. 37th International Symposium on Distributed Computing, (DISC) (2023), 42:1--42:6."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Yuval Gelles and Ilan Komargodski. 2023. Optimal Load-Balanced Scalable Distributed Agreement. In IACR Cryptol. ePrint Arch.","DOI":"10.1145\/3618260.3649736"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0117-1"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.895986"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294279"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17679-1_18"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04355-0_47"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989727.1989732"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294267"},{"key":"e_1_3_2_1_51_1","unstructured":"Kwangsu Lee. 2023. Decentralized Threshold Signatures for Blockchains with Non-Interactive and Transparent Setup. IACR Cryptol. ePrint Arch. (2023) 1206. https:\/\/eprint.iacr.org\/2023\/1206"},{"key":"e_1_3_2_1_52_1","volume-title":"Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model. arXiv preprint arXiv:2201.01107","author":"Lewis-Pye Andrew","year":"2022","unstructured":"Andrew Lewis-Pye. 2022. Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model. arXiv preprint arXiv:2201.01107 (2022)."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2301.09881"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.02.031"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405707"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484554"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2021.32"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2020.28"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_19"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_61_1","unstructured":"Tian Qiu and Qiang Tang. 2023. Predicate Aggregate Signatures and Applications. IACR Cryptol. ePrint Arch. (2023) 1694. https:\/\/eprint.iacr.org\/2023\/1694"},{"key":"e_1_3_2_1_62_1","unstructured":"Matthieu Rambaud. 2023. Bootstrapping Message-Linear-Constant-Round Consensus from a Bare PKI Setup and Separation Bounds from the Idealized Message-Authentication Model. https:\/\/perso.telecom-paristech.fr\/rambaud\/articles\/lower.pdf. https:\/\/perso.telecom-paristech.fr\/rambaud\/articles\/lower.pdf"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3560829.3563562"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_1_65_1","unstructured":"Peiyao Sheng Gerui Wang Kartik Nayak Sreeram Kannan and Pramod Viswanath. 2022. Player-Replaceability and Forensic Support are Two Sides of the Same (Crypto) Coin. IACR Cryptol. ePrint Arch. (2022) 1513. https:\/\/eprint.iacr.org\/2022\/1513"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_15"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2021.38"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15982-4_15"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/135419.135437"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594596"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"event":{"name":"PODC '24: 43rd ACM Symposium on Principles of Distributed Computing","location":"Nantes France","acronym":"PODC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662792","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:41Z","timestamp":1750290221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":71,"alternative-id":["10.1145\/3662158.3662792","10.1145\/3662158"],"URL":"https:\/\/doi.org\/10.1145\/3662158.3662792","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}