{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T04:31:56Z","timestamp":1769833916390,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2240976"],"award-info":[{"award-number":["2240976"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Natural Science Foundation","award":["M23015"],"award-info":[{"award-number":["M23015"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3670327","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"3242-3256","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Asynchronous Consensus without Trusted Setup or Public-Key Cryptography"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5298-621X","authenticated-orcid":false,"given":"Sourav","family":"Das","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana Champaign, Urbana, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1385-6807","authenticated-orcid":false,"given":"Sisi","family":"Duan","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8745-5007","authenticated-orcid":false,"given":"Shengqi","family":"Liu","sequence":"additional","affiliation":[{"name":"Southern University of Science and Technology, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-2201-9640","authenticated-orcid":false,"given":"Atsuki","family":"Momose","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3437-7570","authenticated-orcid":false,"given":"Ling","family":"Ren","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-6996-5660","authenticated-orcid":false,"given":"Victor","family":"Shoup","sequence":"additional","affiliation":[{"name":"Offchain Labs, New York City, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"d.]. curve25519dalek: A pure-rust implementation of group operations on ristretto and curve25519","year":"2021","unstructured":"[n. d.]. curve25519dalek: A pure-rust implementation of group operations on ristretto and curve25519, 2021. https:\/\/github.com\/dalek-cryptography\/curve25519-dalek."},{"key":"e_1_3_2_1_2_1","volume-title":"Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time. Cryptology ePrint Archive","author":"Abraham Ittai","year":"2023","unstructured":"Ittai Abraham, Gilad Asharov, Arpita Patra, and Gilad Stern. 2023. Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time. Cryptology ePrint Archive (2023)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38557-5_2"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670326"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806707"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or Ran Canetti and Oded Goldreich. 1993. Asynchronous secure computation. In STOC. ACM 52--61.","DOI":"10.1145\/167088.167109"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198088"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-004-0314-9"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646766.704283"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/343477.343531"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2005.9"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_2_1_17_1","volume-title":"Two More Algorithms for Randomized Signature-Free Asynchronous Binary Byzantine Consensus with Round Expected Termination. arXiv preprint arXiv:2002.08765","author":"Crain Tyler","year":"2020","unstructured":"Tyler Crain. 2020. Two More Algorithms for Randomized Signature-Free Asynchronous Binary Byzantine Consensus with Round Expected Termination. arXiv preprint arXiv:2002.08765 (2020)."},{"key":"e_1_3_2_1_18_1","volume-title":"32nd USENIX Security Symposium (USENIX Security 23)","author":"Das Sourav","year":"2023","unstructured":"Sourav Das, Zhuolun Xiang, Lefteris Kokoris-Kogias, and Ling Ren. 2023. Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling. In 32nd USENIX Security Symposium (USENIX Security 23)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484808"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833584"},{"key":"e_1_3_2_1_21_1","volume-title":"SodsBC: a post-quantum by design asynchronous blockchain framework","author":"Dolev Shlomi","year":"2023","unstructured":"Shlomi Dolev, Bingyong Guo, Jianyu Niu, and Ziyu Wang. 2023. SodsBC: a post-quantum by design asynchronous blockchain framework. IEEE Transactions on Dependable and Secure Computing (2023)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/Blockchain50366.2020.00038"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243812"},{"key":"e_1_3_2_1_24_1","volume-title":"Fin: Practical signature-free asynchronous common subset in constant time. In ACM CCS.","author":"Duan Sisi","year":"2023","unstructured":"Sisi Duan, Xin Wang, and Haibin Zhang. 2023. Fin: Practical signature-free asynchronous common subset in constant time. In ACM CCS."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_26_1","volume-title":"Distributed randomness from approximate agreement. arXiv preprint arXiv:2205.11878","author":"Freitas Luciano","year":"2022","unstructured":"Luciano Freitas, Petr Kuznetsov, and Andrei Tonkikh. 2022. Distributed randomness from approximate agreement. arXiv preprint arXiv:2205.11878 (2022)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559379"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS54860.2022.00032"},{"key":"e_1_3_2_1_29_1","unstructured":"Jack Grigg and Sean Bowe. [n. d.]. zkcrypto\/pairing. https:\/\/github.com\/zkcrypto\/pairing."},{"key":"e_1_3_2_1_30_1","first-page":"339","article-title":"Non-interactive distributed key generation and key resharing","volume":"2021","author":"Groth Jens","year":"2021","unstructured":"Jens Groth. 2021. Non-interactive distributed key generation and key resharing. IACR Cryptol. ePrint Arch. 2021 (2021), 339.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_31_1","unstructured":"Bingyong Guo Yuan Lu Zhenliang Lu Qiang Tang Jing Xu and Zhenfeng Zhang. 2022. Speeding dumbo: Pushing asynchronous bft closer to practice. In NDSS."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417262"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670312"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3423364"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405707"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_2_1_38_1","volume-title":"Miguel Correia, and Paulo Verissimo.","author":"Moniz Henrique","year":"2008","unstructured":"Henrique Moniz, Nuno Ferreria Neves, Miguel Correia, and Paulo Verissimo. 2008. RITAS: Services for randomized intrusion tolerance. IEEE transactions on dependable and secure computing 8, 1 (2008), 122--136."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785953"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-016-0269-y"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73014"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_15"},{"key":"e_1_3_2_1_44_1","volume-title":"Smart","author":"Shoup Victor","year":"2024","unstructured":"Victor Shoup and Nigel P. Smart. 2024. Lightweight Asynchronous Verifiable Secret Sharing with Optimal Resilience. Journal of Cryptology (2024)."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2022.23120"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559348"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN58367.2023.00059"}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670327","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3670327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:20:01Z","timestamp":1755843601000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":47,"alternative-id":["10.1145\/3658644.3670327","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3670327","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}