{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T20:07:58Z","timestamp":1766088478575,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:00:00Z","timestamp":1749772800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-23-1-0387","FA9550-23-1-0312"],"award-info":[{"award-number":["FA9550-23-1-0387","FA9550-23-1-0312"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2338\/23","1104\/23"],"award-info":[{"award-number":["2338\/23","1104\/23"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004836","name":"Danmarks Frie Forskningsfond","doi-asserted-by":"publisher","award":["DFF-2032-00122B","DFF-2064-00016B"],"award-info":[{"award-number":["DFF-2032-00122B","DFF-2064-00016B"]}],"id":[{"id":"10.13039\/501100004836","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.3733533","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"28-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9568-7674","authenticated-orcid":false,"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[{"name":"Intel Labs, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-7486-1116","authenticated-orcid":false,"given":"Eli","family":"Chouatt","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3475-8322","authenticated-orcid":false,"given":"Yossi","family":"Gilad","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0358-2689","authenticated-orcid":false,"given":"Gilad","family":"Stern","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7958-8537","authenticated-orcid":false,"given":"Sophia","family":"Yakoubov","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"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","volume-title":"Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time. Cryptology ePrint Archive, Paper 2025\/303. https:\/\/eprint.iacr.org\/2025\/303","author":"Abraham Ittai","year":"2025","unstructured":"Ittai Abraham, Eli Chouatt, Ivan Damg\u00e5rd, Yossi Gilad, Gilad Stern, and Sophia Yakoubov. 2025. Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time. Cryptology ePrint Archive, Paper 2025\/303. https:\/\/eprint.iacr.org\/2025\/303"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467914"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331612"},{"key":"e_1_3_2_1_6_1","volume-title":"Miner","author":"Bellare Mihir","year":"1999","unstructured":"Mihir Bellare and Sara K. Miner. 1999. A forward-secure digital signature scheme. IACR Cryptol. ePrint Arch. (1999), 16. http:\/\/eprint.iacr.org\/1999\/016"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_10"},{"key":"e_1_3_2_1_8_1","volume-title":"Theory of Cryptography","author":"Blum Erica","unstructured":"Erica Blum, Jonathan Katz, Chen-Da Liu-Zhang, and Julian Loss. 2020. Asynchronous Byzantine Agreement with Subquadratic Communication. In Theory of Cryptography, Rafael Pass and Krzysztof Pietrzak (Eds.). Springer International Publishing, Cham, 353\u2013380."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38557-5_20"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_31"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/343477.343531"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22969-5_6"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-48618-0_2"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61204-1_27"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/296806.296824"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.02.001"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_4"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3662158.3662780"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2023.39"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405708"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2020.25"},{"key":"e_1_3_2_1_22_1","volume-title":"Julian Loss, and Jesper Buus Nielsen.","author":"Damg\u00e5rd Ivan Bjerre","year":"2025","unstructured":"Ivan Bjerre Damg\u00e5rd, Simon Holmgaard Kamp, Julian Loss, and Jesper Buus Nielsen. 2025. Asynchronous YOSO a la Paillier. Cryptology ePrint Archive, Paper 2025\/128. https:\/\/eprint.iacr.org\/2025\/128"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_1_24_1","unstructured":"Luciano Freitas Petr Kuznetsov and Andrei Tonkikh. 2022. Distributed Randomness from Approximate Agreement. arXiv:2205.11878 [cs.DC] https:\/\/arxiv.org\/abs\/2205.11878"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_3"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90456-2_2"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22969-5_15"},{"key":"e_1_3_2_1_29_1","unstructured":"Simon Holmgaard Kamp and Jesper Buus Nielsen. 2023. Byzantine Agreement Decomposed: Honest Majority Asynchronous Atomic Broadcast from Reliable Broadcast. Cryptology ePrint Archive Paper 2023\/1738. https:\/\/eprint.iacr.org\/2023\/1738"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.62056\/ae5w4fe-3"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"e_1_3_2_1_32_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"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48405-1_10"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68339-9_17"}],"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.3733533","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733533","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:26:47Z","timestamp":1749824807000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733533"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":34,"alternative-id":["10.1145\/3732772.3733533","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733533","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"}}]}}