survey

Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms

Authors:

Michael Dang’ana,

Shashank Motepalli,

Hans-Arno JacobsenAuthors Info & Claims

ACM Computing Surveys, Volume 56, Issue 5

Article No.: 134, Pages 1 - 41

https://doi.org/10.1145/3636553

Published: 12 January 2024 Publication History

Abstract

Byzantine fault-tolerant (BFT) consensus algorithms are at the core of providing safety and liveness guarantees for distributed systems that must operate in the presence of arbitrary failures. Recently, numerous new BFT algorithms have been proposed, not least due to the traction blockchain technologies have garnered in the search for consensus solutions that offer high throughput, low latency, and robust system designs. In this article, we conduct a systematic survey of selected and distinguished BFT algorithms that have received extensive attention in academia and industry alike. We perform a qualitative comparison among all algorithms we review considering message and time complexities. Furthermore, we provide a comprehensive, step-by-step description of each surveyed algorithm by decomposing them into constituent subprotocols with intuitive figures to illustrate the message-passing pattern. We also elaborate on the strengths and weaknesses of each algorithm compared to the other state-of-the-art approaches.

References

[1]

Yair Amir, Brian Coan, Jonathan Kirsch, and John Lane. 2011. Prime: Byzantine replication under attack. IEEE Transactions on Dependable and Secure Computing 8, 4 (2011), 564–577. DOI:

Digital Library

[2]

Elli Androulaki, Artem Barger, Vita Bortnikov, Christian Cachin, Konstantinos Christidis, Angelo De Caro, David Enyeart, Christopher Ferris, Gennady Laventman, and Yacov Manevich. 2018. Hyperledger fabric: A distributed operating system for permissioned blockchains. In Proceedings of the 13th EuroSys Conference. 1–15.

Digital Library

[3]

Hagit Attiya and Jennifer Welch. 2004. Distributed Computing: Fundamentals, Simulations, and Advanced Topics. John Wiley and Sons.

Digital Library

[4]

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

Digital Library

[5]

Leo Maxim Bach, Branko Mihaljevic, and Mario Zagar. 2018. Comparative analysis of blockchain consensus algorithms. In Proceedings of the 2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO). IEEE, 1545–1550.

[6]

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

[7]

Shehar Bano, Alberto Sonnino, Mustafa Al-Bassam, Sarah Azouvi, Patrick McCorry, Sarah Meiklejohn, and George Danezis. 2019. SoK: Consensus in the age of blockchains. In Proceedings of the 1st ACM Conference on Advances in Financial Technologies. 183–198.

Digital Library

[8]

Mathieu Baudet, Avery Ching, Andrey Chursin, George Danezis, François Garillot, Zekun Li, Dahlia Malkhi, Oded Naor, Dmitri Perelman, and Alberto Sonnino. 2019. State machine replication in the libra blockchain. The Libra Assn., Tech. Rep (2019).

[9]

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

Digital Library

[10]

Michael Ben-Or, Boaz Kelmer, and Tal Rabin. 1994. Asynchronous secure computations with optimal resilience. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing. 183–192.

[11]

Alysson Bessani, Joao Sousa, and Eduardo E. P. Alchieri. 2014. State machine replication for the masses with BFT-SMART. In Proceedings of the 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks. IEEE, 355–362.

Digital Library

[12]

Gabriel Bracha. 1987. Asynchronous byzantine agreement protocols. Information and Computation 75, 2 (1987), 130–143.

Digital Library

[13]

Eric A. Brewer. 2000. Towards robust distributed systems. In Proceedings of the PODC. Portland, OR, 343477–343502.

Digital Library

[14]

Ethan Buchman. 2016. Tendermint: Byzantine Fault Tolerance in the Age of Blockchains. Ph.D. Dissertation.

[15]

Maxime Buser, Rafael Dowsley, Muhammed Esgin, Clémentine Gritti, Shabnam Kasra Kermanshahi, Veronika Kuchta, Jason Legrow, Joseph Liu, Raphaël Phan, and Amin Sakzad. 2023. A survey on exotic signatures for post-quantum blockchain: Challenges and research directions. ACM Computing Surveys 55, 12 (2023), 1–32.

Digital Library

[16]

Vitalik Buterin and Virgil Griffith. 2017. Casper the friendly finality gadget. arXiv:1710.09437. Retrieved from https://arxiv.org/abs/1710.09437. Accessed 2017.

