{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:29:34Z","timestamp":1783610974989,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":98,"publisher":"ACM","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":["#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"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733520","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"15-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Repeated Agreement is Cheap! On Weak Accountability and Multishot Byzantine Agreement"],"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":"National University of 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":"National University of 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":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Ittai Abraham Gilad Asharov Arpita Patra and Gilad Stern. 2023. Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time. IACR Cryptol. ePrint Arch. (2023) 1130. https:\/\/eprint.iacr.org\/2023\/1130"},{"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.1007\/S00446-022-00428-8"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746581"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00044"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467899"},{"key":"e_1_3_2_1_7_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_8_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. 2021. Succinct Erasure Coding Proof Systems. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_9_1","volume-title":"22nd USENIX Symposium on Networked Systems Design and Implementation, NSDI 2025","author":"Arun Balaji","year":"2025","unstructured":"Balaji Arun, Zekun Li, Florian Suri-Payer, Sourav Das, and Alexander Spiegelman. 2025. Shoal++: High Throughput DAG BFT Can Be Fast and Robust!. In 22nd USENIX Symposium on Networked Systems Design and Implementation, NSDI 2025, Philadelphia, PA, USA, April 28\u201330, 2025, Theophilus A. Benson and Radhika Niranjan Mysore (Eds.). USENIX Association, 813\u2013826. https:\/\/www.usenix.org\/conference\/nsdi25\/presentation\/arun"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58740-5_11"},{"key":"e_1_3_2_1_11_1","unstructured":"Akhil Bandarupalli Xiaoyu Ji Aniket Kate Chen-Da Liu-Zhang and Yifan Song. 2024. Concretely Efficient Asynchronous MPC from Lightweight Cryptography. IACR Cryptol. ePrint Arch. (2024) 1666. https:\/\/eprint.iacr.org\/2024\/1666"},{"key":"e_1_3_2_1_12_1","volume-title":"Optimal amortized distributed consensus","author":"Bar-Noy Amotz","unstructured":"Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, and Tiko Kameda. 1992. Optimal amortized distributed consensus. In Distributed Algorithms, Sam Toueg, Paul G. Spirakis, and Lefteris Kirousis (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 95\u2013107."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41844"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_16"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167109"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_39"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63511"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22963-3_17"},{"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","volume-title":"Theory and practice of error control codes","author":"Blahut Richard E","unstructured":"Richard E Blahut. 1983. Theory and practice of error control codes. Vol. 126. Addison-Wesley Reading."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467897"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00145-023-09484-0"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_21"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484243"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538430"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2021.17"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2019.02.001"},{"key":"e_1_3_2_1_30_1","volume-title":"JUMBO: Fully Asynchronous BFT Consensus Made Truly Scalable. arXiv preprint arXiv:2403.11238","author":"Cheng Hao","year":"2024","unstructured":"Hao Cheng, Yuan Lu, Zhenliang Lu, Qiang Tang, Yuxuan Zhang, and Zhenfeng Zhang. 2024. JUMBO: Fully Asynchronous BFT Consensus Made Truly Scalable. arXiv preprint arXiv:2403.11238 (2024)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03807-6_14"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-023-09451-9"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3662158.3662792"},{"key":"e_1_3_2_1_34_1","volume-title":"Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, and Manuel Vidigueira.","author":"Civit Pierre","year":"2025","unstructured":"Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, and Manuel Vidigueira. 2025. Repeated Agreement is Cheap! On Weak Accountability and Multishot Byzantine Agreement. Cryptology ePrint Archive, Paper 2025\/826. (2025). https:\/\/eprint.iacr.org\/2025\/826"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2024.14"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2023.13"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3662158.3662780"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-48624-1_16"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.OPODIS.2022.18"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519594"},{"key":"e_1_3_2_1_42_1","volume-title":"Asynchronous Consensus without Trusted Setup or Public-Key Cryptography. Cryptology ePrint Archive","author":"Das Sourav","year":"2024","unstructured":"Sourav Das, Sisi Duan, Shengqi Liu, Atsuki Momose, Ling Ren, and Victor Shoup. 2024. Asynchronous Consensus without Trusted Setup or Public-Key Cryptography. Cryptology ePrint Archive (2024)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833580"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484808"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN58291.2024.00052"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"D. Dolev and H. R. Strong. 1983. Authenticated Algorithms for Byzantine Agreement. 12 4 (1983) 656\u2013666.","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_48_1","unstructured":"Sisi Duan Haibin Zhang and Boxin Zhao. 2022. WaterBear: Information-Theoretic Asynchronous BFT Made Practical. IACR Cryptol. ePrint Arch. (2022) 21. https:\/\/eprint.iacr.org\/2022\/021"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.43"},{"key":"e_1_3_2_1_50_1","volume-title":"Making Hash-based MVBA Great Again. Cryptology ePrint Archive","author":"Feng Hanwen","year":"2024","unstructured":"Hanwen Feng, Zhenliang Lu, Tiancheng Mai, and Qiang Tang. 2024. Making Hash-based MVBA Great Again. Cryptology ePrint Archive (2024)."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2024.46"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/323596.323602"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318041.3355467"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-020-00384-1"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167101"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649736"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3694715.3695942"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_4"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10877-8_10"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281122"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_6"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44448-3_12"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_28"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45608-8_24"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520015"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.CH165"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467905"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04355-0_47"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835798"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989727.1989732"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294267"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866366"},{"key":"e_1_3_2_1_74_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_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993809"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.02.031"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571859"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405707"},{"key":"e_1_3_2_1_79_1","unstructured":"Atsuki Momose. 2024. Practical Asynchronous MPC from Lightweight Cryptography. IACR Cryptol. ePrint Arch. (2024) 1717. https:\/\/eprint.iacr.org\/2024\/1717"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21941"},{"key":"e_1_3_2_1_81_1","unstructured":"Kartik Nayak and Ittai Abraham. 2019. The Dolev and Reischuk Lower Bound: Does Agreement need Quadratic Messages? https:\/\/decentralizedthoughts.github.io\/2019-08-16-byzantine-agreement-needs-quadratic-messages\/"},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2020.28"},{"key":"e_1_3_2_1_83_1","unstructured":"Birgit Pfitzmann and Michael Waidner. 1996. Information-theoretic pseudosignatures and byzantine agreement for t \u2265 n\/3. Citeseer."},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36413-7_25"},{"key":"e_1_3_2_1_85_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. IACR Cryptol. ePrint Arch. (2023) 1757. https:\/\/eprint.iacr.org\/2023\/1757"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1145\/3560829.3563562"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_15"},{"key":"e_1_3_2_1_89_1","volume-title":"A Theoretical Take on a Practical Consensus Protocol. Cryptology ePrint Archive","author":"Shoup Victor","year":"2024","unstructured":"Victor Shoup. 2024. A Theoretical Take on a Practical Consensus Protocol. Cryptology ePrint Archive (2024)."},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00145-024-09505-6"},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP61157.2025.00021"},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2021.38"},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/323596.323603"},{"key":"e_1_3_2_1_94_1","volume-title":"Paper 2023\/1549. Cryptology ePrint Archive","author":"Sui Xiao","year":"2023","unstructured":"Xiao Sui and Sisi Duan. 2023. Signature-Free Atomic Broadcast with Optimal O(n2) Messages and O(1) Expected Time. Cryptology ePrint Archive, Paper 2023\/1549. Cryptology ePrint Archive (2023). https:\/\/eprint.iacr.org\/2023\/1549."},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594596"},{"key":"e_1_3_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_14"},{"key":"e_1_3_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"},{"key":"e_1_3_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2022.23120"}],"event":{"name":"PODC '25: ACM Symposium on Principles of Distributed Computing","location":"Hotel Las Brisas Huatulco Huatulco Mexico","acronym":"PODC '25","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733520","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:24:21Z","timestamp":1749824661000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733520"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":98,"alternative-id":["10.1145\/3732772.3733520","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733520","relation":{},"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}