skip to main content
10.1145/3548606.3559379acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
research-article

Dumbo-NG: Fast Asynchronous BFT Consensus with Throughput-Oblivious Latency

Published: 07 November 2022 Publication History

Abstract

Despite recent progresses of practical asynchronous Byzantine-fault tolerant (BFT) consensus, the state-of-the-art designs still suffer from suboptimal performance. Particularly, to obtain maximum throughput, most existing protocols \rev with guaranteed linear amortized communication complexity require each participating node to broadcast a huge batch of transactions, which dramatically sacrifices latency. Worse still, the ƒ slowest nodes' broadcasts might never be agreed to output and thus can be censored (where ƒ is the number of faults). Implementable mitigation to the threat either uses computationally costly threshold encryption or incurs communication blow-up by letting the honest nodes to broadcast redundant transactions, thus causing further efficiency issues.
We present Dumbo NG, a novel asynchronous BFT consensus (atomic broadcast) to solve the remaining practical issues. Its technical core is a non-trivial direct reduction from asynchronous atomic broadcast to multi-valued validated Byzantine agreement (MVBA) with quality property (which ensures the MVBA output is from honest nodes with 1/2 probability). Most interestingly, the new protocol structure empowers concurrent execution of transaction dissemination and asynchronous agreement. This brings about two benefits: (i) the throughput-latency tension is resolved to approach peak throughput with minimal increase in latency; (ii) the transactions broadcasted by any honest node can be agreed to output, thus conquering the censorship threat with no extra cost.
We implement Dumbo-NG with using the current fastest GLL+22 MVBA with quality (NDSS'22) and compare it to the state-of-the-art asynchronous BFT with guaranteed censorship resilience including Dumbo (CCS'20) and Speeding-Dumbo (NDSS'22). Along the way, we apply the techniques from Speeding-Dumbo to DispersedLedger (NSDI'22) and obtain an improved variant of DispersedLedger called Dumbo-DLfor a comprehensive comparison. Extensive experiments (over up to 64 AWS EC2 nodes across 16 AWS regions) reveal: Dumbo-NG realizes a peak throughput 4-8x over Dumbo, 2-4x over Speeding-Dumbo, and 2-3x over sDumbo-DL for varying scales; More importantly, Dumbo-NG's latency, which is lowest among all tested protocols, can almost remain stable when throughput grows.

Supplementary Material

MP4 File (CCS22-fp0287.mp4)
Presentation video - short version

References

[1]
Ittai Abraham, Danny Dolev, and Joseph Y Halpern. 2008. An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience. In Proc. PODC 2008. 405--414.
[2]
Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, and Alin Tomescu. 2021. Reaching consensus for asynchronous distributed key generation. In Proc. PODC 2021. 363--373.
[3]
Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Maofan Yin. 2020. Sync hotstuff: Simple and practical synchronous state machine replication. In IEEE S&P 2020. 106--118.
[4]
Ittai Abraham, Dahlia Malkhi, and Alexander Spiegelman. 2019. Asymptotically optimal validated asynchronous byzantine agreement. In Proc. PODC 2019. 337--346.
[5]
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.
[6]
Yackolley Amoussou-Guenou, Antonella Del Pozzo, Maria Potop-Butucaru, and Sara Tucci-Piergiovanni. 2018. Correctness of tendermint-core blockchains. In Proc. OPODIS 2019.
[7]
Hagit Attiya and Jennifer Welch. 2004. Distributed computing: fundamentals, simulations, and advanced topics. Vol. 19. John Wiley & Sons.
[8]
Pierre-Louis Aublin, Sonia Ben Mokhtar, and Vivien Quéma. 2013. Rbft: Redundant byzantine fault tolerance. In Proc. ICDCS 2013. 297--306.
[9]
Renas Bacho and Julian Loss. 2022. On the Adaptive Security of the Threshold BLS Signature Scheme. In Proc. CCS 2022.
[10]
Joonsang Baek and Yuliang Zheng. 2003. Simple and efficient threshold cryptosystem from the gap diffie-hellman group. In GLOBECOM'03. 1491--1495.
[11]
Vivek Bagaria, Sreeram Kannan, David Tse, Giulia Fanti, and Pramod Viswanath. 2019. Prism: Deconstructing the blockchain to approach physical limits. In Proc. CCS 2019. 585--602.
[12]
Mathieu Baudet, Avery Ching, Andrey Chursin, George Danezis, Francc ois Garillot, Zekun Li, Dahlia Malkhi, Oded Naor, Dmitri Perelman, and Alberto Sonnino. 2019. State machine replication in the Libra Blockchain. (2019).
[13]
Michael Ben-Or. 1983. Another advantage of free choice (Extended Abstract) Completely asynchronous agreement protocols. In Proc. PODC 1983. 27--30.
[14]
Michael Ben-Or and Ran El-Yaniv. 2003. Resilient-optimal interactive consistency in constant time. Distributed Computing, Vol. 16, 4 (2003), 249--262.
[15]
Michael Ben-Or, Boaz Kelmer, and Tal Rabin. 1994. Asynchronous secure computations with optimal resilience. In Proc. PODC 1994. 183--192.
[16]
Alysson Bessani, Joao Sousa, and Eduardo EP Alchieri. 2014. State machine replication for the masses with BFT-SMART. In Proc. DSN 2014. 355--362.
[17]
Erica Blum, Jonathan Katz, and Julian Loss. 2019. Synchronous consensus with optimal asynchronous fallback guarantees. In Theory of Cryptography Conference. 131--150.
[18]
Alexandra Boldyreva. 2003. Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In International Workshop on Public Key Cryptography. Springer, 31--46.
[19]
Gabriel Bracha. 1987. Asynchronous Byzantine agreement protocols. Information and Computation, Vol. 75, 2 (1987), 130--143.
[20]
Vitalik Buterin. 2014. A next-generation smart contract and decentralized application platform. white paper, Vol. 3, 37 (2014).
[21]
Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. 2001. Secure and efficient asynchronous broadcast protocols. In Advances in Cryptology -- CRYPTO 2001. 524--541.
[22]
Christian Cachin, Klaus Kursawe, and Victor Shoup. 2005. Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography. Journal of Cryptology, Vol. 18, 3 (2005), 219--246.
[23]
Christian Cachin and Jonathan A Poritz. 2002. Secure intrusion-tolerant replication on the Internet. In Proc. DSN 2002. 167--176.
[24]
Christian Cachin and Stefano Tessaro. 2005. Asynchronous verifiable information dispersal. In Proc. SRDS 2005. 191--201.
[25]
Christian Cachin and Marko Vukolić. 2017. Blockchain consensus protocols in the wild. arXiv preprint arXiv:1707.01873 (2017).
[26]
Ran Canetti and Tal Rabin. Fast asynchronous Byzantine agreement with optimal resilience. In Proc. STOC 1993. 42--51.
[27]
Miguel Castro, Barbara Liskov, et al. 1999. Practical byzantine fault tolerance. In Proc. OSDI 1999. 173--186.
[28]
Benjamin Y Chan and Elaine Shi. 2020. Streamlet: Textbook streamlined blockchains. In Proc. AFT 2020.
[29]
Brad Chase and Ethan MacBrough. 2018. Analysis of the XRP ledger consensus protocol. arXiv preprint arXiv:1802.07242 (2018).
[30]
Allen Clement, Manos Kapritsos, Sangmin Lee, Yang Wang, Lorenzo Alvisi, Mike Dahlin, and Taylor Riche. 2009a. Upright cluster services. In Proc. SOSP 2009. 277--290.
[31]
Allen Clement, Edmund L Wong, Lorenzo Alvisi, Michael Dahlin, and Mirco Marchetti. 2009b. Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults. In Proc. NSDI 2009. 153--168.
[32]
Tyler Crain, Christopher Natoli, and Vincent Gramoli. Red belly: A secure, fair and scalable open blockchain. In IEEE S&P 2021. 466--483.
[33]
George Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, and Alexander Spiegelman. 2022. Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus. In Proc. EuroSys 2022. 34--50.
[34]
Sourav Das, Zhuolun Xiang, and Ling Ren. 2021. Asynchronous data dissemination and its applications. In Proc. CCS 2021. 2705--2721.
[35]
Sourav Das, Thomas Yurek, Zhuolun Xiang, Andrew Miller, Lefteris Kokoris-Kogias, and Ling Ren. 2022. Practical Asynchronous Distributed Key Generation. IEEE S&P 2022. 2518--2534.
[36]
Sisi Duan, Michael K Reiter, and Haibin Zhang. 2018. BEAT: Asynchronous BFT made practical. In Proc. CCS 2018. 2028--2041.
[37]
Michael J Fischer, Nancy A Lynch, and Michael S Paterson. 1985. Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), Vol. 32, 2 (1985), 374--382.
[38]
Matthias Fitzi and Juan A Garay. 2003. Efficient player-optimal protocols for strong and differential consensus. In Proc. PODC 2003. 211--220.
[39]
Adam Gka gol, Damian Leśniak, Damian Straszak, and Michał Świke tek. 2019. Aleph: Efficient atomic broadcast in asynchronous networks with byzantine nodes. In Proc. AFT 2019. 214--228.
[40]
Yingzi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. 2022a. Dumbo-NG: Fast Asynchronous BFT Consensus with Throughput-Oblivious Latency. arXiv preprint arXiv:2209.00750 (2022).
[41]
Yingzi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. 2022b. Efficient Asynchronous Byzantine Agreement without Private Setups. In Proc. ICDCS 2022.
[42]
Juan Garay, Aggelos Kiayias, and Nikos Leonardos. 2015. The bitcoin backbone protocol: Analysis and applications. In Advances in Cryptology -- EUROCRYPT 2015. 281--310.
[43]
Rati Gelashvili, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander Spiegelman, and Zhuolun Xiang. Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback. In FC 2022.
[44]
Rosario Gennaro, Stanisław Jarecki, Hugo Krawczyk, and Tal Rabin. 1999. Secure distributed key generation for discrete-log based cryptosystems. In Advances in Cryptology -- EUROCRYPT 1999. 295--310.
[45]
Neil Giridharan, Lefteris Kokoris-Kogias, Alberto Sonnino, and Alexander Spiegelman. 2022. Bullshark: DAG BFT Protocols Made Practical. In Proc. CCS 2022.
[46]
Rachid Guerraoui, Nikola Knežević, Vivien Quéma, and Marko Vukolić. 2010. The next 700 BFT protocols. In Proc. EuroSys 2010. 363--376.
[47]
Guy Golan Gueta, Ittai Abraham, Shelly Grossman, Dahlia Malkhi, Benny Pinkas, Michael Reiter, Dragos-Adrian Seredinschi, Orr Tamir, and Alin Tomescu. 2019. Sbft: a scalable and decentralized trust infrastructure. In Proc. DSN 2019. 568--580.
[48]
Bingyong Guo, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. 2022. Speeding Dumbo: Pushing Asynchronous BFT Closer to Practice. In Proc. NDSS 2022.
[49]
Bingyong Guo, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. 2020. Dumbo: Faster asynchronous bft protocols. In Proc. CCS 2020. 803--818.
[50]
James Hendricks, Gregory R Ganger, and Michael K Reiter. 2007. Verifying distributed erasure-coded data. In Proc. PODC 2007. 139--146.
[51]
Aniket Kate and Ian Goldberg. 2009. Distributed key generation for the internet. In Proc. ICDCS 2009. 119--128.
[52]
Idit Keidar, Eleftherios Kokoris-Kogias, Oded Naor, and Alexander Spiegelman. 2021. All You Need is DAG. Proc. PODC 2021. 165--175.
[53]
Mahimna Kelkar, Fan Zhang, Steven Goldfeder, and Ari Juels. 2020. -Fairness for Byzantine Consensus. In Advances in Cryptology -- CRYPTO 2020. 451--480.
[54]
Eleftherios Kokoris Kogias, Dahlia Malkhi, and Alexander Spiegelman. 2020. Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures. In Proc. CCS 2020. 1751--1767.
[55]
Klaus Kursawe and Victor Shoup. 2005. Optimistic asynchronous atomic broadcast. In Proc. ICALP 2005. 204--215.
[56]
Beno^it Libert, Marc Joye, and Moti Yung. 2016. Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short shares. Theoretical Computer Science, Vol. 645 (2016), 1--24.
[57]
Benoît Libert and Moti Yung. 2011. Adaptively secure non-interactive threshold cryptosystems. In Proc. ICALP 2011. 588--600.
[58]
Chao Liu, Sisi Duan, and Haibin Zhang. EPIC: efficient asynchronous BFT with adaptive security. In Proc. DSN 2020. 437--451.
[59]
Yuan Lu, Zhenliang Lu, and Qiang Tang. 2022. Bolt-Dumbo Transformer: Asynchronous Consensus As Fast As Pipelined BFT. In Proc. CCS 2022.
[60]
Yuan Lu, Zhenliang Lu, Qiang Tang, and Guiling Wang. 2020. Dumbo-mvba: Optimal multi-valued validated asynchronous byzantine agreement, revisited. In Proc. PODC 2020. 129--138.
[61]
Ethan MacBrough. 2018. Cobalt: BFT governance in open networks. arXiv preprint arXiv:1802.07240 (2018).
[62]
Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, and Dawn Song. 2016. The honey badger of BFT protocols. In Proc. CCS 2016. 31--42.
[63]
Henrique Moniz, Nuno Ferreria Neves, Miguel Correia, and Paulo Verissimo. 2008. RITAS: Services for randomized intrusion tolerance. IEEE transactions on dependable and secure computing, Vol. 8, 1 (2008), 122--136.
[64]
Achour Mostefaoui, Hamouma Moumen, and Michel Raynal. 2014. Signature-free asynchronous Byzantine consensus with t < n/3 and O (n2) messages. In Proc. PODC 2014. 2--9.
[65]
Satoshi Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. Decentralized Business Review (2008), 21260.
[66]
Rafael Pass and Elaine Shi. 2018. Thunderella: Blockchains with optimistic instant confirmation. In Advances in Cryptology -- EUROCRYPT 2018. 3--33.
[67]
Arpita Patra, Ashish Choudhary, and Chandrasekharan Pandu Rangan. 2009. Simple and efficient asynchronous byzantine agreement with optimal resilience. In Proc. PODC 2009. 92--101.
[68]
Torben Pryds Pedersen. 1991. A threshold cryptosystem without a trusted party. Advances in Cryptology -- EUROCRYPT 1991. 522--526.
[69]
Michael O Rabin. 1983. Randomized byzantine generals. In 24th Annual Symposium on Foundations of Computer Science. 403--409.
[70]
HariGovind V Ramasamy and Christian Cachin. 2005. Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast. In Proc. OPODIS 2005. 88--102.
[71]
Fred Schneider. 1990. Implementing Fault-tolerant Services using the State Machine Approach: A Tutorial. Comput. Surveys (1990).
[72]
Nibesh Shrestha, Ittai Abraham, Ling Ren, and Kartik Nayak. 2020. On the optimality of optimistic responsiveness. In Proc. CCS 2020. 839--857.
[73]
Chrysoula Stathakopoulou, Tudor David, Matej Pavlovic, and Marko Vukolić. 2019. Mir-bft: High-throughput robust bft for decentralized networks. arXiv preprint arXiv:1906.05552 (2019).
[74]
Giuliana Santos Veronese, Miguel Correia, Alysson Neves Bessani, and Lau Cheuk Lung. 2009. Spin one's wheels? Byzantine fault tolerance with a spinning primary. In Proc. SRDS 2009. 135--144.
[75]
Lei Yang, Seo Jin Park, Mohammad Alizadeh, Sreeram Kannan, and David Tse. 2022. DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks. In Proc. NSDI 2022.
[76]
Maofan Yin, Dahlia Malkhi, Michael K Reiter, Guy Golan Gueta, and Ittai Abraham. 2019. HotStuff: BFT consensus with linearity and responsiveness. In Proc. PODC 2019. 347--356.
[77]
Yunhao Zhang, Srinath Setty, Qi Chen, Lidong Zhou, and Lorenzo Alvisi. 2020. Byzantine Ordered Consensus without Byzantine Oligarchy. In Proc. OSDI 2020.

