{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:03:00Z","timestamp":1783008180836,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB2701700 and 2022YFB2701500"],"award-info":[{"award-number":["2022YFB2701700 and 2022YFB2701500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","award":["M23015"],"award-info":[{"award-number":["M23015"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["92267203 and 62272043"],"award-info":[{"award-number":["92267203 and 62272043"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Major Program of Shandong Provincial Natural Science Foundation for the Fundamental Research","award":["ZR2022ZD03"],"award-info":[{"award-number":["ZR2022ZD03"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3616633","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"815-829","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":52,"title":["FIN: Practical Signature-Free Asynchronous Common Subset in Constant Time"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1385-6807","authenticated-orcid":false,"given":"Sisi","family":"Duan","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1665-8398","authenticated-orcid":false,"given":"Xin","family":"Wang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5865-3408","authenticated-orcid":false,"given":"Haibin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Ittai Abraham Dahlia Malkhi and Alexander Spiegelman. 2019. Asymptotically Optimal Validated Asynchronous Byzantine Agreement. In PODC. ACM 337--346.","DOI":"10.1145\/3293611.3331612"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Andreea B. Alexandru Erica Blum Jonathan Katz and Julian Loss. 2022. State Machine Replication under Changing Network Conditions. In Asiacrypt.","DOI":"10.1007\/978-3-031-22963-3_23"},{"key":"e_1_3_2_1_3_1","volume-title":"Zhuolun Xiang Mayank Varia, and Haibin Zhang","author":"Alhaddad Nicolas","year":"2022","unstructured":"Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Zhuolun Xiang Mayank Varia, and Haibin Zhang. 2022. Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation. PODC."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Renas Bacho and Julian Loss. 2022. On the Adaptive Security of the Threshold BLS Signature Scheme. In ACM CCS.","DOI":"10.1145\/3548606.3560656"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Michael Backes Fabian Bendun Ashish Choudhury and Aniket Kate. 2014. Asynchronous MPC with a strict honest majority using non-equivocation. In PODC. 10--19.","DOI":"10.1145\/2611462.2611490"},{"key":"e_1_3_2_1_6_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_7_1","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or and Ran El-Yaniv. 2003. Resilient-Optimal Interactive Consistency in Constant Time. Distrib. Comput. (2003).","DOI":"10.1007\/s00446-002-0083-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or Boaz Kelmer and Tal Rabin. 1994. Asynchronous secure compu-tations with optimal resilience. In PODC. ACM 183--192.","DOI":"10.1145\/197917.198088"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Erica Blum Chen-Da Liu-Zhang and Julian Loss. 2020. Always have a backup plan: fully secure synchronous MPC with asynchronous fallback. In CRYPTO. 707--731.","DOI":"10.1007\/978-3-030-56880-1_25"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_1_11_1","volume-title":"Secure and efficient asynchronous broadcast protocols","author":"Cachin Christian","unstructured":"Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. 2001. Secure and efficient asynchronous broadcast protocols. In CRYPTO. Springer, 524--541."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0318-0"},{"key":"e_1_3_2_1_13_1","volume-title":"Asynchronous verifiable information dispersal","author":"Cachin Christian","unstructured":"Christian Cachin and Stefano Tessaro. 2005. Asynchronous verifiable information dispersal. In SRDS. IEEE, 191--201."},{"key":"e_1_3_2_1_14_1","volume-title":"Studies in secure multiparty computation and applications","author":"Canetti Ran","year":"1996","unstructured":"Ran Canetti. 1996. Studies in secure multiparty computation and applications. Scientific Council of The Weizmann Institute of Science (1996)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1043"},{"key":"e_1_3_2_1_18_1","volume-title":"On communication-efficient asynchronous MPC with adaptive security","author":"Chopard Annick","unstructured":"Annick Chopard, Martin Hirt, and Chen-Da Liu-Zhang. 2021. On communication-efficient asynchronous MPC with adaptive security. In TCC. Springer, 35--65."},{"key":"e_1_3_2_1_19_1","volume-title":"Indocrypt","author":"Choudhury Ashish","unstructured":"Ashish Choudhury and Nikhil Pappu. 2020. Perfectly-Secure Asynchronous MPC for General Adversaries. In Indocrypt. Springer, 786--809."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Ashish Choudhury and Arpita Patra. 2015. Optimally resilient asynchronous MPC with linear communication complexity. In ICDCN. 1--10.","DOI":"10.1145\/2684464.2684470"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2614685"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxh145"},{"key":"e_1_3_2_1_23_1","volume-title":"Two More Algorithms for Randomized Signature-Free Asynchronous Binary Byzantine Consensus with tn\/3 and O(n 2 ) Messages and O(1) Round Expected Termination. CoRR abs\/2002.08765","author":"Crain Tyler","year":"2020","unstructured":"Tyler Crain. 2020. Two More Algorithms for Randomized Signature-Free Asynchronous Binary Byzantine Consensus with tn\/3 and O(n 2 ) Messages and O(1) Round Expected Termination. CoRR abs\/2002.08765 (2020). arXiv:2002.08765"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"George Danezis Lefteris Kokoris-Kogias Alberto Sonnino and Alexander Spiegel-man. 2022. Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus. In Eurosys. 34--50.","DOI":"10.1145\/3492321.3519594"},{"key":"e_1_3_2_1_25_1","volume-title":"Practical Asynchronous High-threshold Distributed Key Generation and Distributed Polynomial Sampling. USENIX Security","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. USENIX Security (2023)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Sourav Das Zhuolun Xiang and Ling Ren. 2021. Asynchronous data dissemination and its applications. In CCS. 2705--2721.","DOI":"10.1145\/3460120.3484808"},{"key":"e_1_3_2_1_27_1","volume-title":"Practical Asynchronous Distributed Key Generation. In IEEE Symposium on Security and Privacy. IEEE, 2518--2534","author":"Das Sourav","year":"2022","unstructured":"Sourav Das, Thomas Yurek, Zhuolun Xiang, Andrew K. Miller, Lefteris Kokoris-Kogias, and Ling Ren. 2022. Practical Asynchronous Distributed Key Generation. In IEEE Symposium on Security and Privacy. IEEE, 2518--2534."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Assia Doudou and Andr\u00e9 Schiper. 1998. Muteness detectors for consensus with Byzantine processes. In PODC. 315.","DOI":"10.1145\/277697.277772"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243812"},{"key":"e_1_3_2_1_30_1","volume-title":"Paper 2022\/625.","author":"Duan Sisi","year":"2022","unstructured":"Sisi Duan, Haibin Zhang, Xiao Sui, Baohan Huang, Changchun Mu, Gang Di, and Xiaoyun Wang. 2022. Dashing and Star: Byzantine Fault Tolerance Using Weak Certificates. Cryptology ePrint Archive, Paper 2022\/625. (2022)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559379"},{"key":"e_1_3_2_1_32_1","volume-title":"Bullshark: DAG BFT Protocols Made Practical. In CCS.","author":"Giridharan Neil","year":"2022","unstructured":"Neil Giridharan, Lefteris Kokoris-Kogias, Alberto Sonnino, and Alexander Spiegel-man. 2022. Bullshark: DAG BFT Protocols Made Practical. In CCS."},{"key":"e_1_3_2_1_33_1","volume-title":"Speeding Dumbo: Pushing Asynchronous BFT Closer to Practice. NDSS.","author":"Guo Bingyong","year":"2022","unstructured":"Bingyong Guo, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. 2022. Speeding Dumbo: Pushing Asynchronous BFT Closer to Practice. NDSS."},{"key":"e_1_3_2_1_34_1","volume-title":"Dumbo: Faster Asynchronous BFT Protocols. In CCS.","author":"Guo Bingyong","year":"2020","unstructured":"Bingyong Guo, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. 2020. Dumbo: Faster Asynchronous BFT Protocols. In CCS."},{"key":"e_1_3_2_1_35_1","volume-title":"Paper 2022\/1586.","author":"G\u00fcnther Christoph U.","year":"2022","unstructured":"Christoph U. G\u00fcnther, Sourav Das, and Lefteris Kokoris-Kogias. 2022. Practical Asynchronous Proactive Secret Sharing and Key Refresh. Cryptology ePrint Archive, Paper 2022\/1586. (2022)."},{"key":"e_1_3_2_1_36_1","volume-title":"Paper 2022\/1169.","author":"Hu Bin","year":"2022","unstructured":"Bin Hu, Zongyang Zhang, Han Chen, You Zhou, Huazu Jiang, and Jianwei Liu. 2022. DyCAPS: Asynchronous Proactive Secret Sharing for Dynamic Committees. Cryptology ePrint Archive, Paper 2022\/1169. (2022)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Idit Keidar Eleftherios Kokoris-Kogias Oded Naor and Alexander Spiegelman. 2021. All You Need is DAG. In PODC. ACM 165--175.","DOI":"10.1145\/3465084.3467905"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Eleftherios Kokoris Kogias Dahlia Malkhi and Alexander Spiegelman. 2020. Asynchronous Distributed Key Generation for Computationally-Secure Randomness Consensus and Threshold Signatures. In ACM CCS. 1751--1767.","DOI":"10.1145\/3372297.3423364"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.02.031"},{"key":"e_1_3_2_1_40_1","volume-title":"EPIC: Efficient Asynchronous BFT with Adaptive Security. In DSN.","author":"Liu Chao","year":"2020","unstructured":"Chao Liu, Sisi Duan, and Haibin Zhang. 2020. EPIC: Efficient Asynchronous BFT with Adaptive Security. In DSN."},{"key":"e_1_3_2_1_41_1","unstructured":"Donghang Lu Thomas Yurek Samarth Kulshreshtha Rahul Govind Aniket Kate and Andrew Miller. 2019. HoneyBadgerMPC and AsynchroMix: Practical Asynchronous MPC and Its Application to Anonymous Communication. In CCS."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Y. Lu Z. Lu Q. Tang and G. Wang. 2020. Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement Revisited. In PODC.","DOI":"10.1145\/3382734.3405707"},{"key":"e_1_3_2_1_43_1","volume-title":"Cobalt: BFT governance in open networks. arXiv preprint arXiv:1802.07240","author":"MacBrough Ethan","year":"2018","unstructured":"Ethan MacBrough. 2018. Cobalt: BFT governance in open networks. arXiv preprint arXiv:1802.07240 (2018)."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Andrew Miller Yu Xia Kyle Croman Elaine Shi and Dawn Song. 2016. The honey badger of BFT protocols. In ACM CCS. 31--42.","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_2_1_45_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_46_1","doi-asserted-by":"crossref","unstructured":"Achour Mostefaoui Hamouma Moumen and Michel Raynal. 2014. Signature-free asynchronous byzantine consensus with t n\/3 and O(n 2) messages. In PODC. ACM 2--9.","DOI":"10.1145\/2611462.2611468"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785953"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-016-0269-y"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.153"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"e_1_3_2_1_52_1","volume-title":"Mohammad Alizadeh, Sreeram Kannan, and David Tse.","author":"Yang Lei","year":"2022","unstructured":"Lei Yang, Seo Jin Park, Mohammad Alizadeh, Sreeram Kannan, and David Tse. 2022. DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks. In NSDI. 493--512."},{"key":"e_1_3_2_1_53_1","volume-title":"PACE: Fully Parallelizable BFT from Repro-posable Byzantine Agreement. In CCS.","author":"Zhang Haibin","year":"2022","unstructured":"Haibin Zhang and Sisi Duan. 2022. PACE: Fully Parallelizable BFT from Repro-posable Byzantine Agreement. In CCS."},{"key":"e_1_3_2_1_54_1","volume-title":"Weaker Assumption, and Standard Model","author":"Zhang Haibin","year":"2023","unstructured":"Haibin Zhang, Sisi Duan, Chao Liu, Boxin Zhao, Xuanji Meng, Shengli Liu, Yong Yu, Fangguo Zhang, and Liehuang Zhu. 2023. Practical Asynchronous Distributed Key Generation: Improved Efficiency, Weaker Assumption, and Standard Model. IEEE DSN. (2023)."},{"key":"e_1_3_2_1_55_1","unstructured":"Haibin Zhang Sisi Duan Boxin Zhao and Liehuang Zhu. 2023. WaterBear: Practical Asynchronous BFT Matching Security Guarantees of Partially Synchronous BFT. In USENIX Security. 5341--5357."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2022.07.004"}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","location":"Copenhagen Denmark","acronym":"CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3616633","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3616633","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:52:23Z","timestamp":1755741143000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3616633"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":56,"alternative-id":["10.1145\/3576915.3616633","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3616633","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}