The DOI matches its Crossref record; 64 of the 64 references it cites were found in a registry or an index.
A Survey of Distributed Consensus Protocols for Blockchain Networks
Open accessAbstract
Since the inception of Bitcoin, cryptocurrencies and the underlying blockchain technology have attracted an increasing interest from both academia and industry. Among various core components, consensus protocol is the defining technology behind the security and performance of blockchain. From incremental modifications of Nakamoto consensus protocol to innovative alternative consensus mechanisms, many consensus protocols have been proposed to improve the performance of the blockchain network itself or to accommodate other specific application needs. In this survey, we present a comprehensive review and analysis on the state-of-the-art blockchain consensus protocols. To facilitate the discussion of our analysis, we first introduce the key definitions and relevant results in the classic theory of fault tolerance which help to lay the foundation for further discussion. We identify five core components of a blockchain consensus protocol, namely, block proposal, block validation, information propagation, block finalization, and incentive mechanism. A wide spectrum of blockchain consensus protocols are then carefully reviewed accompanied by algorithmic abstractions and vulnerability analyses. The surveyed consensus protocols are analyzed using the five-component framework and compared with respect to different performance metrics. These analyses and comparisons provide us new insights in the fundamental differences of various proposals in terms of their suitable application scenarios, key assumptions, expected fault tolerance, scalability, drawbacks and trade-offs. We believe this survey will provide blockchain developers and researchers a comprehensive view on the state-of-the-art consensus protocols and facilitate the process of designing future protocols.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
Hyperledger fabric: a distributed operating system for permissioned blockchains
Androulaki, E., Barger, A., Bortnikov, V., Cachin, C., Christidis, K., De Caro, A., Enyeart, D., Ferris, C., Laventman, G., Manevich, Y., et al. (2018) · Proceedings of the Thirteenth EuroSys Conference · doi:10.1145/3190508.3190538 · Cited by 3,654
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
Unreliable failure detectors for reliable distributed systems
Chandra, T. D., & Toueg, S. (1996) · Journal of the ACM · doi:10.1145/226643.226647 · Cited by 2,513
Implementing fault-tolerant services using the state machine approach: a tutorial
Schneider, F. B. (1990) · ACM Computing Surveys · doi:10.1145/98163.98167 · Cited by 2,387
Reaching Agreement in the Presence of Faults
Pease, M., Shostak, R., & Lamport, L. (1980) · Journal of the ACM · doi:10.1145/322186.322188 · Cited by 2,359
A Digital Signature Based on a Conventional Encryption Function
Merkle, R. C. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2_32 · Cited by 1,998
Zerocash: Decentralized Anonymous Payments from Bitcoin
Ben Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., & Virza, M. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.36 · Cited by 1,925
Consensus in the presence of partial synchrony
Dwork, C., Lynch, N., & Stockmeyer, L. (1988) · Journal of the ACM · doi:10.1145/42282.42283 · Cited by 1,909
Pors: proofs of retrievability for large files
Juels, A., & Kaliski, B. S. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315317 · Cited by 1,894
On the Security and Performance of Proof of Work Blockchains
Gervais, A., Karame, G. O., Wüst, K., Glykantzis, V., Ritzdorf, H., & Capkun, S. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978341 · Cited by 1,646
Algorand: Scaling Byzantine Agreements for Cryptocurrencies
Gilad, Y., Hemo, R., Micali, S., Vlachos, G., & Zeldovich, N. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132757 · Cited by 1,499
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol
Kiayias, A., Russell, A., David, B., & Oliynykov, R. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63688-7_12 · Cited by 1,459
Majority Is Not Enough: Bitcoin Mining Is Vulnerable
Eyal, I., & Sirer, E. G. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-45472-5_28 · Cited by 1,375
The Bitcoin Backbone Protocol: Analysis and Applications
Garay, J., Kiayias, A., & Leonardos, N. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46803-6_10 · Cited by 1,366
Information propagation in the Bitcoin network
Decker, C., & Wattenhofer, R. (2013) · IEEE P2P 2013 Proceedings · doi:10.1109/p2p.2013.6688704 · Cited by 1,192
On Scaling Decentralized Blockchains: (A Position Paper)
Croman, K., Decker, C., Eyal, I., Gencer, A. E., Juels, A., Kosba, A., Miller, A., Saxena, P., Shi, E., Gün Sirer, E., et al. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53357-4_8 · Cited by 1,165
The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication
Vukolić, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-39028-4_9 · Cited by 1,051 · cited 5×
“In summary, This paradigm shift has brought the design and analysis of blockchain consensus protocols into formal scientific research, echoing Cachin and Vukolić [19] that blockchain design should follow the rigor established by prevailing wisdom.”
BackgroundResultInfluentialAlpern, B., & Schneider, F. B. (1985) · Information Processing Letters · doi:10.1016/0020-0190(85)90056-0 · Cited by 1,038
A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks
Wang, W., Hoang, D. T., Hu, P., Xiong, Z., Niyato, D., Wang, P., Wen, Y., & Kim, D. I. (2019) · IEEE Access · doi:10.1109/access.2019.2896108 · Cited by 995
The random oracle methodology, revisited
Canetti, R., Goldreich, O., & Halevi, S. (2004) · Journal of the ACM · doi:10.1145/1008731.1008734 · Cited by 978
Wust, K., & Gervais, A. (2018) · 2018 Crypto Valley Conference on Blockchain Technology (CVCBT) · doi:10.1109/cvcbt.2018.00011 · Cited by 975
Verifiable secret sharing and multiparty protocols with honest majority
Rabin, T., & Ben-Or, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73014 · Cited by 930
The Honey Badger of BFT Protocols
Miller, A., Xia, Y., Croman, K., Shi, E., & Song, D. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978399 · Cited by 810
Micali, S., Rabin, M., & Vadhan, S. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814584 · Cited by 716
Secure High-Rate Transaction Processing in Bitcoin
Sompolinsky, Y., & Zohar, A. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-47854-7_32 · Cited by 693
Foreshadow: Extracting the keys to the Intel SGX kingdom with transient out-of-order execution
Bulck, J. V., Minkin, M., Weisse, O., Genkin, D., Kasikci, B., Piessens, F., Silberstein, M., Wenisch, T. F., Yarom, Y., & Strackx, R. (2018) · Lirias (KU Leuven) · Cited by 667
Proof of activity: Extending bitcoin’s proof of work via proof of stake [extended abstract] y
Bentov, I., Lee, C., Mizrahi, A., & Rosenfeld, M. (2014) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/2695533.2695545 · Cited by 592
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
Ben-Or, M. (1983) · Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83 · doi:10.1145/800221.806707 · Cited by 590
Rabin, M. O. (1983) · 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) · doi:10.1109/sfcs.1983.48 · Cited by 589
Attiya, H., & Welch, J. (2004) · Wiley eBooks · doi:10.1002/0471478210 · Cited by 582
Total order broadcast and multicast algorithms: Taxonomy and survey
Défago, X., Schiper, A., & Urbán, P. (2004) · ACM Computing Surveys · doi:10.1145/1041680.1041682 · Cited by 543
Asynchronous consensus and broadcast protocols
Bracha, G., & Toueg, S. (1985) · Journal of the ACM · doi:10.1145/4221.214134 · Cited by 513
A Vademecum on Blockchain Technologies: When, Which, and How
Belotti, M., Bozic, N., Pujolle, G., & Secci, S. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2928178 · Cited by 498
Asynchronous Byzantine agreement protocols
Bracha, G. (1987) · Information and Computation · doi:10.1016/0890-5401(87)90054-x · Cited by 440
Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain
David, B., Gaži, P., Kiayias, A., & Russell, A. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-78375-8_3 · Cited by 430
Do the Rich Get Richer? An Empirical Analysis of the Bitcoin Transaction Network
Kondor, D., Pósfai, M., Csabai, I., & Vattay, G. (2014) · PLoS ONE · doi:10.1371/journal.pone.0086197 · Cited by 416
Decentralization in Bitcoin and Ethereum Networks
Gencer, A. E., Basu, S., Eyal, I., van Renesse, R., & Sirer, E. G. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-58387-6_24 · Cited by 374
Secure and Efficient Asynchronous Broadcast Protocols
Cachin, C., Kursawe, K., Petzold, F., & Shoup, V. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_31 · Cited by 371
Cryptocurrencies Without Proof of Work
Bentov, I., Gabizon, A., & Mizrahi, A. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53357-4_10 · Cited by 343
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
Lamport, L. (1984) · ACM Transactions on Programming Languages and Systems · doi:10.1145/2993.2994 · Cited by 335
Permacoin: Repurposing Bitcoin Work for Data Preservation
Miller, A., Juels, A., Shi, E., Parno, B., & Katz, J. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.37 · Cited by 310
Fast asynchronous Byzantine agreement with optimal resilience
Canetti, R., & Rabin, T. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167105 · Cited by 309
Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing
Kokoris-Kogias, E., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., & Ford, B. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.06997 · Cited by 309
FruitChains: A Fair Blockchain
Pass, R., & Shi, E. (2017) · Proceedings of the ACM Symposium on Principles of Distributed Computing · doi:10.1145/3087801.3087809 · Cited by 307
An asynchronous [(n - 1)/3]-resilient consensus protocol
Bracha, G. (1984) · Proceedings of the third annual ACM symposium on Principles of distributed computing - PODC '84 · doi:10.1145/800222.806743 · Cited by 293
Martin, J.-P., & Alvisi, L. (2006) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2006.35 · Cited by 280
Securing threshold cryptosystems against chosen ciphertext attack
Shoup, V., & Gennaro, R. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054113 · Cited by 257
Securing Proof-of-Stake Blockchain Protocols
Li, W., Andreina, S., Bohli, J.-M., & Karame, G. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-67816-0_17 · Cited by 252
Keeping Authorities "Honest or Bust" with Decentralized Witness Cosigning
Syta, E., Tamas, I., Visher, D., Wolinsky, D. I., Jovanovic, P., Gasser, L., Gailly, N., Khoffi, I., & Ford, B. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.38 · Cited by 244
Bitcoin meets strong consistency
Decker, C., Seidel, J., & Wattenhofer, R. (2016) · Proceedings of the 17th International Conference on Distributed Computing and Networking · doi:10.1145/2833312.2833321 · Cited by 224
Fault-scalable Byzantine fault-tolerant services
Abd-El-Malek, M., Ganger, G. R., Goodson, G. R., Reiter, M. K., & Wylie, J. J. (2005) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/1095810.1095817 · Cited by 220
Guerraoui, R., Knežević, N., Quéma, V., & Vukolić, M. (2010) · Proceedings of the 5th European conference on Computer systems · doi:10.1145/1755913.1755950 · Cited by 219
BEAT: Asynchronous BFT Made Practical
Duan, S., Reiter, M. K., & Zhang, H. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243812 · Cited by 198
Zyzzyva: speculative byzantine fault tolerance
Kotla, R., Alvisi, L., Dahlin, M., Clement, A., & Wong, E. L. (2007) · ACM SIGOPS Operating Systems Review · doi:10.1145/1323293.1294267 · Cited by 183
Pass, R., & Shi, E. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70697-9_14 · Cited by 168
A secure group membership protocol
Reiter, M. K. (1996) · IEEE Transactions on Software Engineering · doi:10.1109/32.481515 · Cited by 156
Signature-free asynchronous byzantine consensus with t < n/3 and o(n 2 ) messages
Mostéfaoui, A., Moumen, H., & Raynal, M. (2014) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/2611462.2611468 · Cited by 121
Asynchronous Veri.able Information Dispersal
Cachin, C., & Tessaro, S. (2006) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/reldis.2005.9 · Cited by 118
Distributed Consensus Protocols and Algorithms
Xiao, Y., Zhang, N., Li, J., Lou, W., & Hou, Y. T. (2019) · Wiley eBooks · doi:10.1002/9781119519621.ch2 · Cited by 94
Self-citationScalable BFT Consensus Mechanism Through Aggregated Signature Gossip
Long, J., & Wei, R. (2019) · IEEE International Conference on Blockchain and Cryptocurrency (ICBC) · doi:10.1109/bloc.2019.8751327 · Cited by 14
Cited by
Blockchain without waste: Proof-of-stake
Saleh, F. (2021) · The Review of Financial Studies · doi:10.1093/rfs/hhaa075 · Cited by 825
A Survey on Blockchain Technology: Evolution, Architecture and Security
Bhutta, M. N. M., Khwaja, A. A., Nadeem, A., Ahmad, H. F., Khan, M. K., Hanif, M. A., Song, H., Alshamari, M., & Cao, Y. (2021) · IEEE Access · doi:10.1109/access.2021.3072849 · Cited by 522
A Comprehensive Review of Blockchain Consensus Mechanisms
Lashkari, B., & Musilek, P. (2021) · IEEE Access · doi:10.1109/access.2021.3065880 · Cited by 499
Bhuiyan, M. N., Rahman, M. M., Billah, M. M., & Saha, D. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3062630 · Cited by 490
Blockchain-based food supply chain traceability: a case study in the dairy sector
Casino, F., Kanakaris, V., Dasaklis, T. K., Moschuris, S., Stachtiaris, S., Pagoni, M., & Rachaniotis, N. P. (2021) · International Journal of Production Research · doi:10.1080/00207543.2020.1789238 · Cited by 414
Metadata
- Authors
- Xiao, Y., Zhang, N., Lou, W., & Hou, Y. T.
- Venue
- IEEE Communications Surveys & Tutorials
- Published
- 2020
- Volume
- 22
- Issue
- 2
- Pages
- 1432-1465
- ISSN
- 1553-877X (ISSN-L)
- 2373-745X
- OpenAlex
- W2926987861
- Cited by
- 841
- References
- 64
- FWCI
- 109.95
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.