TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus
Pages 257 - 267
Abstract
This paper presents TetraBFT, a novel unauthenticated Byzantine fault tolerant protocol for solving consensus in partial synchrony, eliminating the need for public key cryptography and ensuring resilience against computationally unbounded adversaries.
TetraBFT has several compelling features: it necessitates only constant local storage, has optimal communication complexity, satisfies optimistic responsiveness --- allowing the protocol to operate at actual network speeds under ideal conditions --- and can achieve consensus in just 5 message delays, which outperforms all known unauthenticated protocols achieving the other properties listed. We validate the correctness of TetraBFT through rigorous security analysis and formal verification.
Furthermore, we extend TetraBFT into a multi-shot, chained consensus protocol, making a pioneering effort in applying pipelining techniques to unauthenticated protocols. This positions TetraBFT as a practical and deployable solution for blockchain systems aiming for high efficiency.
References
[1]
Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. 2021. Good-case Latency of Byzantine Broadcast: a Complete Categorization. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC'21). Association for Computing Machinery, New York, NY, USA, 331--341.
[2]
Ittai Abraham, Ling Ren, and Zhuolun Xiang. 2022. Good-Case and Bad-Case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization. In DROPS-IDN/v2/document/10.4230/LIPIcs.OPODIS.2021.5. Schloss-Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2021.5
[3]
Ittai Abraham and Gilad Stern. 2020. Information theoretic hotstuff. arXiv preprint arXiv:2009.12828 (2020).
[4]
Ittai Abraham and Gilad Stern. 2021. Information Theoretic HotStuff (IT-HS): Part One. https://decentralizedthoughts.github.io/2021-09-20-information-theoretic-hotstuff-it-hs-part-one/.
[5]
Ignacio Amores-Sesar, Christian Cachin, and Jovana Mićić. 2020. Security analysis of ripple consensus. arXiv preprint arXiv:2011.14816 (2020).
[6]
Hagit Attiya and Jennifer L Welch. 2023. Multi-valued connected consensus: A new perspective on crusader agreement and adopt-commit. arXiv preprint arXiv:2308.04646 (2023).
[7]
Hagit Attiya and Jennifer L. Welch. 2023. Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. arXiv:2308.04646 [cs].
[8]
Ethan Buchman. 2016. Tendermint: Byzantine fault tolerance in the age of blockchains. Ph. D. Dissertation. University of Guelph.
[9]
Christian Cachin. 2021. Asymmetric distributed trust. In International Conference on Distributed Computing and Networking 2021. 3--3.
[10]
Christian Cachin, Giuliano Losa, and Luca Zanolini. 2023. Quorum Systems in Permissionless Networks. In 26th International Conference on Principles of Distributed Systems (OPODIS 2022) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 253), Eshcar Hillel, Roberto Palmieri, and Etienne Rivière (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 17:1--17:22. ISSN: 1868-8969.
[11]
Miguel Castro. 2001. Practical Byzantine Fault Tolerance. Ph.D. MIT.
[12]
Miguel Castro and Barbara Liskov. 2002. Practical byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems (TOCS) 20, 4 (2002), 398--461.
[13]
Miguel Castro, Barbara Liskov, et al. 1999. Practical byzantine fault tolerance. In OsDI, Vol. 99. 173--186.
[14]
Benjamin Y Chan and Elaine Shi. 2020. Streamlet: Textbook streamlined blockchains. In Proceedings of the 2nd ACM Conference on Advances in Financial Technologies. 1--11.
[15]
Danny Dolev and Rüdiger Reischuk. 1985. Bounds on Information Exchange for Byzantine Agreement. J. ACM 32, 1 (Jan. 1985), 191--204.
[16]
D. Dolev and H. R. Strong. [n. d.]. Authenticated Algorithms for Byzantine Agreement. 12, 4 ([n. d.]), 656--666. Publisher: Society for Industrial and Applied Mathematics.
[17]
Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. 1988. Consensus in the presence of partial synchrony. Journal of the ACM (JACM) 35, 2 (1988), 288--323.
[18]
Álvaro García-Pérez and Alexey Gotsman. 2018. Federated Byzantine Quorum Systems. In 22nd International Conference on Principles of Distributed Systems (OPODIS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
[19]
Rati Gelashvili, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander Spiegelman, and Zhuolun Xiang. 2022. Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback. In International Conference on Financial Cryptography and Data Security. Springer, 296--315.
[20]
Mohammad M Jalalzai, Jianyu Niu, Chen Feng, and Fangyu Gai. 2023. Fasthotstuff: A fast and robust bft protocol for blockchains. IEEE Transactions on Dependable and Secure Computing (2023).
[21]
Igor Konnov, Jure Kukovec, and Thanh-Hai Tran. 2019. TLA+ model checking made symbolic. Proceedings of the ACM on Programming Languages 3, OOPSLA (Oct. 2019), 123:1--123:30.
[22]
Leslie Lamport. 2002. Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley Longman Publishing Co., Inc., USA.
[23]
Andrew Lewis-Pye and Tim Roughgarden. 2023. Permissionless Consensus. arXiv:2304.14701 [cs].
[24]
Xiao Li, Eric Chan, and Mohsen Lesani. 2023. Quorum subsumption for heterogeneous quorum systems. In 37th International Symposium on Distributed Computing (DISC 2023). Schloss-Dagstuhl-Leibniz Zentrum für Informatik.
[25]
Marta Lokhava, Giuliano Losa, David Mazières, Graydon Hoare, Nicolas Barry, Eli Gafni, Jonathan Jove, Rafał Malinowsky, and Jed McCaleb. 2019. Fast and secure global payments with stellar. In Proceedings of the 27th ACM Symposium on Operating Systems Principles. 80--96.
[26]
Giuliano Losa, Eli Gafni, and David Mazières. 2019. Stellar Consensus by Instantiation. In 33rd International Symposium on Distributed Computing (DISC 2019) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 146), Jukka Suomela (Ed.). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 27:1--27:15. tex.ids= losaStellarConsensusInstantiation2019a ISSN: 1868-8969.
[27]
Dahlia Malkhi and Kartik Nayak. 2023. HotStuff-2: Optimal Two-Phase Responsive BFT. Cryptology ePrint Archive (2023).
[28]
Rafael Pass and Elaine Shi. 2018. Thunderella: Blockchains with Optimistic Instant Confirmation. In Advances in Cryptology - EUROCRYPT 2018 (Lecture Notes in Computer Science), Jesper Buus Nielsen and Vincent Rijmen (Eds.). Springer International Publishing, Cham, 3--33.
[29]
M. Pease, R. Shostak, and L. Lamport. [n. d.]. Reaching Agreement in the Presence of Faults. 27, 2 ([n. d.]), 228--234.
[30]
Peiyao Sheng, Xuechao Wang, Sreeram Kannan, Kartik Nayak, and Pramod Viswanath. 2023. TrustBoost: Boosting Trust among Interoperable Blockchains. In Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security. 1571--1584.
[31]
Ertem Nusret Tas, Runchao Han, David Tse, and Mingchao Yu. 2023. Interchain timestamping for mesh security. In Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security. 1585--1599.
[32]
Maofan Yin, Dahlia Malkhi, Michael K Reiter, Guy Golan Gueta, and Ittai Abraham. 2019. HotStuff: BFT consensus with linearity and responsiveness. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. 347--356.
[33]
Qianyu Yu, Giuliano Losa, and Xuechao Wang. 2024. TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus. arXiv preprint arXiv:2405.02615 (2024).
Index Terms
- TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus
Recommendations
MWPoW+: A Strong Consensus Protocol for Intra-Shard Consensus in Blockchain Sharding
Blockchain sharding splits a blockchain into several shards where consensus is reached at the shard level rather than over the entire blockchain. It improves transaction throughput and reduces the computational resources required of individual nodes. But ...
ZK-BFT: A Zero-knowledge and Byzantine Fault Tolerant Consensus for Permissioned Blockchain Networks
ICBTA '23: Proceedings of the 2023 6th International Conference on Blockchain Technology and ApplicationsConsensus algorithms play an essential role in blockchains, directly impacting their performance. These algorithms involve validating and ordering pending transactions into new blocks, a process that exposes data to consensus nodes, raising privacy ...
BeeGees: Stayin' Alive in Chained BFT
PODC '23: Proceedings of the 2023 ACM Symposium on Principles of Distributed ComputingModern chained Byzantine Fault Tolerant (BFT) systems leverage a combination of pipelining and leader rotation to obtain both efficiency and fairness. These protocols, however, require a sequence of three or four consecutive honest leaders to commit ...
Comments
Information & Contributors
Information
Published In
June 2024
570 pages
ISBN:9798400706684
DOI:10.1145/3662158
- Chair:
- Ran Gelles,
- Proceedings Chair:
- Dennis Olivetti,
- Program Chair:
- Petr Kuznetsov
This work is licensed under a Creative Commons Attribution International 4.0 License.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 June 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Stellar Development Foundation
- Guangzhou-HKUST(GZ)
Conference
Acceptance Rates
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 60Total Downloads
- Downloads (Last 12 months)60
- Downloads (Last 6 weeks)26
Reflects downloads up to 30 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in