[17]

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

[18]

Christian Cachin, Klaus Kursawe, and Victor Shoup. 2005. Random oracles in constantinople: Practical asynchronous byzantine agreement using cryptography. Journal of Cryptology 18, 3 (2005), 219–246.

Digital Library

[19]

Christian Cachin and Marko Vukolić. 2017. Blockchain consensus protocols in the wild. In Proceedings of the 31st International Symposium on Distributed Computing.

[20]

Miguel Castro. 2001. Practical Byzantine Fault Tolerance. Technical Report MIT/LCS/TR-817. MIT Laboratory for Computer Science.

[21]

Miguel Castro and Barbara Liskov. 2002. Practical byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems (TOCS) 20, 4 (2002), 398–461.

Digital Library

[22]

Miguel Castro and Barbara Liskov. 1999. Practical byzantine fault tolerance. In Proceedings of the OSDI. 173–186.

[23]

Yanling Chang, Eleftherios Iakovou, and Weidong Shi. 2020. Blockchain in global supply chains and cross border trade: a critical synthesis of the state-of-the-art, challenges and opportunities. International Journal of Production Research 58, 7 (2020), 2082–2099.

[24]

Allen Clement, Edmund Wong, Lorenzo Alvisi, Mike Dahlin, and Mirco Marchetti. 2009. Making byzantine fault tolerant systems tolerate byzantine faults. In Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation (NSDI’09). USENIX Association, 153–168.

Digital Library

[25]

Allen Clement, Edmund L Wong, Lorenzo Alvisi, Michael Dahlin, and Mirco Marchetti. 2009. Making byzantine fault tolerant systems tolerate byzantine faults. In Proceedings of the NSDI. 153–168.

[26]

Tyler Crain, Vincent Gramoli, Mikel Larrea, and Michel Raynal. 2017. DBFT: Efficient byzantine consensus with a weak coordinator and its application to consortium blockchains. arXiv:1702.03068. Retrieved from https://arxiv.org/abs/1702.03068. Accessed 2017.

[27]

Tyler Crain, Vincent Gramoli, Mikel Larrea, and Michel Raynal. 2018. DBFT: Efficient leaderless Byzantine consensus and its application to blockchains. In Proceedings of the 2018 IEEE 17th International Symposium on Network Computing and Applications (NCA). IEEE, 1–8.

[28]

Philip Daian, Steven Goldfeder, Tyler Kell, Yunqi Li, Xueyuan Zhao, Iddo Bentov, Lorenz Breidenbach, and Ari Juels. 2020. Flash boys 2.0: Frontrunning in decentralized exchanges, miner extractable value, and consensus instability. In Proceedings of the 2020 IEEE Symposium on Security and Privacy (SP). IEEE, 910–927.

[29]

George Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, and Alexander Spiegelman. 2022. Narwhal and tusk: A dag-based mempool and efficient bft consensus. In Proceedings of the 17th European Conference on Computer Systems. 34–50.

Digital Library

[30]

Diem. 2020. The Diem blockchain. Retrieved from https://developers.diem.com/main/docs/the-diem-blockchain-paper

[31]

Jintai Ding and Dieter Schmidt. 2005. Rainbow, a new multivariable polynomial signature scheme. In Proceedings of the International Conference on Applied Cryptography and Network Security. Springer, 164–175.

Digital Library

[32]

Tobias Distler. 2021. Byzantine fault-tolerant state-machine replication from a systems perspective. ACM Computing Surveys 54, 1 (2021), 1–38.

Digital Library

[33]

Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. 1987. On the minimal synchronism needed for distributed consensus. Journal of the ACM 34, 1 (1987), 77–97.

Digital Library

[34]

Ali Dorri, Salil S. Kanhere, and Raja Jurdak. 2017. Towards an optimized blockchain for IoT. In Proceedings of the 2017 IEEE/ACM 2nd International Conference on Internet-of-Things Design and Implementation (IoTDI). IEEE, 173–178.

Digital Library

[35]

Sisi Duan, Michael K. Reiter, and Haibin Zhang. 2017. Secure causal atomic broadcast, revisited. In Proceedings of the 2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN). IEEE, 61–72.

[36]

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. 2028–2041.

Digital Library

[37]

Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. 1988. Consensus in the presence of partial synchrony. Journal of the ACM 35, 2 (1988), 288–323.

Digital Library

