research-article

Dumbo: Faster Asynchronous BFT Protocols

Authors:

Zhenfeng ZhangAuthors Info & Claims

CCS '20: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security

Pages 803 - 818

https://doi.org/10.1145/3372297.3417262

Published: 02 November 2020 Publication History

Abstract

HoneyBadgerBFT, proposed by Miller et al. [34] as the first practical asynchronous atomic broadcast protocol, demonstrated impressive performance. The core of HoneyBadgerBFT (HB-BFT) is to achieve batching consensus using asynchronous common subset protocol (ACS) of Ben-Or et al., constituted with n reliable broadcast protocol (RBC) to have each node propose its input, followed by n asynchronous binary agreement protocol (ABA) to make a decision for each proposed value (n is the total number of nodes).

In this paper, we propose two new atomic broadcast protocols (called Dumbo1, Dumbo2) both of which have asymptotically and practically better efficiency. In particular, the ACS of Dumbo1 only runs a small κ (independent of n) instances of ABA, while that of Dumbo2 further reduces it to constant! At the core of our techniques are two major observations: (1) reducing the number of ABA instances significantly improves efficiency; and (2) using multi-valued validated Byzantine agreement (MVBA) which was considered sub-optimal for ACS in [34] in a more careful way could actually lead to a much more efficient ACS.

We implement both Dumbo1, Dumbo2 and deploy them as well as HB-BFT on 100 Amazon EC2 t2.medium instances uniformly distributed throughout 10 different regions across the globe, and run extensive experiments in the same environments. The experimental results show that our protocols achieve multi-fold improvements over HoneyBadgerBFT on both latency and throughput, especially when the system scale becomes moderately large.

Supplementary Material

MOV File (Copy of CCS2020_fp227_QiangTang - Brian Hollendyke.mov)

Presentation video

Download
389.91 MB

References

[1]

Ittai Abraham, Srinivas Devadas, Danny Dolev, Kartik Nayak, and Ling Ren. 2019 a. Synchronous Byzantine Agreement with Expected O (1) Rounds, Expected O (n^2 ) Communication, and Optimal Resilience. In International Conference on Financial Cryptography and Data Security. Springer, 320--334.

[2]

Ittai Abraham, Dahlia Malkhi, and Alexander Spiegelman. 2019 b. Asymptotically optimal validated asynchronous byzantine agreement. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. 337--346.

Digital Library

[3]

Joseph A Akinyele, Christina Garman, Ian Miers, Matthew W Pagano, Michael Rushanan, Matthew Green, and Aviel D Rubin. 2013. Charm: a framework for rapidly prototyping cryptosystems. Journal of Cryptographic Engineering, Vol. 3, 2 (2013), 111--128.

[4]

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.

Digital Library

[5]

Pierre-Louis Aublin, Sonia Ben Mokhtar, and Vivien Quéma. 2013. Rbft: Redundant byzantine fault tolerance. In 2013 IEEE 33rd International Conference on Distributed Computing Systems. IEEE, 297--306.

Digital Library

[6]

Joonsang Baek and Yuliang Zheng. 2003. Simple and efficient threshold cryptosystem from the gap diffie-hellman group. In GLOBECOM'03. IEEE Global Telecommunications Conference (IEEE Cat. No. 03CH37489), Vol. 3. IEEE, 1491--1495.

[7]

Michael Ben-Or. 1983. Another advantage of free choice (extended abstract): Completely asynchronous agreement protocols. In Proceedings of the second annual ACM symposium on Principles of distributed computing. ACM, 27--30.

Digital Library

[8]

Michael Ben-Or and Ran El-Yaniv. 2003. Resilient-optimal interactive consistency in constant time. Distributed Computing, Vol. 16, 4 (2003), 249--262.

Digital Library

[9]

Michael Ben-Or, Boaz Kelmer, and Tal Rabin. 1994. Asynchronous secure computations with optimal resilience. In Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing. ACM, 183--192.

Digital Library

[10]

Alysson Bessani, Jo ao Sousa, and Eduardo EP Alchieri. 2014. State machine replication for the masses with BFT-SMaRt. In 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks. IEEE, 355--362.

Digital Library

[11]

Erica Blum, Jonathan Katz, and Julian Loss. 2019. Synchronous Consensus with Optimal Asynchronous Fallback Guarantees. In Theory of Cryptography Conference. Springer, 131--150.

[12]

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.

[13]

Gabriel Bracha. 1984. An asynchronous [(n-1)/3]-resilient consensus protocol. In Proceedings of the third annual ACM symposium on Principles of distributed computing. ACM, 154--162.

Digital Library

[14]

Gabriel Bracha. 1987. Asynchronous Byzantine agreement protocols. Information and Computation, Vol. 75, 2 (1987), 130--143.

Digital Library

[15]

Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. 2001. Secure and efficient asynchronous broadcast protocols. In Annual International Cryptology Conference. Springer, 524--541.

Digital Library

[16]

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.

Digital Library

[17]