Cited By

View all
  • (2025)Pako: Multi-Valued Byzantine Agreement Comparable to Partially-Synchronous BFTIEEE Transactions on Computers10.1109/TC.2024.351062074:3(887-900)Online publication date: Mar-2025
  • (2025)High-performance BFT consensus for Metaverse through block linking and shortcut loopComputer Communications10.1016/j.comcom.2024.107990229(107990)Online publication date: Jan-2025
  • (2025)Blockchain ConsensusPrinciples and Applications of Blockchain Systems10.1002/9781394237258.ch4(87-167)Online publication date: 3-Jan-2025
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
November 2022
3598 pages
ISBN:9781450394505
DOI:10.1145/3548606
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 November 2022

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. asynchronous consensus
  2. blockchain
  3. byzantine-fault tolerance

Qualifiers

  • Research-article

Conference

CCS '22
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

Upcoming Conference

CCS '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)211
  • Downloads (Last 6 weeks)7
Reflects downloads up to 28 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Pako: Multi-Valued Byzantine Agreement Comparable to Partially-Synchronous BFTIEEE Transactions on Computers10.1109/TC.2024.351062074:3(887-900)Online publication date: Mar-2025
  • (2025)High-performance BFT consensus for Metaverse through block linking and shortcut loopComputer Communications10.1016/j.comcom.2024.107990229(107990)Online publication date: Jan-2025
  • (2025)Blockchain ConsensusPrinciples and Applications of Blockchain Systems10.1002/9781394237258.ch4(87-167)Online publication date: 3-Jan-2025
  • (2025)Fundamentals of BlockchainPrinciples and Applications of Blockchain Systems10.1002/9781394237258.ch1(1-29)Online publication date: 3-Jan-2025
  • (2024)Autobahn: Seamless high speed BFTProceedings of the ACM SIGOPS 30th Symposium on Operating Systems Principles10.1145/3694715.3695942(1-23)Online publication date: 4-Nov-2024
  • (2024)On the Impact of Network Transport Protocols on Leader-Based Consensus CommunicationProceedings of the 6th ACM International Symposium on Blockchain and Secure Critical Infrastructure10.1145/3659463.3660030(1-11)Online publication date: 2-Jul-2024
  • (2024)Asynchronous Consensus without Trusted Setup or Public-Key CryptographyProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3670327(3242-3256)Online publication date: 2-Dec-2024
  • (2024)Random Beacons in Monte Carlo: Efficient Asynchronous Random Beacon without Threshold CryptographyProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3670326(2621-2635)Online publication date: 2-Dec-2024
  • (2024)Batch Range Proof: How to Make Threshold ECDSA More EfficientProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3670287(4256-4270)Online publication date: 2-Dec-2024
  • (2024)Blockchain CensorshipProceedings of the ACM Web Conference 202410.1145/3589334.3645431(1632-1643)Online publication date: 13-May-2024
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media