[38]

Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. 1985. Impossibility of distributed consensus with one faulty process. Journal of the ACM 32, 2 (1985), 374–382.

Digital Library

[39]

Juan Garay, Aggelos Kiayias, and Nikos Leonardos. 2015. The bitcoin backbone protocol: Analysis and applications. In Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 281–310.

[40]

David K. Gifford. 1979. Weighted voting for replicated data. In Proceedings of the 7th ACM Symposium on Operating Systems Principles. 150–162.

Digital Library

[41]

Rachid Guerraoui, Nirupam Gupta, and Rafael Pinot. 2023. Byzantine machine learning: A primer. ACM Computing Surveys (2023).

Digital Library

[42]

Rachid Guerraoui, Nikola Knežević, Vivien Quéma, and Marko Vukolić. 2010. The next 700 BFT protocols. In Proceedings of the 5th European Conference on Computer Systems. 363–376.

Digital Library

[43]

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 Proceedings of the 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN). IEEE, 568–580.

[44]

Suyash Gupta, Jelle Hellings, and Mohammad Sadoghi. 2021. Rcc: Resilient concurrent consensus for high-throughput secure transaction processing. In Proceedings of the 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE, 1392–1403.

[45]

Suyash Gupta, Sajjad Rahnama, Jelle Hellings, and Mohammad Sadoghi. [n.d.]. ResilientDB: Global scale resilient blockchain fabric. Proceedings of the VLDB Endowment 13, 6 ([n. d.]).

Digital Library

[46]

Panpan Han, Zheng Yan, Wenxiu Ding, Shufan Fei, and Zhiguo Wan. 2023. A survey on cross-chain technologies. Distributed Ledger Technologies: Research and Practice 2, 2 (2023), 1–30.

Digital Library

[47]

James Hendricks, Gregory R. Ganger, and Michael K. Reiter. 2007. Verifying distributed erasure-coded data. In Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing. 139–146.

Digital Library

[48]

Maurice P. Herlihy and Jeannette M. Wing. 1990. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12, 3(1990), 463–492. DOI:

Digital Library

[49]

Cheng Huang, Minghua Chen, and Jin Li. 2013. Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems. ACM Transactions on Storage 9, 1 (2013), 1–28.

Digital Library

[50]

Idit Keidar, Eleftherios Kokoris-Kogias, Oded Naor, and Alexander Spiegelman. 2021. All you need is dag. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. 165–175.

Digital Library

[51]

Mahimna Kelkar, Fan Zhang, Steven Goldfeder, and Ari Juels. 2020. Order-fairness for byzantine consensus. In Proceedings of the Advances in Cryptology–CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020. Springer, 451–480.

Digital Library

[52]

Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement, and Edmund Wong. 2007. Zyzzyva: Speculative byzantine fault tolerance. In Proceedings of 21st ACM SIGOPS Symposium on Operating Systems Principles.

Digital Library

[53]

Ramakrishna Kotla and Michael Dahlin. 2004. High throughput Byzantine fault tolerance. In Proceedings of the International Conference on Dependable Systems and Networks, 2004. IEEE, 575–584.

[54]

Leslie Lamport. 1977. Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering2 (1977), 125–143.

Digital Library

[55]

Leslie Lamport. 1983. The weak Byzantine generals problem. Journal of the ACM 30, 3 (1983), 668–676.

Digital Library

[56]

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

Digital Library

[57]

LESLIE LAMPORT, ROBERT SHOSTAK, and MARSHALL PEASE. 1982. The byzantine generals problem. ACM Transactions on Programming Languages and Systems 4, 3 (1982), 382–401.

Digital Library

[58]

Leslie Lamport, Robert Shostak, and Marshall Pease. 2019. The byzantine generals problem. In Proceedings of the Concurrency: the Works of Leslie Lamport. 203–226.

Digital Library

[59]

Jinyuan Li and David Mazieres. 2007. Beyond one-third faulty replicas in byzantine fault tolerant systems. In Proceedings of the NSDI.

[60]

Michael L. Littman. 1994. Markov games as a framework for multi-agent reinforcement learning. In Proceedings of the Machine Learning Proceedings 1994. Elsevier, 157–163.

[61]

Nancy A. Lynch and Michael J. Fischer. 1981. On describing the behavior and implementation of distributed systems. Theoretical Computer Science 13, 1 (1981), 17–43.

[62]

Florence Jessie MacWilliams and Neil James Alexander Sloane. 1977. The Theory of Error Correcting Codes. Elsevier.

