{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:59:26Z","timestamp":1778065166364,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":100,"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\/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"}]},{"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\/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"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3662158.3662780","type":"proceedings-article","created":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T14:38:06Z","timestamp":1717598286000},"page":"157-169","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["All Byzantine Agreement Problems Are Expensive"],"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":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3298-7412","authenticated-orcid":false,"given":"Seth","family":"Gilbert","sequence":"additional","affiliation":[{"name":"NUS Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"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":[{"role":"author","vocabulary":"crossref"}]},{"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":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-0760-8746","authenticated-orcid":false,"given":"Anton","family":"Paramonov","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"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":[{"role":"author","vocabulary":"crossref"}]}],"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\/1095809.1095817"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11516798_17"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331629"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00446-022-00428-8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"e_1_3_2_1_6_1","volume-title":"Authenticated Consensus in Synchronous Systems with Mixed Faults. Cryptology ePrint Archive","author":"Abraham Ittai","year":"2022","unstructured":"Ittai Abraham, Danny Dolev, Alon Kagan, and Gilad Stern. 2022. Authenticated Consensus in Synchronous Systems with Mixed Faults. Cryptology ePrint Archive (2022)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467914"},{"key":"e_1_3_2_1_8_1","volume-title":"Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus. arXiv preprint arXiv:1612.02916","author":"Abraham Ittai","year":"2016","unstructured":"Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Alexander Spiegelman. 2016. Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus. arXiv preprint arXiv:1612.02916 (2016)."},{"key":"e_1_3_2_1_9_1","volume-title":"Solidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus. CoRR, abs\/1612.02916","author":"Abraham Ittai","year":"2016","unstructured":"Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Alexander Spiegelman. 2016. Solidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus. CoRR, abs\/1612.02916 (2016)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331612"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. 331--341","author":"Abraham Ittai","year":"2021","unstructured":"Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. 2021. Good-case Latency of Byzantine Broadcast: A Complete Categorization. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. 331--341."},{"key":"e_1_3_2_1_12_1","unstructured":"Ittai Abraham Kartik Nayak and Nibesh Shrestha. 2023. Communication and Round Efficient Parallel Broadcast Protocols. In IACR Cryptol. ePrint Arch. 1--22."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.OPODIS.2022.16"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060289.1060291"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2006.63"},{"key":"e_1_3_2_1_16_1","volume-title":"Welch","author":"Attiya Hagit","year":"2004","unstructured":"Hagit Attiya and Jennifer L. Welch. 2004. Distributed computing - fundamentals, simulations, and advanced topics (2. ed.). Wiley."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0083-3"},{"key":"e_1_3_2_1_18_1","unstructured":"Eli Ben-Sasson Iddo Bentov Yinon Horesh and Michael Riabzev. 2018. Scalable transparent and post-quantum secure computational integrity. IACR Cryptol. ePrint Arch. (2018) 46. http:\/\/eprint.iacr.org\/2018\/046"},{"key":"e_1_3_2_1_19_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_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22963-3_17"},{"key":"e_1_3_2_1_21_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_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_13"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2016.06.009"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467897"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.24"},{"key":"e_1_3_2_1_26_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_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_31"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2004.24"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335334"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45388-6_9"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","unstructured":"Jinyuan Chen. 2021. Optimal error-free multi-valued byzantine agreement. 17:1--17:0 pages. 10.4230\/LIPIcs.DISC.2021.17","DOI":"10.4230\/LIPIcs.DISC.2021.17"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.02.001"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594599"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2022.14"},{"key":"e_1_3_2_1_37_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_38_1","volume-title":"Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira, and Igor Zablotchi.","author":"Civit Pierre","year":"2024","unstructured":"Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira, and Igor Zablotchi. 2024. Partial Synchrony for Free? New Bounds for Byzantine Agreement via a Generic Transformation Across Network Models. arXiv preprint arXiv:2402.10059 (2024)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2023.13"},{"key":"e_1_3_2_1_40_1","volume-title":"All Byzantine Agreement Problems Are Expensive. arXiv preprint arXiv:2311.08060","author":"Civit Pierre","year":"2023","unstructured":"Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Anton Paramonov, and Manuel Vidigueira. 2023. All Byzantine Agreement Problems Are Expensive. arXiv preprint arXiv:2311.08060 (2023)."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594567"},{"key":"e_1_3_2_1_42_1","volume-title":"Strong Byzantine Agreement with Adaptive Word Complexity. arXiv preprint arXiv:2308.03524","author":"Civit Pierre","year":"2023","unstructured":"Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, and Manuel Vidigueira. 2023. Strong Byzantine Agreement with Adaptive Word Complexity. arXiv preprint arXiv:2308.03524 (2023)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90004-Y"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2020.25"},{"key":"e_1_3_2_1_45_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_46_1","volume-title":"Essentials of Blockchain Technology","author":"Correia Miguel","unstructured":"Miguel Correia. 2019. From Byzantine Consensus to Blockchain Consensus. In Essentials of Blockchain Technology. Chapman and Hall\/CRC, 41--80."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2018.8548057"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833584"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301368"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90459-3_21"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-21017-4_12"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-67087-0_12"},{"key":"e_1_3_2_1_53_1","volume-title":"Proceedings of the 2013 ACM symposium on Principles of distributed computing. 270--279","author":"Dolev Danny","year":"2013","unstructured":"Danny Dolev and Christoph Lenzen. 2013. Early-deciding consensus is expensive. In Proceedings of the 2013 ACM symposium on Principles of distributed computing. 270--279."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90033-3"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/323596.323602"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872066"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46035-7_32"},{"key":"e_1_3_2_1_62_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_63_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_64_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_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_12"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538442"},{"key":"e_1_3_2_1_67_1","volume-title":"Multidimensional Approximate Agreement with Asynchronous Fallback. Cryptology ePrint Archive","author":"Ghinea Diana","year":"2023","unstructured":"Diana Ghinea, Chen-Da Liu-Zhang, and Roger Wattenhofer. 2023. Multidimensional Approximate Agreement with Asynchronous Fallback. Cryptology ePrint Archive (2023)."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0117-1"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/112600.112626"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.08.001"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17679-1_18"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04355-0_47"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989727.1989732"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3423364"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294267"},{"key":"e_1_3_2_1_77_1","volume-title":"High Throughput Byzantine Fault Tolerance. In International Conference on Dependable Systems and Networks","author":"Kotla Ramakrishna","year":"2004","unstructured":"Ramakrishna Kotla and Michael Dahlin. 2004. High Throughput Byzantine Fault Tolerance. In International Conference on Dependable Systems and Networks, 2004. IEEE, 575--584."},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_79_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_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405707"},{"key":"e_1_3_2_1_81_1","volume-title":"SCP: A Computationally-Scalable Byzantine Consensus Protocol For Blockchains. Cryptology ePrint Archive","author":"Luu Loi","year":"2015","unstructured":"Loi Luu, Viswesh Narayanan, Kunal Baweja, Chaodong Zheng, Seth Gilbert, and Prateek Saxena. 2015. SCP: A Computationally-Scalable Byzantine Consensus Protocol For Blockchains. Cryptology ePrint Archive (2015)."},{"key":"e_1_3_2_1_82_1","volume-title":"Distributed Algorithms","author":"Lynch Nancy A","unstructured":"Nancy A Lynch. 1996. Distributed Algorithms. Elsevier."},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354225"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488657"},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484554"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2021.32"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2020.28"},{"key":"e_1_3_2_1_89_1","unstructured":"Matthieu Rambaud. 2023. Adaptively Secure Consensus with Linear Complexity and Constant Round under Honest Majority in the Bare PKI Model and Separation Bounds from the Idealized Message-Authentication Model. Cryptology ePrint Archive Paper 2023\/1757. https:\/\/eprint.iacr.org\/2023\/1757 https:\/\/eprint.iacr.org\/2023\/1757."},{"key":"e_1_3_2_1_90_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_91_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_15"},{"key":"e_1_3_2_1_92_1","unstructured":"Nibesh Shrestha Adithya Bhat Aniket Kate and Kartik Nayak. 2021. Synchronous Distributed Key Generation without Broadcasts. IACR Cryptol. ePrint Arch. (2021) 1635. https:\/\/eprint.iacr.org\/2021\/1635"},{"key":"e_1_3_2_1_93_1","unstructured":"Alexander Spiegelman. 2020. In search for an optimal authenticated byzantine agreement. arXiv preprint arXiv:2002.06993 (2020)."},{"key":"e_1_3_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15982-4_15"},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.221"},{"key":"e_1_3_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594596"},{"key":"e_1_3_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594596"},{"key":"e_1_3_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_15"},{"key":"e_1_3_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_14"},{"key":"e_1_3_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"},{"key":"e_1_3_2_1_101_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.3662780","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.3662780"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":100,"alternative-id":["10.1145\/3662158.3662780","10.1145\/3662158"],"URL":"https:\/\/doi.org\/10.1145\/3662158.3662780","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"}}]}}