Christian Cachin and Jonathan A Poritz. 2002. Secure intrusion-tolerant replication on the Internet. In Proceedings International Conference on Dependable Systems and Networks. IEEE, 167--176.

[18]

Miguel Castro, Barbara Liskov, et al. 1999. Practical Byzantine fault tolerance. In OSDI, Vol. 99. 173--186.

Digital Library

[19]

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.

[20]

Flaviu Cristian, Houtan Aghili, Raymond Strong, and Danny Dolev. 1986. Atomic broadcast: From simple message diffusion to Byzantine agreement .International Business Machines Incorporated, Thomas J. Watson Research Center.

[21]

Danny Dolev, Michael J Fischer, Rob Fowler, Nancy A Lynch, and H Raymond Strong. 1982. An efficient algorithm for Byzantine agreement without authentication. Information and Control, Vol. 52, 3 (1982), 257--274.

[22]

Sisi Duan, Michael K Reiter, and Haibin Zhang. 2018. BEAT: Asynchronous BFT made practical. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. ACM, 2028--2041.

Digital Library

[23]

Michael J Fischer, Nancy A Lynch, and Michael S Paterson. 1982. Impossibility of distributed consensus with one faulty process. Technical Report. Massachusetts Inst of Tech Cambridge lab for Computer Science.

[24]

Adam Gka gol, Damian Le'sniak, Damian Straszak, and Michał 'Swike tek. 2019. Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes. In Proceedings of the 1st ACM Conference on Advances in Financial Technologies. 214--228.

[25]

Juan A Garay and Aggelos Kiayias. 2018. SoK: A Consensus Taxonomy in the Blockchain Era. IACR Cryptology ePrint Archive, Vol. 2018 (2018), 754.

[26]

Klaus Kursawe and Victor Shoup. 2005. Optimistic asynchronous atomic broadcast. In International Colloquium on Automata, Languages, and Programming. Springer, 204--215.

[27]

Leslie Lamport. 1998. The part-time parliament. ACM Transactions on Computer Systems (TOCS), Vol. 16, 2 (1998), 133--169.

Digital Library

[28]

Leslie Lamport, Robert Shostak, and Marshall Pease. 1982. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), Vol. 4, 3 (1982), 382--401.

Digital Library

[29]

Yuan Lu, Zhenliang Lu, Qiang Tang, and Guiling Wang. 2020. Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited. In PODC '20: Proceedings of the 39th Symposium on Principles of Distributed Computing. ACM, 129--138.

Digital Library

[30]

Ben Lynn. 2007. On the implementation of pairing-based cryptosystems. Ph.D. Dissertation. Stanford University Stanford, California.

[31]

Ethan MacBrough. 2018. Cobalt: BFT governance in open networks. arXiv preprint arXiv:1802.07240 (2018).

[32]

Dahlia Malkhi, Kartik Nayak, and Ling Ren. 2019. Flexible Byzantine Fault Tolerance. arXiv preprint arXiv:1904.10067 (2019).

[33]

Andrew Miller. 2018. Bug in ABA protocol's use of Common Coin 59. https://github.com/amiller/HoneyBadgerBFT/issues/59. Online Forum.

[34]

Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, and Dawn Song. 2016. The honey badger of BFT protocols. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. ACM, 31--42.

Digital Library

[35]

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.

[36]

Achour Mostefaoui, Hamouma Moumen, and Michel Raynal. 2014. Signature-free asynchronous byzantine consensus with t< n/3 and mathcalO(n^2) messages. In Proceedings of the 2014 ACM symposium on Principles of distributed computing. ACM, 2--9.

Digital Library

[37]

Achour Mostéfaoui, Hamouma Moumen, and Michel Raynal. 2015. Signature-free asynchronous binary Byzantine consensus with t< n/3, O (n2) messages, and O (1) expected time. Journal of the ACM (JACM), Vol. 62, 4 (2015), 31.

Digital Library

[38]

Diego Ongaro and John Ousterhout. 2014. In search of an understandable consensus algorithm. In 2014 USENIX Annual Technical Conference (USENIX ATC 14). 305--319.

Digital Library

[39]

Michael O Rabin. 1983. Randomized byzantine generals. In 24th Annual Symposium on Foundations of Computer Science (sfcs 1983). IEEE, 403--409.

Digital Library

[40]

HariGovind V Ramasamy and Christian Cachin. 2005. Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast. In International Conference On Principles Of Distributed Systems. Springer, 88--102.

[41]

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 2009 28th IEEE International Symposium on Reliable Distributed Systems. IEEE, 135--144.

Digital Library

[42]

Zooko Wilcox-O'Hearn. 2008. Zfec 1.4. 0. Open source code distribution: http://pypi. python. org/pypi/zfec (2008).

Cited By