[63]

Dahlia Malkhi and Michael Reiter. 1997. Unreliable intrusion detection in distributed computations. In Proceedings of the 10th Computer Security Foundations Workshop. IEEE, 116–124.

[64]

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. 31–42.

Digital Library

[65]

Zarko Milosevic, Martin Biely, and André Schiper. 2013. Bounded delay in byzantine-tolerant state machine replication. In Proceedings of the 2013 IEEE 32nd International Symposium on Reliable Distributed Systems. IEEE, 61–70.

Digital Library

[66]

Achour Mostefaoui, Hamouma Moumen, and Michel Raynal. 2014. Signature-free asynchronous byzantine consensus with t< n/3 and O (n2) messages. In Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing.

Digital Library

[67]

Shashank Motepalli and Hans-Arno Jacobsen. 2022. Decentralizing permissioned blockchain with delay towers. arXiv preprint arXiv:2203.09714.

[68]

Satoshi Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. Decentralized Business Review (2008), 21260.

[69]

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

[70]

Raphael Overbeck and Nicolas Sendrier. 2009. Code-based cryptography. In Proceedings of the Post-Quantum Cryptography. Springer, 95–145.

[71]

Susan Owicki and David Gries. 1976. An axiomatic proof technique for parallel programs I. Acta Informatica 6, 4 (1976), 319–340.

Digital Library

[72]

Susan Owicki and Leslie Lamport. 1982. Proving liveness properties of concurrent programs. ACM Transactions on Programming Languages and Systems 4, 3 (1982), 455–495.

Digital Library

[73]

Liviu Panait and Sean Luke. 2005. Cooperative multi-agent learning: The state-of-the-art. Autonomous Agents and Multi-Agent Systems 11 (2005), 387–434.

Digital Library

[74]

Marshall Pease, Robert Shostak, and Leslie Lamport. 1980. Reaching agreement in the presence of faults. Journal of the ACM 27, 2 (1980), 228–234.

Digital Library

[75]

Chris Peikert. 2014. Lattice cryptography for the internet. In Proceedings of the International Workshop on Post-Quantum Cryptography. Springer, 197–219.

[76]

Gary L. Peterson and Michael J. Fischer. 1977. Economical solutions for the critical section problem in a distributed system. In Proceedings of the 9th Annual ACM Symposium on Theory of Computing. 91–97.

[77]

Parth Deshmukh, Sean Maginnis, and Josh Chandler. 2011. Jerasure 2.0. Chancellor’s Honors Program Projects. https://trace.tennessee.edu/utk_chanhonoproj/1362

[78]

Maciel M. Queiroz, Renato Telles, and Silvia H. Bonilla. 2020. Blockchain and supply chain management integration: a systematic review of the literature. Supply Chain Management: An International Journal 25, 2 (2020), 241–254.

[79]

Michael K. Reiter and Kenneth P. Birman. 1994. How to securely replicate services. ACM Transactions on Programming Languages and Systems 16, 3 (1994), 986–1009.

Digital Library

[80]

Robert W. Floyd. 1967. Assigning meanings to programs. In Program Verification: Fundamental Issues in Computer Science. Springer, 65–81.

[81]

Fred B Schneider. 1984. Byzantine generals in action: Implementing fail-stop processors. ACM Transactions on Computer Systems 2, 2 (1984), 145–154.

Digital Library

[82]

Fred B. Schneider. 1990. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys 22, 4 (1990), 299–319.

Digital Library

[83]

M. Serafini, P. Bokor, and N. Suri. 2008. Scrooge: Stable Speculative Byzantine Fault Tolerance Using Testifiers. Technical Report. Darmstadt University of Technology, Department of Computer Science.

[84]

Alex Shamis, Peter Pietzuch, Burcu Canakci, Miguel Castro, Cédric Fournet, Edward Ashton, Amaury Chamayou, Sylvan Clebsch, Antoine Delignat-Lavaud, and Matthew Kerner. 2022. IA-CCF: Individual accountability for permissioned ledgers. In Proceedings of the 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI’22). 467–491.

[85]

Victor Shoup. 2000. Practical threshold signatures. In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 207–220.

[86]

Victor Shoup and Rosario Gennaro. 1998. Securing threshold cryptosystems against chosen ciphertext attack. In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 1–16.

[87]

Daniel P. Siewiorek and Priya Narasimhan. 2005. Fault-tolerant architectures for space and avionics applications. NASA Ames Researchhttp://ic.arc.nasa.gov/projects/ishem/Papers/Siewi

[88]

Alexander Spiegelman, Balaji Aurn, Rati Gelashvili, and Zekun Li. 2023. Shoal: Improving DAG-BFT latency and robustness. arXiv:2306.03058. Retrieved from https://arxiv.org/abs/2306.03058. Accessed 2023.

[89]

Alexander Spiegelman, Neil Giridharan, Alberto Sonnino, and Lefteris Kokoris-Kogias. 2022. Bullshark: Dag bft protocols made practical. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. 2705–2718.

Digital Library

[90]

Chrysoula Stathakopoulou, Tudor David, Matej Pavlovic, and Marko Vukolić. 2019. Mir-bft: High-throughput robust bft for decentralized networks. arXiv:1906.05552. Retrieved from https://arxiv.org/abs/1906.05552. Accessed 2019.

[91]

Chrysoula Stathakopoulou, Matej Pavlovic, and Marko Vukolić. 2022. State machine replication scalability made simple. In Proceedings of the 17th European Conference on Computer Systems. 17–33.

Digital Library

[92]

Chrysoula Stathakopoulou, Signe Rüsch, Marcus Brandenburger, and Marko Vukolić. 2021. Adding fairness to order: Preventing front-running attacks in bft protocols using tees. In Proceedings of the 2021 40th International Symposium on Reliable Distributed Systems (SRDS). IEEE, 34–45.

[93]

Parth Thakkar, Senthil Nathan, and Balaji Viswanathan. 2018. Performance benchmarking and optimizing hyperledger fabric blockchain platform. In Proceedings of the 2018 IEEE 26th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS). IEEE, 264–276.

[94]

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 Proceedings of the 2009 28th IEEE International Symposium on Reliable Distributed Systems. 135–144. DOI:

Digital Library

[95]

Chris Walter, Peter Ellis, and Brian La Valley. 2005. The reliable platform service: A property-based fault tolerant service architecture. In Proceedings of the 9th IEEE International Symposium on High-Assurance Systems Engineering (HASE’05). IEEE, 34–43.

Digital Library

[96]

John H. Wensley, Leslie Lamport, Jack Goldberg, Milton W. Green, Karl N. Levitt, Po Mo Melliar-Smith, Robert E. Shostak, and Charles B. Weinstock. 1978. SIFT: Design and analysis of a fault-tolerant computer for aircraft control. Proceedings of the IEEE 66, 10 (1978), 1240–1255.

[97]

Z. Wilcox-O’Hearn. [n.d.]. Zfec 1.5. 2. Open Source Code Distribution:https://pypi.python.org/pypi/zfec. Accessed 2023.

[98]

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.

Digital Library

[99]

Gengrui Zhang and Hans-Arno Jacobsen. 2021. Prosecutor: An efficient BFT consensus algorithm with behavior-aware penalization against Byzantine attacks. In Proceedings of the 22nd International Middleware Conference. 52–63.

Digital Library

[100]

Gengrui Zhang and Hans-Arno Jacobsen. 2022. ESCAPE to precaution against leader failures. In Proceedings of the 2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS). IEEE, 625–635.

[101]

Gengrui Zhang, Fei Pan, Sofia Tijanic, and Hans-Arno Jacobsen. 2024. PrestigeBFT: Revolutionizing view changes in BFT consensus algorithms with reputation mechanisms. In Proceedings of the 2021 IEEE 40th International Conference on Data Engineering (ICDE). IEEE.

[102]

Yunhao Zhang, Srinath Setty, Qi Chen, Lidong Zhou, and Lorenzo Alvisi. 2020. Byzantine ordered consensus without Byzantine oligarchy. In Proceedings of the 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20). 633–649.

Cited By

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
Xiao ZTian YPeng CLong YCai C(2025)Ghost-Weight protocol: a highly efficient blockchain consensus for IoTThe Journal of Supercomputing10.1007/s11227-024-06565-081:1Online publication date: 1-Jan-2025
https://dl.acm.org/doi/10.1007/s11227-024-06565-0
Tian SBai FShen TZhang CGong B(2024)VSSB-Raft: A Secure and Efficient Zero Trust Consensus Algorithm for BlockchainACM Transactions on Sensor Networks10.1145/361130820:2(1-22)Online publication date: 9-Jan-2024
https://dl.acm.org/doi/10.1145/3611308
Show More Cited By

