{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T05:00:51Z","timestamp":1776229251850,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":76,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3559346","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"2159-2173","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":50,"title":["Bolt-Dumbo Transformer"],"prefix":"10.1145","author":[{"given":"Yuan","family":"Lu","sequence":"first","affiliation":[{"name":"Institute of Software, Chinese Academy of Sciences, Beijing, China"}]},{"given":"Zhenliang","family":"Lu","sequence":"additional","affiliation":[{"name":"The University of Sydney, Sydney, NSW, Australia"}]},{"given":"Qiang","family":"Tang","sequence":"additional","affiliation":[{"name":"The University of Sydney, Sydney, NSW, Australia"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Bug in ABA protocol's use of Common Coin. https:\/\/github.com\/amiller\/ HoneyBadgerBFT\/issues\/59  Bug in ABA protocol's use of Common Coin. https:\/\/github.com\/amiller\/ HoneyBadgerBFT\/issues\/59"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538426"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400804"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467914"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00044"},{"key":"e_1_3_2_2_6_1","volume-title":"Alexander Spiegelman. Asymptotically Optimal Validated Asynchronous Byzantine Agreement. In Proc. PODC","author":"Abraham Ittai","year":"2019","unstructured":"Ittai Abraham , Dahlia Malkhi , and Alexander Spiegelman. Asymptotically Optimal Validated Asynchronous Byzantine Agreement. In Proc. PODC 2019 . 337--346. Ittai Abraham, Dahlia Malkhi, and Alexander Spiegelman. Asymptotically Optimal Validated Asynchronous Byzantine Agreement. In Proc. PODC 2019. 337--346."},{"key":"e_1_3_2_2_7_1","volume-title":"Zhuolun Xiang. Good-Case Latency of Byzantine Broadcast: A Complete Categorization. In Proc. PODC","author":"Abraham Ittai","year":"2021","unstructured":"Ittai Abraham , Kartik Nayak , Ling Ren , and Zhuolun Xiang. Good-Case Latency of Byzantine Broadcast: A Complete Categorization. In Proc. PODC 2021 . Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. Good-Case Latency of Byzantine Broadcast: A Complete Categorization. In Proc. PODC 2021."},{"key":"e_1_3_2_2_8_1","volume-title":"Prime: Byzantine replication under attack","author":"Amir Yair","year":"2010","unstructured":"Yair Amir , Brian Coan , Jonathan Kirsch , and John Lane . 2010 . Prime: Byzantine replication under attack . IEEE transactions on dependable and secure computing, Vol. 8 , 4 (2010), 564--577. Yair Amir, Brian Coan, Jonathan Kirsch, and John Lane. 2010. Prime: Byzantine replication under attack. IEEE transactions on dependable and secure computing, Vol. 8, 4 (2010), 564--577."},{"key":"e_1_3_2_2_9_1","volume-title":"Proc. OPODIS","author":"Amoussou-Guenou Yackolley","year":"2019","unstructured":"Yackolley Amoussou-Guenou , Antonella Del Pozzo , Maria Potop-Butucaru , and Sara Tucci-Piergiovanni . Correctness of tendermint-core blockchains . In Proc. OPODIS 2019 . Yackolley Amoussou-Guenou, Antonella Del Pozzo, Maria Potop-Butucaru, and Sara Tucci-Piergiovanni. Correctness of tendermint-core blockchains. In Proc. OPODIS 2019."},{"key":"e_1_3_2_2_10_1","volume-title":"Distributed computing: fundamentals, simulations, and advanced topics","author":"Attiya Hagit","unstructured":"Hagit Attiya and Jennifer Welch . 2004. Distributed computing: fundamentals, simulations, and advanced topics . Vol. 19 . John Wiley & Sons . Hagit Attiya and Jennifer Welch. 2004. Distributed computing: fundamentals, simulations, and advanced topics. Vol. 19. John Wiley & Sons."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2658994"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.53"},{"key":"e_1_3_2_2_13_1","volume-title":"Proc. PODC","author":"Ben-Or Michael","year":"1983","unstructured":"Michael Ben-Or . Another advantage of free choice (Extended Abstract) Completely asynchronous agreement protocols . In Proc. PODC 1983 . 27--30. Michael Ben-Or. Another advantage of free choice (Extended Abstract) Completely asynchronous agreement protocols. In Proc. PODC 1983. 27--30."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0083-3"},{"key":"e_1_3_2_2_15_1","volume-title":"Proc. PODC","author":"Ben-Or Michael","year":"1994","unstructured":"Michael Ben-Or , Boaz Kelmer , and Tal Rabin . Asynchronous secure computations with optimal resilience . In Proc. PODC 1994 . 183--192. Michael Ben-Or, Boaz Kelmer, and Tal Rabin. Asynchronous secure computations with optimal resilience. In Proc. PODC 1994. 183--192."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2014.43"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36030-6_6"},{"key":"e_1_3_2_2_18_1","volume-title":"Tardigrade: An Atomic Broadcast Protocol for Arbitrary Network Conditions. In International Conference on the Theory and Application of Cryptology and Information Security. Springer, 547--572","author":"Blum Erica","year":"2021","unstructured":"Erica Blum , Jonathan Katz , and Julian Loss . 2021 . Tardigrade: An Atomic Broadcast Protocol for Arbitrary Network Conditions. In International Conference on the Theory and Application of Cryptology and Information Security. Springer, 547--572 . Erica Blum, Jonathan Katz, and Julian Loss. 2021. Tardigrade: An Atomic Broadcast Protocol for Arbitrary Network Conditions. In International Conference on the Theory and Application of Cryptology and Information Security. Springer, 547--572."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_25"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36288-6_3"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_2_22_1","unstructured":"Vitalik Buterin et al. 2014. A next-generation smart contract and decentralized application platform. white paper Vol. 3 37 (2014).  Vitalik Buterin et al. 2014. A next-generation smart contract and decentralized application platform. white paper Vol. 3 37 (2014)."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586124"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_31"},{"key":"e_1_3_2_2_25_1","volume-title":"Proc. PODC","author":"Cachin Christian","year":"2020","unstructured":"Christian Cachin , Klaus Kursawe , and Victor Shoup . Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography . In Proc. PODC 2020 . 123--132. Christian Cachin, Klaus Kursawe, and Victor Shoup. Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography. In Proc. PODC 2020. 123--132."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_42"},{"key":"e_1_3_2_2_27_1","volume-title":"Proc. DISC","author":"Cachin Christian","year":"2017","unstructured":"Christian Cachin and Marko Vukolic . Blockchain Consensus Protocols in the Wild (Keynote Talk) . In Proc. DISC 2017 . Christian Cachin and Marko Vukolic. Blockchain Consensus Protocols in the Wild (Keynote Talk). In Proc. DISC 2017."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"e_1_3_2_2_30_1","volume-title":"Proc. OSDI","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro , Barbara Liskov , Practical Byzantine fault tolerance . In Proc. OSDI 1999 . 173--186. Miguel Castro, Barbara Liskov, et al. Practical Byzantine fault tolerance. In Proc. OSDI 1999. 173--186."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3419614.3423256"},{"key":"e_1_3_2_2_32_1","volume-title":"Proc. NSDI","volume":"9","author":"Clement Allen","year":"2009","unstructured":"Allen Clement , Edmund L Wong , Lorenzo Alvisi , Michael Dahlin , and Mirco Marchetti . Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults .. In Proc. NSDI 2009 , Vol. 9 . 153--168. Allen Clement, Edmund L Wong, Lorenzo Alvisi, Michael Dahlin, and Mirco Marchetti. Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults.. In Proc. NSDI 2009, Vol. 9. 153--168."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxh145"},{"key":"e_1_3_2_2_34_1","volume-title":"Two More Algorithms for Randomized Signature-Free Asynchronous Binary Byzantine Consensus with t<n\/3 and O(n2) Messages and O(1) 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 t<n\/3 and O(n2) Messages and O(1) Round Expected Termination. arXiv preprint arXiv:2002.08765 ( 2020 ). Tyler Crain. 2020. Two More Algorithms for Randomized Signature-Free Asynchronous Binary Byzantine Consensus with t<n\/3 and O(n2) Messages and O(1) Round Expected Termination. arXiv preprint arXiv:2002.08765 (2020)."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519594"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484808"},{"key":"e_1_3_2_2_37_1","volume-title":"Practical Asynchronous Distributed Key Generation. 2022 IEEE Symposium on Security and Privacy (SP). 2518--2534","author":"Das Sourav","year":"2022","unstructured":"Sourav Das , Thomas Yurek , Zhuolun Xiang , Andrew Miller , Lefteris Kokoris-Kogias , and Ling Ren . 2022 . Practical Asynchronous Distributed Key Generation. 2022 IEEE Symposium on Security and Privacy (SP). 2518--2534 . Sourav Das, Thomas Yurek, Zhuolun Xiang, Andrew Miller, Lefteris Kokoris-Kogias, and Ling Ren. 2022. Practical Asynchronous Distributed Key Generation. 2022 IEEE Symposium on Security and Privacy (SP). 2518--2534."},{"key":"e_1_3_2_2_38_1","volume-title":"Proc. CCS 2018. 2028","author":"Duan Sisi","year":"2041","unstructured":"Sisi Duan , Michael K Reiter , and Haibin Zhang . BEAT : Asynchronous BFT made practical . In Proc. CCS 2018. 2028 -- 2041 . Sisi Duan, Michael K Reiter, and Haibin Zhang. BEAT: Asynchronous BFT made practical. In Proc. CCS 2018. 2028--2041."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872066"},{"key":"e_1_3_2_2_42_1","volume-title":"Zhenfeng Zhang. Dumbo-NG: Fast Asynchronous BFT Consensus with Throughput-Oblivious Latency. In Proc. CCS","author":"Gao Yingzi","year":"2022","unstructured":"Yingzi Gao , Yuan Lu , Zhenliang Lu , Qiang Tang , Jing Xu , and Zhenfeng Zhang. Dumbo-NG: Fast Asynchronous BFT Consensus with Throughput-Oblivious Latency. In Proc. CCS 2022 . Yingzi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. Dumbo-NG: Fast Asynchronous BFT Consensus with Throughput-Oblivious Latency. In Proc. CCS 2022."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS54860.2022.00032"},{"key":"e_1_3_2_2_44_1","volume-title":"Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback. arXiv preprint arXiv:2106.10362","author":"Gelashvili Rati","year":"2021","unstructured":"Rati Gelashvili , Lefteris Kokoris-Kogias , Alberto Sonnino , Alexander Spiegelman , and Zhuolun Xiang . 2021a. Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback. arXiv preprint arXiv:2106.10362 ( 2021 ). Rati Gelashvili, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander Spiegelman, and Zhuolun Xiang. 2021a. Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback. arXiv preprint arXiv:2106.10362 (2021)."},{"key":"e_1_3_2_2_45_1","volume-title":"Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol. arXiv preprint arXiv:2103.03181","author":"Gelashvili Rati","year":"2021","unstructured":"Rati Gelashvili , Lefteris Kokoris-Kogias , Alexander Spiegelman , and Zhuolun Xiang . 2021b. Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol. arXiv preprint arXiv:2103.03181 ( 2021 ). Rati Gelashvili, Lefteris Kokoris-Kogias, Alexander Spiegelman, and Zhuolun Xiang. 2021b. Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol. arXiv preprint arXiv:2103.03181 (2021)."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_21"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1755913.1755950"},{"key":"e_1_3_2_2_48_1","volume-title":"Proc. DSN","author":"Gueta Guy Golan","year":"2019","unstructured":"Guy Golan Gueta , Ittai Abraham , Shelly Grossman , Dahlia Malkhi , Benny Pinkas , Michael Reiter , Dragos-Adrian Seredinschi , Orr Tamir , and Alin Tomescu . SBFT : a Scalable and Decentralized Trust Infrastructure . In Proc. DSN 2019 . 568--580. Guy Golan Gueta, Ittai Abraham, Shelly Grossman, Dahlia Malkhi, Benny Pinkas, Michael Reiter, Dragos-Adrian Seredinschi, Orr Tamir, and Alin Tomescu. SBFT: a Scalable and Decentralized Trust Infrastructure. In Proc. DSN 2019. 568--580."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2022.24385"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417262"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2009.21"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467905"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3423364"},{"key":"e_1_3_2_2_54_1","volume-title":"Proc. ICALP","author":"Kursawe Klaus","year":"2005","unstructured":"Klaus Kursawe and Victor Shoup . first announced in 2002. Optimistic asynchronous atomic broadcast . In Proc. ICALP 2005 . 204--215. Klaus Kursawe and Victor Shoup. first announced in 2002. Optimistic asynchronous atomic broadcast. In Proc. ICALP 2005. 204--215."},{"key":"e_1_3_2_2_55_1","first-page":"235","article-title":"Combining Asynchronous and Synchronous Byzantine Agreement: The Best of Both Worlds","volume":"2018","author":"Loss Julian","year":"2018","unstructured":"Julian Loss and Tal Moran . 2018 . Combining Asynchronous and Synchronous Byzantine Agreement: The Best of Both Worlds . IACR Cryptol. ePrint Arch. , Vol. 2018 (2018), 235 . Julian Loss and Tal Moran. 2018. Combining Asynchronous and Synchronous Byzantine Agreement: The Best of Both Worlds. IACR Cryptol. ePrint Arch., Vol. 2018 (2018), 235.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_56_1","volume-title":"Bolt-dumbo transformer: Asynchronous consensus as fast as the pipelined bft. arXiv preprint arXiv:2103.09425","author":"Lu Yuan","year":"2021","unstructured":"Yuan Lu , Zhenliang Lu , and Qiang Tang . 2021. Bolt-dumbo transformer: Asynchronous consensus as fast as the pipelined bft. arXiv preprint arXiv:2103.09425 ( 2021 ). Yuan Lu, Zhenliang Lu, and Qiang Tang. 2021. Bolt-dumbo transformer: Asynchronous consensus as fast as the pipelined bft. arXiv preprint arXiv:2103.09425 (2021)."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405707"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_2_2_59_1","volume-title":"Jason Paul Cruz, and Yuichi Kaji","author":"Momose Atsuki","year":"2020","unstructured":"Atsuki Momose , Jason Paul Cruz, and Yuichi Kaji . 2020 . Hybrid-BFT: Optimistically Responsive Synchronous Consensus with Optimal Latency or Resilience. IACR Cryptol. ePrint Arch ., Vol. 2020 (2020), 406. Atsuki Momose, Jason Paul Cruz, and Yuichi Kaji. 2020. Hybrid-BFT: Optimistically Responsive Synchronous Consensus with Optimal Latency or Resilience. IACR Cryptol. ePrint Arch., Vol. 2020 (2020), 406."},{"key":"e_1_3_2_2_60_1","volume-title":"Momose and Ling Ren. Multi-Threshold Byzantine Fault Tolerance. In Proc. CCS","author":"Atsuki","year":"2021","unstructured":"Atsuki Momose and Ling Ren. Multi-Threshold Byzantine Fault Tolerance. In Proc. CCS 2021 . Atsuki Momose and Ling Ren. Multi-Threshold Byzantine Fault Tolerance. In Proc. CCS 2021."},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611468"},{"key":"e_1_3_2_2_62_1","volume-title":"Bitcoin: A peer-to-peer electronic cash system.","author":"Nakamoto Satoshi","year":"2008","unstructured":"Satoshi Nakamoto . 2008 . Bitcoin: A peer-to-peer electronic cash system. (2008). Satoshi Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. (2008)."},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70697-9_14"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25873-2_4"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582736"},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_47"},{"key":"e_1_3_2_2_67_1","volume-title":"Proc. EUROCRYPT","author":"Pass R.","year":"2019","unstructured":"R. Pass , and E. Shi . 2018. Thunderella: Blockchains with optimistic instant confirmation . In Proc. EUROCRYPT 2019 . 3--33. R. Pass, and E. Shi. 2018. Thunderella: Blockchains with optimistic instant confirmation. In Proc. EUROCRYPT 2019. 3--33."},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"e_1_3_2_2_69_1","volume-title":"Proc. OPODIS","author":"Ramasamy HariGovind V","year":"2005","unstructured":"HariGovind V Ramasamy and Christian Cachin . Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast . In Proc. OPODIS 2005 . 88--102. HariGovind V Ramasamy and Christian Cachin. Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast. In Proc. OPODIS 2005. 88--102."},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484561"},{"key":"e_1_3_2_2_71_1","volume-title":"Kartik Nayak. On the Optimality of Optimistic Responsiveness. In Proc. CCS","author":"Shrestha Nibesh","year":"2020","unstructured":"Nibesh Shrestha , Ittai Abraham , Ling Ren , and Kartik Nayak. On the Optimality of Optimistic Responsiveness. In Proc. CCS 2020 . 839--857. Nibesh Shrestha, Ittai Abraham, Ling Ren, and Kartik Nayak. On the Optimality of Optimistic Responsiveness. In Proc. CCS 2020. 839--857."},{"key":"e_1_3_2_2_72_1","volume-title":"Proc. DISC","author":"Spiegelman Alexander","year":"2021","unstructured":"Alexander Spiegelman . 2021 . In Search for an Optimal Authenticated Byzantine Agreement . In Proc. DISC 2021. Alexander Spiegelman. 2021. In Search for an Optimal Authenticated Byzantine Agreement. In Proc. DISC 2021."},{"key":"e_1_3_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS.2009.36"},{"key":"e_1_3_2_2_74_1","volume-title":"David Tse. DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks. In Proc. NSDI","author":"Yang Lei","year":"2022","unstructured":"Lei Yang , Seo Jin Park , Mohammad Alizadeh , Sreeram Kannan , and David Tse. DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks. In Proc. NSDI 2022 . Lei Yang, Seo Jin Park, Mohammad Alizadeh, Sreeram Kannan, and David Tse. DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks. In Proc. NSDI 2022."},{"key":"e_1_3_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"},{"key":"e_1_3_2_2_76_1","volume-title":"Proc. CCS","author":"Zhang Haibing","year":"2022","unstructured":"Haibing Zhang and Sisi Duan . PACE : Fully Parallelizable BFT from Reproposable Byzantine Agreement . In Proc. CCS 2022 . Haibing Zhang and Sisi Duan. PACE: Fully Parallelizable BFT from Reproposable Byzantine Agreement. In Proc. CCS 2022."}],"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.3559346","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3559346","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.3559346"}},"subtitle":["Asynchronous Consensus As Fast As the Pipelined BFT"],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":76,"alternative-id":["10.1145\/3548606.3559346","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3559346","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"}}]}}