{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T20:07:33Z","timestamp":1778789253292,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2018YFA0704701"],"award-info":[{"award-number":["2018YFA0704701"]}]},{"name":"Shandong Key Research and Development Program","award":["2020ZLYS09"],"award-info":[{"award-number":["2020ZLYS09"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3559348","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"3151-3164","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":58,"title":["PACE"],"prefix":"10.1145","author":[{"given":"Haibin","family":"Zhang","sequence":"first","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sisi","family":"Duan","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2019. Bug in ABA protocol's use of Common Coin. https:\/\/github.com\/amiller\/ HoneyBadgerBFT\/issues\/59. (2019).  2019. Bug in ABA protocol's use of Common Coin. https:\/\/github.com\/amiller\/ HoneyBadgerBFT\/issues\/59. (2019)."},{"key":"e_1_3_2_2_2_1","unstructured":"2022. BEAT implementation. https:\/\/github.com\/fififish\/beat. (2022).  2022. BEAT implementation. https:\/\/github.com\/fififish\/beat. (2022)."},{"key":"e_1_3_2_2_3_1","unstructured":"2022. Dumbo implementation. https:\/\/github.com\/yylluu\/dumbo. (2022).  2022. Dumbo implementation. https:\/\/github.com\/yylluu\/dumbo. (2022)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331612"},{"key":"e_1_3_2_2_5_1","volume-title":"Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation. In PODC '22","author":"Alhaddad Nicolas","year":"2022","unstructured":"Nicolas Alhaddad , Sourav Das , Sisi Duan , Ling Ren , Mayank Varia , Zhuolun Xiang , and Haibin Zhang . 2022 . Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation. In PODC '22 . ACM. Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, and Haibin Zhang. 2022. Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation. In PODC '22. ACM."},{"key":"e_1_3_2_2_6_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 ). Nicolas Alhaddad, Sisi Duan, Mayank Varia, and Haibin Zhang. 2021. Succinct Erasure Coding Proof Systems. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_2_7_1","volume-title":"Haibin Zhang. High-Threshold AVSS with Optimal Communication Complexity. In FC","author":"Alhaddad Nicolas","year":"2021","unstructured":"Nicolas Alhaddad , Mayank Varia , and Haibin Zhang. High-Threshold AVSS with Optimal Communication Complexity. In FC 2021 . Nicolas Alhaddad, Mayank Varia, and Haibin Zhang. High-Threshold AVSS with Optimal Communication Complexity. In FC 2021."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2010.70"},{"key":"e_1_3_2_2_9_1","volume-title":"RBFT: Redundant Byzantine Fault Tolerance. In ICDCS. 297--306.","author":"Aublin P.","year":"2013","unstructured":"P. Aublin , S. B. Mokhtar , and V. Qu\u00e9ma . 2013 . RBFT: Redundant Byzantine Fault Tolerance. In ICDCS. 297--306. P. Aublin, S. B. Mokhtar, and V. Qu\u00e9ma. 2013. RBFT: Redundant Byzantine Fault Tolerance. In ICDCS. 297--306."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"M. Joye B. Libert and M. Yung. 2016. Born and raised distributively: Fully dis- tributed non-interactive adaptively-secure threshold signatures with short shares. In Theoretical Computer Science.  M. Joye B. Libert and M. Yung. 2016. Born and raised distributively: Fully dis- tributed non-interactive adaptively-secure threshold signatures with short shares. In Theoretical Computer Science.","DOI":"10.1016\/j.tcs.2016.02.031"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or. 1985. Fast Asynchronous Byzantine Agreement (Extended Abstract). In PODC.  Michael Ben-Or. 1985. Fast Asynchronous Byzantine Agreement (Extended Abstract). In PODC.","DOI":"10.1145\/323596.323609"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or and Ran El-Yaniv. 2003. Resilient-Optimal Interactive Consistency in Constant Time. Distrib. Comput. (2003).  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_2_13_1","volume-title":"Proceedings of the 13th annual symposium on Principles of distributed computing. ACM, 183--192","author":"Ben-Or Michael","year":"1994","unstructured":"Michael Ben-Or , Boaz Kelmer , and Tal Rabin . 1994 . Asynchronous secure computations with optimal resilience . In Proceedings of the 13th annual symposium on Principles of distributed computing. ACM, 183--192 . Michael Ben-Or, Boaz Kelmer, and Tal Rabin. 1994. Asynchronous secure computations with optimal resilience. In Proceedings of the 13th annual symposium on Principles of distributed computing. ACM, 183--192."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/800222.806743"},{"key":"e_1_3_2_2_15_1","volume-title":"Byzan- tine Fault Tolerant Vector Consensus with Anonymous Proposals. arXiv preprint arXiv:1902.10010","author":"Cachin Christian","year":"2019","unstructured":"Christian Cachin , Daniel Collins , Tyler Crain , and Vincent Gramoli . 2019. Byzan- tine Fault Tolerant Vector Consensus with Anonymous Proposals. arXiv preprint arXiv:1902.10010 ( 2019 ). Christian Cachin, Daniel Collins, Tyler Crain, and Vincent Gramoli. 2019. Byzan- tine Fault Tolerant Vector Consensus with Anonymous Proposals. arXiv preprint arXiv:1902.10010 (2019)."},{"key":"e_1_3_2_2_16_1","volume-title":"Introduction to Reliable and Secure Distributed Programming","author":"Cachin Christian","unstructured":"Christian Cachin , Rachid Guerraoui , and Luis Rodrigues . 2011. Introduction to Reliable and Secure Distributed Programming ( 2 nd ed.). Christian Cachin, Rachid Guerraoui, and Luis Rodrigues. 2011. Introduction to Reliable and Secure Distributed Programming (2nd ed.).","edition":"2"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/646766.704283"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0318-0"},{"key":"e_1_3_2_2_19_1","volume-title":"Proceedings International Conference on Dependable Systems and Networks. 167--176","author":"Cachin Christian","unstructured":"Christian Cachin and Jonathan A. Poritz . 2002. Secure INtrusion-Tolerant Repli- cation on the Internet . In Proceedings International Conference on Dependable Systems and Networks. 167--176 . Christian Cachin and Jonathan A. Poritz. 2002. Secure INtrusion-Tolerant Repli- cation on the Internet. In Proceedings International Conference on Dependable Systems and Networks. 167--176."},{"key":"e_1_3_2_2_20_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. Christian Cachin and Stefano Tessaro. 2005. Asynchronous verifiable information dispersal. In SRDS. IEEE, 191--201."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226647"},{"key":"e_1_3_2_2_22_1","volume-title":"NSDI","volume":"9","author":"Clement Allen","year":"2009","unstructured":"Allen Clement , Edmund L Wong , Lorenzo Alvisi , Michael Dahlin , and Mirco Marchetti . 2009 . Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults .. In NSDI , Vol. 9 . 153--168. Allen Clement, Edmund L Wong, Lorenzo Alvisi, Michael Dahlin, and Mirco Marchetti. 2009. Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults.. In NSDI, Vol. 9. 153--168."},{"key":"e_1_3_2_2_23_1","volume-title":"Nuno Ferreira Neves, and Paulo Verissimo","author":"Correia Miguel","year":"2004","unstructured":"Miguel Correia , Nuno Ferreira Neves, and Paulo Verissimo . 2004 . How to tolerate half less one Byzantine nodes in practical distributed systems. In SRDS. IEEE , 174--183. Miguel Correia, Nuno Ferreira Neves, and Paulo Verissimo. 2004. How to tolerate half less one Byzantine nodes in practical distributed systems. In SRDS. IEEE, 174--183."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxh145"},{"key":"e_1_3_2_2_25_1","volume-title":"A Simple and Efficient Asynchronous Randomized Binary Byzantine Consensus Algorithm. CoRR abs\/2002.04393","author":"Crain Tyler","year":"2020","unstructured":"Tyler Crain . 2020. A Simple and Efficient Asynchronous Randomized Binary Byzantine Consensus Algorithm. CoRR abs\/2002.04393 ( 2020 ). arXiv:2002.04393 https:\/\/arxiv.org\/abs\/2002.04393 Tyler Crain. 2020. A Simple and Efficient Asynchronous Randomized Binary Byzantine Consensus Algorithm. CoRR abs\/2002.04393 (2020). arXiv:2002.04393 https:\/\/arxiv.org\/abs\/2002.04393"},{"key":"e_1_3_2_2_26_1","volume-title":"Two More Algorithms for Randomized Signature-Free Asyn- chronous Binary Byzantine Consensus with t<n\/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 Asyn- chronous Binary Byzantine Consensus with t<n\/3 and O(n 2) Messages and O(1) Round Expected Termination. CoRR abs\/2002.08765 ( 2020 ). arXiv:2002.08765 https:\/\/arxiv.org\/abs\/2002.08765 Tyler Crain. 2020. Two More Algorithms for Randomized Signature-Free Asyn- chronous Binary Byzantine Consensus with t<n\/3 and O(n 2) Messages and O(1) Round Expected Termination. CoRR abs\/2002.08765 (2020). arXiv:2002.08765 https:\/\/arxiv.org\/abs\/2002.08765"},{"key":"e_1_3_2_2_27_1","unstructured":"George Danezis Eleftherios Kokoris Kogias Alberto Sonnino and Alexander Spiegelman. Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus (arxiv.org\/abs\/2105.11827).  George Danezis Eleftherios Kokoris Kogias Alberto Sonnino and Alexander Spiegelman. Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus (arxiv.org\/abs\/2105.11827)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484808"},{"key":"e_1_3_2_2_29_1","volume-title":"Practical asynchronous distributed key generation. Cryptology ePrint Archive","author":"Das Sourav","year":"2021","unstructured":"Sourav Das , Tom Yurek , Zhuolun Xiang , Andrew Miller , Lefteris Kokoris-Kogias , and Ling Ren . 2021. Practical asynchronous distributed key generation. Cryptology ePrint Archive ( 2021 ). Sourav Das, Tom Yurek, Zhuolun Xiang, Andrew Miller, Lefteris Kokoris-Kogias, and Ling Ren. 2021. Practical asynchronous distributed key generation. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243812"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417262"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Idit Keidar Eleftherios Kokoris-Kogias Oded Naor and Alexander Spiegelman. 2021. All You Need is DAG.. In PODC.  Idit Keidar Eleftherios Kokoris-Kogias Oded Naor and Alexander Spiegelman. 2021. All You Need is DAG.. In PODC.","DOI":"10.1145\/3465084.3467905"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3423364"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Klaus Kursawe and Victor Shoup. 2005. Optimistic Asynchronous Atomic Broadcast. In ICALP. 204--215.  Klaus Kursawe and Victor Shoup. 2005. Optimistic Asynchronous Atomic Broadcast. In ICALP. 204--215.","DOI":"10.1007\/11523468_17"},{"key":"e_1_3_2_2_36_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. Chao Liu, Sisi Duan, and Haibin Zhang. 2020. EPIC: Efficient Asynchronous BFT with Adaptive Security. In DSN."},{"key":"e_1_3_2_2_37_1","unstructured":"Chao Liu Sisi Duan and Haibin Zhang. 2021. MiB: Asynchronous BFT with More Replicas. (2021). arXiv:2108.04488  Chao Liu Sisi Duan and Haibin Zhang. 2021. MiB: Asynchronous BFT with More Replicas. (2021). arXiv:2108.04488"},{"key":"e_1_3_2_2_38_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). Ethan MacBrough. 2018. Cobalt: BFT governance in open networks. arXiv preprint arXiv:1802.07240 (2018)."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_2_2_40_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. 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_2_41_1","unstructured":"Achour Mostefaoui Hamouma Moumen and Michel Raynal. 2014. Signature-free asynchronous byzantine consensus with t < n\/3 and o (n2) messages. In PODC. ACM 2--9.  Achour Mostefaoui Hamouma Moumen and Michel Raynal. 2014. Signature-free asynchronous byzantine consensus with t < n\/3 and o (n2) messages. In PODC. ACM 2--9."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785953"},{"key":"e_1_3_2_2_43_1","volume-title":"Randomized byzantine generals","author":"Rabin Michael O","unstructured":"Michael O Rabin . 1983. Randomized byzantine generals . In SFCS. IEEE , 403--409. Michael O Rabin. 1983. Randomized byzantine generals. In SFCS. IEEE, 403--409."},{"key":"e_1_3_2_2_44_1","volume-title":"Ramasamy and Christian Cachin","author":"HariGovind","year":"2005","unstructured":"HariGovind V. Ramasamy and Christian Cachin . 2005 . Parsimonious Asynchronous Byzantine-fault-tolerant Atomic Broadcast. In OPODIS. 88--102. HariGovind V. Ramasamy and Christian Cachin. 2005. Parsimonious Asynchronous Byzantine-fault-tolerant Atomic Broadcast. In OPODIS. 88--102."},{"key":"e_1_3_2_2_45_1","volume-title":"Mir-bft: High-throughput robust bft for decentralized networks. arXiv preprint arXiv:1906.05552","author":"Stathakopoulou Chrysoula","year":"2019","unstructured":"Chrysoula Stathakopoulou , Tudor David , Matej Pavlovic , and Marko Vukoli\u0107 . 2019 . Mir-bft: High-throughput robust bft for decentralized networks. arXiv preprint arXiv:1906.05552 (2019). Chrysoula Stathakopoulou, Tudor David, Matej Pavlovic, and Marko Vukoli\u0107. 2019. Mir-bft: High-throughput robust bft for decentralized networks. arXiv preprint arXiv:1906.05552 (2019)."},{"key":"e_1_3_2_2_46_1","unstructured":"Pierre Tholoniat and Vincent Gramoli. 2019. Formal verification of blockchain Byzantine fault tolerance. In FRIDA.  Pierre Tholoniat and Vincent Gramoli. 2019. Formal verification of blockchain Byzantine fault tolerance. In FRIDA."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"crossref","unstructured":"Xin Wang Sisi Duan James Clavin and Haibin Zhang. 2021. BFT in Blockchains: From Protocols to Use Cases. ACM Comput. Surv. (2021).  Xin Wang Sisi Duan James Clavin and Haibin Zhang. 2021. BFT in Blockchains: From Protocols to Use Cases. ACM Comput. Surv. (2021).","DOI":"10.1145\/3503042"},{"key":"e_1_3_2_2_48_1","volume-title":"PACE: Fully Parallelizable BFT from Reproposable Byzantine Agreement. Cryptology ePrint Archive, Paper 2022\/020.","author":"Zhang Haibin","year":"2022","unstructured":"Haibin Zhang and Sisi Duan . 2022 . PACE: Fully Parallelizable BFT from Reproposable Byzantine Agreement. Cryptology ePrint Archive, Paper 2022\/020. (2022). https:\/\/eprint.iacr.org\/2022\/020 https:\/\/eprint.iacr.org\/2022\/020. Haibin Zhang and Sisi Duan. 2022. PACE: Fully Parallelizable BFT from Reproposable Byzantine Agreement. Cryptology ePrint Archive, Paper 2022\/020. (2022). https:\/\/eprint.iacr.org\/2022\/020 https:\/\/eprint.iacr.org\/2022\/020."},{"key":"e_1_3_2_2_49_1","unstructured":"Haibin Zhang Sisi Duan Boxin Zhao and Liehuang Zhu. 2022. WaterBear: Asynchronous BFT with Information-Theoretic Security and Quantum Security. Cryptology ePrint Archive Paper 202  Haibin Zhang Sisi Duan Boxin Zhao and Liehuang Zhu. 2022. WaterBear: Asynchronous BFT with Information-Theoretic Security and Quantum Security. Cryptology ePrint Archive Paper 202"}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","location":"Los Angeles CA USA","acronym":"CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3559348","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3559348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:50:56Z","timestamp":1750182656000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3559348"}},"subtitle":["Fully Parallelizable BFT from Reproposable Byzantine Agreement"],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":49,"alternative-id":["10.1145\/3548606.3559348","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3559348","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}