{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T18:43:13Z","timestamp":1783536193163,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T00:00:00Z","timestamp":1783296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,6]]},"DOI":"10.1145\/3816782.3819206","type":"proceedings-article","created":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T17:28:33Z","timestamp":1783531713000},"page":"155-166","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Reliable Broadcast with Optimal Communication and Round Complexity"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8846-0288","authenticated-orcid":false,"given":"Thomas","family":"Locher","sequence":"first","affiliation":[{"name":"DFINITY, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-6996-5660","authenticated-orcid":false,"given":"Victor","family":"Shoup","sequence":"additional","affiliation":[{"name":"Category Labs, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467899"},{"key":"e_1_3_2_1_2_1","unstructured":"Nicolas Alhaddad Sisi Duan Mayank Varia and Haibin Zhang. 2022. Practical and Improved Byzantine Reliable Broadcast and Asynchronous Verifiable Information Dispersal from Hash Functions. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2022\/171"},{"key":"e_1_3_2_1_3_1","unstructured":"Nicolas Alhaddad Leonid Reyzin and Mayank Varia. 2024. Committing AVID with Partial Retrieval and Optimal Storage. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2024\/685"},{"key":"e_1_3_2_1_4_1","volume-title":"Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme. In Proc. 6th International Workshop on Theory and Practice in Public Key Cryptography (PKC)","volume":"2567","author":"Boldyreva Alexandra","year":"2003","unstructured":"Alexandra Boldyreva. 2003. Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme. In Proc. 6th International Workshop on Theory and Practice in Public Key Cryptography (PKC), Vol. 2567. 31\u201346."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Dan Boneh Manu Drijvers and Gregory Neven. 2018. Compact Multi-Signatures for Smaller Blockchains. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2018\/483","DOI":"10.1007\/978-3-030-03329-3_15"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45682-1_30"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. 28th International Conference on Financial Cryptography and Data Security (FC). 140\u2013159","author":"Boneh Dan","year":"2024","unstructured":"Dan Boneh, Aditi Partap, and Lior Rotem. 2024. Proactive Refresh for Accountable Threshold Signatures. In Proc. 28th International Conference on Financial Cryptography and Data Security (FC). 140\u2013159. Full version at https:\/\/eprint.iacr.org\/2022\/1656."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_42"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538430"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. 3rd USENIX Symposium on Operating Systems Design and Implementation (OSDI). 173\u2013186","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro and Barbara Liskov. 1999. Practical Byzantine Fault Tolerance. In Proc. 3rd USENIX Symposium on Operating Systems Design and Implementation (OSDI). 173\u2013186."},{"key":"e_1_3_2_1_12_1","volume-title":"Simplex Consensus: A Simple and Fast Consensus Protocol. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2023\/463","author":"Chan Benjamin Y","year":"2023","unstructured":"Benjamin Y Chan and Rafael Pass. 2023. Simplex Consensus: A Simple and Fast Consensus Protocol. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2023\/463"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2614685"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519594"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467905"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2608892"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.112012.121322"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. 28th International Conference on Principles of Distributed Systems (OPODIS) (LIPIcs","volume":"17","author":"Locher Thomas","year":"2024","unstructured":"Thomas Locher. 2024. Byzantine Reliable Broadcast with Low Communication and Time Complexity. In Proc. 28th International Conference on Principles of Distributed Systems (OPODIS) (LIPIcs, Vol. 324). 16:1\u201316:17."},{"key":"e_1_3_2_1_19_1","volume-title":"Efficient Byzantine Reliable Broadcast in the Failure Case. In 29th International Conference on Principles of Distributed Systems (OPODIS). 12:1\u201312:20","author":"Locher Thomas","year":"2026","unstructured":"Thomas Locher. 2026. Efficient Byzantine Reliable Broadcast in the Failure Case. In 29th International Conference on Principles of Distributed Systems (OPODIS). 12:1\u201312:20."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-91092-0_4"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2024.37"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-024-09505-6"}],"event":{"name":"SPAA '26: 38th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Royal Holloway, University of London London United Kingdom","acronym":"SPAA '26","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","EATCS"]},"container-title":["Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3816782.3819206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T17:28:53Z","timestamp":1783531733000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3816782.3819206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,6]]},"references-count":23,"alternative-id":["10.1145\/3816782.3819206","10.1145\/3816782"],"URL":"https:\/\/doi.org\/10.1145\/3816782.3819206","relation":{},"subject":[],"published":{"date-parts":[[2026,7,6]]},"assertion":[{"value":"2026-07-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}