Index Terms

Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms
1. Computing methodologies
  1. Distributed computing methodologies

Recommendations

A Note on Consensus on Dual Failure Modes

Meyer and Pradhan proposed the MS (for "mixed-sum") algorithm to solve the Byzantine Agreement (BA) problem with dual failure modes: arbitrary faults (Byzantine faults) and dormant faults (essentially omission faults and timing faults) [3]. Our study ...
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 Applications

Consensus 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 ...
A self-adjusting algorithm for byzantine agreement

Byzantine Agreement is important both in the theory and practice of distributed computing. However, protocols to reach Byzantine Agreement are usually expensive both in the time required as well as in the number of messages exchanged. In this paper, we ...

Comments

Information & Contributors

Information

Published In

cover image ACM Computing Surveys

ACM Computing Surveys Volume 56, Issue 5

May 2024

1019 pages

EISSN:1557-7341

DOI:10.1145/3613598

Editor:
Albert Zomaya
University of Sydney, Australia

Issue’s Table of Contents

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].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 January 2024

Online AM: 09 December 2023

Accepted: 01 December 2023

Revised: 16 October 2023

Received: 18 August 2022

Published in CSUR Volume 56, Issue 5

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Survey

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
1,214
Total Downloads

Downloads (Last 12 months)1,214
Downloads (Last 6 weeks)187

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

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
Xiao ZTian YPeng CLong YCai C(2025)Ghost-Weight protocol: a highly efficient blockchain consensus for IoTThe Journal of Supercomputing10.1007/s11227-024-06565-081:1Online publication date: 1-Jan-2025
https://dl.acm.org/doi/10.1007/s11227-024-06565-0
Tian SBai FShen TZhang CGong B(2024)VSSB-Raft: A Secure and Efficient Zero Trust Consensus Algorithm for BlockchainACM Transactions on Sensor Networks10.1145/361130820:2(1-22)Online publication date: 9-Jan-2024
https://dl.acm.org/doi/10.1145/3611308
Jiang XShi QMiao HCao WHe HChen SYang J(2024)Credible Link Flooding Attack Detection and Mitigation: A Blockchain-Based ApproachIEEE Transactions on Network and Service Management10.1109/TNSM.2024.335766021:3(3537-3554)Online publication date: Jun-2024
https://doi.org/10.1109/TNSM.2024.3357660
Duan JWang WWang LGu L(2024) Controlled Redactable Blockchain Based on T -Times Chameleon Hash and Signature IEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.343692519(7560-7572)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3436925
Liu XZheng ZWang WXu HXiao FLi K(2024)Towards Cost-Effective and Robust Packaging in Multi-Leader BFT Blockchain SystemsIEEE Transactions on Computers10.1109/TC.2024.339851073:11(2590-2604)Online publication date: Nov-2024
https://doi.org/10.1109/TC.2024.3398510
Nischwitz MEsche MTschorsch F(2024)StarReact: Detecting Important Network Changes in BFT Protocols with Star-Based Communication2024 IEEE 49th Conference on Local Computer Networks (LCN)10.1109/LCN60385.2024.10639767(1-7)Online publication date: 8-Oct-2024
https://doi.org/10.1109/LCN60385.2024.10639767
Xiang AGao HTian YXiong JWang LPeng C(2024)H²CT: Asynchronous Distributed Key Generation With High-Computational Efficiency and Threshold Security in Blockchain NetworkIEEE Internet of Things Journal10.1109/JIOT.2024.343155411:20(33758-33772)Online publication date: 15-Oct-2024
https://doi.org/10.1109/JIOT.2024.3431554
Zhai DLiu JZhang TWang JDu HLiu TWang TZhang CKang JNiyato D(2024)EPDB: An Efficient and Privacy-Preserving Electric Charging Scheme in Internet of Robotic ThingsIEEE Internet of Things Journal10.1109/JIOT.2024.342653611:20(32464-32477)Online publication date: 15-Oct-2024
https://doi.org/10.1109/JIOT.2024.3426536
Zhang GPan FTijanic SJacobsen H(2024)PrestigeBFT: Revolutionizing View Changes in BFT Consensus Algorithms with Reputation Mechanisms2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00156(1930-1943)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00156
Show More Cited By

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.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Full Text

View this article in Full Text.

Media

Figures

Other

Tables

View full text|Download PDF

View Issue’s Table of Contents