Jia GShen ZSun HXin JWang D(2025)RWA-BFT: Reputation-Weighted Asynchronous BFT for Large-Scale IoTSensors10.3390/s2502041325:2(413)Online publication date: 12-Jan-2025
https://doi.org/10.3390/s25020413
Huang YLi HSun YDuan S(2025)Byzantine Fault Tolerance With Non-Determinism, RevisitedIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.351654120(309-322)Online publication date: 2025
https://doi.org/10.1109/TIFS.2024.3516541
Wang HYou QDuan S(2025) Synchronous Byzantine Agreement With O ( n ) Messages and O (1) Expected Time IEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.351585420(338-349)Online publication date: 2025
https://doi.org/10.1109/TIFS.2024.3515854
Show More Cited By

Index Terms

Dumbo: Faster Asynchronous BFT Protocols
1. Computer systems organization
  1. Dependable and fault-tolerant systems and networks
    1. Availability
    2. Reliability
2. Security and privacy
  1. Systems security
    1. Distributed systems security

Recommendations

On the theoretical gap between synchronous and asynchronous MPC protocols
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Multiparty computation (MPC) protocols among n parties secure against t active faults are known to exist if and only if
- t < n/2, when the channels are synchronous, and
- t < n/3, when the channels are asynchronous, respectively.
In this work we analyze ...
On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience
Abstract
Secure multi-party computation (MPC) is a fundamental problem in secure distributed computing. An MPC protocol allows a set of n mutually distrusting parties with private inputs to securely compute any publicly known function of their inputs, by ... $^{}^{}$
TP-BFT: A Faster Asynchronous BFT Consensus with Parallel Structure
Algorithms and Architectures for Parallel Processing
Abstract
The massive success of blockchains has significantly catalyzed interest in the extensive deployment of practical asynchronous Byzantine fault-tolerant (BFT) consensus protocols across wide area networks. However, existing asynchronous consensus ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CCS '20: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security

October 2020

2180 pages

ISBN:9781450370899

DOI:10.1145/3372297

General Chairs:
Jay Ligatti
University of South Florida, USA
,
Xinming Ou
University of South Florida, USA
,
Program Chairs:
Jonathan Katz
University of Maryland, USA
,
Giovanni Vigna
University of California-Santa Barbara, USA

Copyright © 2020 ACM.

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 the author(s) 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

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 November 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

CCS '20

Sponsor:

SIGSAC

CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security

November 9 - 13, 2020

Virtual Event, USA

Acceptance Rates

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

Upcoming Conference

CCS '25

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 13 - 17, 2025

Taipei , Taiwan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

162
Total Citations
View Citations
1,920
Total Downloads

Downloads (Last 12 months)280
Downloads (Last 6 weeks)17

Reflects downloads up to 28 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Jia GShen ZSun HXin JWang D(2025)RWA-BFT: Reputation-Weighted Asynchronous BFT for Large-Scale IoTSensors10.3390/s2502041325:2(413)Online publication date: 12-Jan-2025
https://doi.org/10.3390/s25020413
Huang YLi HSun YDuan S(2025)Byzantine Fault Tolerance With Non-Determinism, RevisitedIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.351654120(309-322)Online publication date: 2025
https://doi.org/10.1109/TIFS.2024.3516541
Wang HYou QDuan S(2025) Synchronous Byzantine Agreement With O ( n ) Messages and O (1) Expected Time IEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.351585420(338-349)Online publication date: 2025
https://doi.org/10.1109/TIFS.2024.3515854
Dai XGuo ZXiao JWang GLiang YYu CJin H(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
https://doi.org/10.1109/TC.2024.3510620
Zhao CZhang SWang TLiew S(2025)Bodyless block propagation: TPS fully scalable blockchain with pre-validationFuture Generation Computer Systems10.1016/j.future.2024.107516163(107516)Online publication date: Feb-2025
https://doi.org/10.1016/j.future.2024.107516
Hao RDing CDai XFan HXiang J(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
https://doi.org/10.1016/j.comcom.2024.107990
Zhang MWu CLi JGuo M(2025)Dynamic-EC: an efficient dynamic erasure coding method for permissioned blockchain systemsFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-023-3209-319:1Online publication date: 1-Jan-2025
https://dl.acm.org/doi/10.1007/s11704-023-3209-3
Yao DWang YDing YWu QQin BYang CLiang HLuo D(2025)DyBFT: leaderless BFT protocol based on locally adjustable valid committee set mechanismWorld Wide Web10.1007/s11280-024-01324-w28:1Online publication date: 21-Jan-2025
https://doi.org/10.1007/s11280-024-01324-w
Lan YHuang HHuang ZChen QWu S(2025)ERBFT: improved asynchronous BFT with erasure code and verifiable random functionThe Journal of Supercomputing10.1007/s11227-025-06995-481:3Online publication date: 12-Feb-2025
https://doi.org/10.1007/s11227-025-06995-4
Ye SChen QXiao FKe ZYang GMa H(2025)TP-BFT: A Faster Asynchronous BFT Consensus with Parallel StructureAlgorithms and Architectures for Parallel Processing10.1007/978-981-96-1545-2_5(60-79)Online publication date: 13-Feb-2025
https://doi.org/10.1007/978-981-96-1545-2_5
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten