CoChat
Sign Up
Cited by 90Distributed systems and fault toleranceBlockchain Technology Applications and SecurityDistributed Control Multi-Agent Systems

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Byzantine Fault-Tolerant Consensus Algorithms: A Survey

Open access
Zhong, Weiyu, Yang, Ce, Liang, Wei, Cai, Jiahong, Chen, Lin, Liao, Jing, Xiong, Naixue·2023·Electronics
DOI 10.3390/electronics12183801
Open this paper in CoChat — free accountOpen PDF

Abstract

The emergence of numerous consensus algorithms for distributed systems has resulted from the swift advancement of blockchain and its related technologies. Consensus algorithms play a key role in decentralized distributed systems, because all nodes in the system need to reach a consensus on requests or commands through consensus algorithms. In a distributed system where nodes work together to reach consensus, there may be Byzantine nodes present. The emergence of Byzantine nodes will affect the consensus of nodes in the distributed system. Therefore, tolerating Byzantine nodes in a distributed system and then reaching a consensus is an essential function of a consensus algorithm. So far, many Byzantine fault-tolerant (BFT) consensus algorithms have emerged, and there are correspondingly many methods to improve the performance of these algorithms. In order to allow researchers to have a clearer understanding of the existing methods, this paper systematically investigated and studied the research progress of the current Byzantine fault-tolerant consensus algorithm. The scope of the research ranged from the classic Byzantine consensus algorithm to some of the latest Byzantine consensus algorithms. The articles were classified according to the methods used to improve the Byzantine consensus algorithm. Through classification and centralized analysis and discussion, we achieved a clearer understanding of the development of Byzantine consensus algorithms and, at the same time, clarified the advantages and disadvantages of this type of method and the latest research progress using this method. At the end of this article, an in-depth discussion and analysis is also presented. By analyzing the impact of the use of these methods on the performance of the BFT consensus algorithm, it is proposed that future research can be improved.

Overview

Integrity signals

Registry

Crossref · 10.3390/electronics12183801

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 113

  1. Sherman, 2019, On the origins and variations of blockchain technologies, IEEE Secur. Priv., 17, 72, 10.1109/MSEC.2019.2893730 · DOI
  2. Ante, 2021, Smart contracts on the blockchain—A bibliometric analysis and review, Telemat. Inform., 57, 101519, 10.1016/j.tele.2020.101519 · DOI
  3. Yin, 2022, SmartDID: A novel privacy-preserving identity based on blockchain for IoT, IEEE Internet Things J., 10, 6718, 10.1109/JIOT.2022.3145089 · DOI
  4. Liang, 2022, PDPChain: A consortium blockchain-based privacy protection scheme for personal data, IEEE Trans. Reliab., 72, 586, 10.1109/TR.2022.3190932 · DOI
  5. Fu, 2022, BFS: A blockchain-based financing scheme for logistics company in supply chain finance, Connect. Sci., 34, 1929, 10.1080/09540091.2022.2088698 · DOI
  6. Wang, 2020, Blockchain for the IoT and industrial IoT: A review, Internet Things, 10, 100081, 10.1016/j.iot.2019.100081 · DOI
  7. Hu, 2020, MDFC–ResNet: An agricultural IoT system to accurately recognize crop diseases, IEEE Access, 8, 115287, 10.1109/ACCESS.2020.3001237 · DOI
  8. Xu, 2021, A blockchain-based roadside unit-assisted authentication and key agreement protocol for internet of vehicles, J. Parallel Distrib. Comput., 149, 29, 10.1016/j.jpdc.2020.11.003 · DOI
  9. Qu, 2022, Blockchain in medical informatics, J. Ind. Inf. Integr., 25, 100258
  10. Kassen, 2022, Blockchain and e-government innovation: Automation of public information processes, Inf. Syst., 103, 101862, 10.1016/j.is.2021.101862 · DOI
  11. Pandey, 2022, Blockchain technology in food supply chains: Review and bibliometric analysis, Technol. Soc., 69, 101954, 10.1016/j.techsoc.2022.101954 · DOI
  12. Belchior, 2021, A Survey on Blockchain Interoperability: Past, Present, and Future Trends, ACM Comput. Surv., 54, 1, 10.1145/3471140 · DOI
  13. Schneider, 2004, Chain Replication for Supporting High Throughput and Availability, OSDI, 4, 91
  14. Sang, Y., Shen, H., Tan, Y., and Xiong, N. (2006, January 4–7). Efficient protocols for privacy preserving matching against distributed datasets. Proceedings of the Information and Communications Security: 8th International Conference, ICICS 2006, Raleigh, NC, USA. · DOI
  15. Ongaro, D., and Ousterhout, J. (2014, January 19–20). In search of an understandable consensus algorithm. Proceedings of the 2014 USENIX Annual Technical Conference (USENIX ATC 14), Philadelphia, PA, USA.
  16. Yang, Y., Xiong, N., Chong, N.Y., and Defago, X. (2008, January 25–28). A decentralized and adaptive flocking algorithm for autonomous mobile robots. Proceedings of the 2008 The 3rd International Conference on Grid and Pervasive Computing-Workshops, Kunming, China. · DOI
  17. Xiong, N., Vasilakos, A.V., Wu, J., Yang, Y.R., Rindos, A., Zhou, Y., Song, W.Z., and Pan, Y. (2012, January 21–25). A self-tuning failure detection scheme for cloud computing service. Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium, Shanghai, China. · DOI
  18. Guru, A., Mohanta, B.K., Mohapatra, H., Al-Turjman, F., Altrjman, C., and Yadav, A. (2023). A Survey on Consensus Protocols and Attacks on Blockchain Technology. Appl. Sci., 13. · DOI
  19. Zhou, S., Li, K., Xiao, L., Cai, J., Liang, W., and Castiglione, A. (2023). A Systematic Review of Consensus Mechanisms in Blockchain. Mathematics, 11. · DOI
  20. Sayeed, S., and Marco-Gisbert, H. (2019). Assessing blockchain consensus and security mechanisms against the 51% attack. Appl. Sci., 9. · DOI
  21. Nguyen, 2018, A survey about consensus algorithms used in blockchain, J. Inf. Process. Syst., 14, 101
  22. Pease, 1980, Reaching agreement in the presence of faults, J. ACM, 27, 228, 10.1145/322186.322188 · DOI
  23. Lamport, L. (2019). Concurrency: The Works of Leslie Lamport, ACM Books.
  24. Lamport, L., Shostak, R., and Pease, M. (2019). Concurrency: The Works of Leslie Lamport, ACM Books.
  25. Wang, 2012, A novel dynamic network data replication scheme based on historical access record and proactive deletion, J. Supercomput., 62, 227, 10.1007/s11227-011-0708-z · DOI
  26. Zhang, G., Pan, F., Dang’ana, M., Mao, Y., Motepalli, S., Zhang, S., and Jacobsen, H.A. (2022). Reaching consensus in the byzantine empire: A comprehensive review of bft consensus algorithms. arXiv.
  27. Wensley, 1978, SIFT: Design and analysis of a fault-tolerant computer for aircraft control, Proc. IEEE, 66, 1240, 10.1109/PROC.1978.11114 · DOI
  28. Hopkins, A.L., Lala, J.H., and Smith, T.B. (1987). The Evolution of Fault-Tolerant Computing: In the Honor of William C. Carter, Springer.
  29. Driscoll, K. (November, January 31). Multi-Microprocessor Flight Control System, 1982. Proceedings of the 5th Digital Avionics Systems Conference, Seattle, WA, USA.
  30. Castro, 1999, Practical byzantine fault tolerance, OsDI, 99, 173
  31. Lamport, L. (2019). Concurrency: The Works of Leslie Lamport, ACM Books.
  32. Zhou, 2012, A bare-metal and asymmetric partitioning approach to client virtualization, IEEE Trans. Serv. Comput., 7, 40, 10.1109/TSC.2012.32 · DOI
  33. Thai, 2019, Hierarchical Byzantine fault-tolerance protocol for permissioned blockchain systems, J. Supercomput., 75, 7337, 10.1007/s11227-019-02939-x · DOI
  34. Wang, H., and Guo, K. (2019, January 17–19). Byzantine fault tolerant algorithm based on vote. Proceedings of the 2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), Guilin, China. · DOI
  35. Yu, G., Wu, B., and Niu, X. (2020, January 20–22). Improved blockchain consensus mechanism based on PBFT algorithm. Proceedings of the 2020 2nd International Conference on Advances in Computer Technology, Information Science and Communications (CTISC), Suzhou, China. · DOI
  36. Zhang, Z., Zhu, D., and Fan, W. (2020–1, January 29). Qpbft: Practical byzantine fault tolerance consensus algorithm based on quantified-role. Proceedings of the 2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), Guangzhou, China. · DOI
  37. Gupta, S., Rahnama, S., Hellings, J., and Sadoghi, M. (2020). Resilientdb: Global scale resilient blockchain fabric. arXiv. · DOI
  38. Chen, 2022, An improved algorithm for practical byzantine fault tolerance to large-scale consortium chain, Inf. Process. Manag., 59, 102884, 10.1016/j.ipm.2022.102884 · DOI
  39. Xiang, 2019, Proof of previous transactions (PoPT): An efficient approach to consensus for JCLedger, IEEE Trans. Syst. Man Cybern. Syst., 51, 2415, 10.1109/TSMC.2019.2913007 · DOI
  40. Li, F., Liu, K., Liu, J., Fan, Y., and Wang, S. (2020, January 18–20). DHBFT: Dynamic hierarchical Byzantine fault-tolerant consensus mechanism based on credit. Proceedings of the Web and Big Data: 4th International Joint Conference, APWeb-WAIM 2020, Tianjin, China. · DOI
  41. Zhan, 2021, DRBFT: Delegated randomization Byzantine fault tolerance consensus protocol for blockchains, Inf. Sci., 559, 8, 10.1016/j.ins.2020.12.077 · DOI
  42. Li, 2021, Lightweight blockchain consensus mechanism and storage optimization for resource-constrained IoT devices, Inf. Process. Manag., 58, 102602, 10.1016/j.ipm.2021.102602 · DOI
  43. Decker, C., Seidel, J., and Wattenhofer, R. (2016, January 4–7). Bitcoin meets strong consistency. Proceedings of the 17th International Conference on Distributed Computing and Networking, Singapore. · DOI
  44. Amir, 2008, Steward: Scaling byzantine fault-tolerant replication to wide area networks, IEEE Trans. Dependable Secur. Comput., 7, 80, 10.1109/TDSC.2008.53 · DOI
  45. Lamport, L., and Massa, M. (July, January 28). Cheap paxos. Proceedings of the International Conference on Dependable Systems and Networks, Florence, Italy.
  46. Zeng, 2010, Connectivity and coverage maintenance in wireless sensor networks, J. Supercomput., 52, 23, 10.1007/s11227-009-0268-7 · DOI
  47. Yang, 2011, A fingerprint recognition scheme based on assembling invariant moments for cloud computing communications, IEEE Syst. J., 5, 574, 10.1109/JSYST.2011.2165600 · DOI
  48. Wu, 2019, UAV autonomous target search based on deep reinforcement learning in complex disaster scene, IEEE Access, 7, 117227, 10.1109/ACCESS.2019.2933002 · DOI
  49. Qi, 2023, Practical Byzantine fault tolerance consensus based on comprehensive reputation, Peer Peer Netw. Appl., 16, 420, 10.1007/s12083-022-01408-2 · DOI
  50. Wu, 2022, A privacy-preserving and efficient byzantine consensus through multi-signature with ring, Peer Peer Netw. Appl., 15, 1669, 10.1007/s12083-022-01317-4 · DOI
  51. Schnorr, 1991, Efficient signature generation by smart cards, J. Cryptol., 4, 161, 10.1007/BF00196725 · DOI
  52. Maxwell, 2019, Simple schnorr multi-signatures with applications to bitcoin, Des. Codes Cryptogr., 87, 2139, 10.1007/s10623-019-00608-x · DOI
  53. Li, 2021, An optimized byzantine fault tolerance algorithm for consortium blockchain, Peer Peer Netw. Appl., 14, 2826, 10.1007/s12083-021-01103-8 · DOI
  54. Gao, 2018, Human action monitoring for healthcare based on deep learning, IEEE Access, 6, 52277, 10.1109/ACCESS.2018.2869790 · DOI
  55. Deng, 2015, A general hybrid model for chaos robust synchronization and degradation reduction, Inf. Sci., 305, 146, 10.1016/j.ins.2015.01.028 · DOI
  56. Pass, R., and Shi, E. (May, January 29). Thunderella: Blockchains with optimistic instant confirmation. Proceedings of the Advances in Cryptology—EUROCRYPT 2018: 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel. · DOI
  57. Luu, L., Narayanan, V., Zheng, C., Baweja, K., Gilbert, S., and Saxena, P. (2016, January 25–27). A secure sharding protocol for open blockchains. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria. · DOI
  58. Al-Bassam, M., Sonnino, A., Bano, S., Hrycyszyn, D., and Danezis, G. (2017). Chainspace: A sharded smart contracts platform. arXiv. · DOI
  59. Liu, 2020, A fair selection protocol for committee-based permissionless blockchains, Comput. Secur., 91, 101718, 10.1016/j.cose.2020.101718 · DOI
  60. Ma, F.Q., and Fan, R.N. (2022). Queuing Theory of Improved Practical Byzantine Fault Tolerant Consensus. Mathematics, 10. · DOI
  61. Fang, 2014, On the throughput-energy tradeoff for data transmission between cloud and mobile devices, Inf. Sci., 283, 79, 10.1016/j.ins.2014.06.022 · DOI
  62. Shu, 2010, Context-aware cross-layer optimized video streaming in wireless multimedia sensor networks, J. Supercomput., 54, 94, 10.1007/s11227-009-0321-6 · DOI
  63. Borran, F., and Schiper, A. (2009, January 23–25). Brief announcement: A leader-free byzantine consensus algorithm. Proceedings of the Distributed Computing: 23rd International Symposium, DISC 2009, Elche, Spain. · DOI
  64. Barcelona, C.S. (2008, January 8–10). Mencius: Building efficient replicated state machines for WANs. Proceedings of the 8th USENIX Symposium on Operating Systems Design and Implementation (OSDI 08), San Diego, CA, USA.
  65. Sandor, 2019, Efficient decentralized multi-authority attribute based encryption for mobile cloud data storage, J. Netw. Comput. Appl., 129, 25, 10.1016/j.jnca.2019.01.003 · DOI
  66. Milosevic, Z., Biely, M., and Schiper, A. (2013, January 1–3). Bounded delay in byzantine-tolerant state machine replication. Proceedings of the 2013 IEEE 32nd International Symposium on Reliable Distributed Systems, Braga, Portugal. · DOI
  67. Lin, C., He, Y.X., and Xiong, N. (2006, January 6–9). An energy-efficient dynamic power management in wireless sensor networks. Proceedings of the 2006 Fifth International Symposium on Parallel and Distributed Computing, Timisoara, Romania. · DOI
  68. Aublin, P.L., Mokhtar, S.B., and Quéma, V. (2013, January 8–11). Rbft: Redundant byzantine fault tolerance. Proceedings of the 2013 IEEE 33rd International Conference on Distributed Computing Systems, Philadelphia, PA, USA. · DOI
  69. Stathakopoulou, C., David, T., and Vukolic, M. (2019). Mir-bft: High-throughput bft for blockchains. arXiv.
  70. Junqueira, F.P., Reed, B.C., and Serafini, M. (2011, January 27–30). Zab: High-performance broadcast for primary-backup systems. Proceedings of the 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN), Hong Kong, China. · DOI
  71. Alqahtani, S., and Demirbas, M. (2021, January 28–30). Bigbft: A multileader byzantine fault tolerance protocol for high throughput. Proceedings of the 2021 IEEE International Performance, Computing, and Communications Conference (IPCCC), Austin, TX, USA. · DOI
  72. Avarikioti, Z., Heimbach, L., Schmid, R., Vanbever, L., Wattenhofer, R., and Wintermeyer, P. (2020). Fnf-bft: Exploring performance limits of BFT protocols. arXiv.
  73. Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., and Abraham, I. (August, January 29). HotStuff: BFT consensus with linearity and responsiveness. Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, Toronto, ON, Canada. · DOI
  74. Kotla, R., Alvisi, L., Dahlin, M., Clement, A., and Wong, E. (2007, January 14–17). Zyzzyva: Speculative byzantine fault tolerance. Proceedings of the Twenty-First ACM SIGOPS Symposium on Operating Systems Principles, Stevenson, DC, USA. · DOI
  75. Guerraoui, R., Knežević, N., Quéma, V., and Vukolić, M. (2010, January 13–16). The next 700 BFT protocols. Proceedings of the 5th European Conference on Computer Systems, Paris, France. · DOI
  76. Veronese, 2011, Efficient byzantine fault-tolerance, IEEE Trans. Comput., 62, 16, 10.1109/TC.2011.221 · DOI
  77. Duan, 2014, hBFT: Speculative Byzantine fault tolerance with minimum cost, IEEE Trans. Dependable Secur. Comput., 12, 58, 10.1109/TDSC.2014.2312331 · DOI
  78. Sohrabi, 2022, SAZyzz: Scaling AZyzzyva to Meet Blockchain Requirements, IEEE Trans. Serv. Comput., 16, 2139
  79. Zhang, 2021, DBFT: A Byzantine fault tolerance protocol with graceful performance degradation, IEEE Trans. Dependable Secur. Comput., 19, 3387, 10.1109/TDSC.2021.3095544 · DOI
  80. Gunn, L.J., Liu, J., Vavala, B., and Asokan, N. (2019, January 1–4). Making speculative BFT resilient with trusted monotonic counters. Proceedings of the 2019 38th Symposium on Reliable Distributed Systems (SRDS), Lyon, France. · DOI
  81. Correia, M., Neves, N.F., and Verissimo, P. (2004, January 18–20). How to tolerate half less one Byzantine nodes in practical distributed systems. Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, Florianopolis, Brazil. · DOI
  82. Kapitza, R., Behl, J., Cachin, C., Distler, T., Kuhnle, S., Mohammadi, S.V., Schröder-Preikschat, W., and Stengel, K. (2012, January 10–13). CheapBFT: Resource-efficient Byzantine fault tolerance. Proceedings of the 7th ACM European Conference on Computer Systems, Bern, Switzerland. · DOI
  83. Duan, S., Levitt, K., Meling, H., Peisert, S., and Zhang, H. (2014, January 6–9). ByzID: Byzantine fault tolerance from intrusion detection. Proceedings of the 2014 IEEE 33rd International Symposium on Reliable Distributed Systems, Nara, Japan. · DOI
  84. Liu, 2018, Scalable byzantine consensus via hardware-assisted secret sharing, IEEE Trans. Comput., 68, 139, 10.1109/TC.2018.2860009 · DOI
  85. Bailleu, M., Giantsidi, D., Gavrielatos, V., Quoc, D.L., Nagarajan, V., and Bhatotia, P. (2021, January 14–16). Avocado: A Secure In-Memory Distributed Storage System. Proceedings of the USENIX Annual Technical Conference, Virtual.
  86. Decouchant, J., Kozhaya, D., Rahli, V., and Yu, J. (2022, January 5–8). DAMYSUS: Streamlined BFT consensus leveraging trusted components. Proceedings of the Seventeenth European Conference on Computer Systems, Rennes, France. · DOI
  87. Messadi, I., Becker, M.H., Bleeke, K., Jehl, L., Mokhtar, S.B., and Kapitza, R. (2022, January 7–11). SplitBFT: Improving Byzantine Fault Tolerance Safety Using Trusted Compartments. Proceedings of the 23rd Conference on 23rd ACM/IFIP International Middleware Conference, Quebec, QC, Canada. · DOI
  88. Wang, 2022, Bft in blockchains: From protocols to use cases, ACM Comput. Surv. (CSUR), 54, 1
  89. Xie, S., Liang, W., Xu, J., Tang, M., Weng, T.H., and Li, K.C. (2018, January 8–12). A novel bidirectional RFID identity authentication protocol. Proceedings of the 2018 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI), Guangzhou, China. · DOI
  90. Zhao, 2019, An effective exponential-based trust and reputation evaluation system in wireless sensor networks, IEEE Access, 7, 33859, 10.1109/ACCESS.2019.2904544 · DOI
  91. Lynch, N.A., and Shvartsman, A.A. (1997, January 24–27). Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. Proceedings of the IEEE 27th International Symposium on Fault Tolerant Computing, Seattle, WA, USA.
  92. Yandamuri, S., Abraham, I., Nayak, K., and Reiter, M. (2021, January 4–8). Brief announcement: Communication-efficient BFT using small trusted hardware to tolerate minority corruption. Proceedings of the 35th International Symposium on Distributed Computing (DISC 2021), Freiburg, Germany.
  93. Ganger, 2005, Fault-scalable Byzantine fault-tolerant services, ACM SIGOPS Oper. Syst. Rev., 39, 59, 10.1145/1095809.1095817 · DOI
  94. Cowling, J., Myers, D., Liskov, B., Rodrigues, R., and Shrira, L. (2006, January 6–8). HQ replication: A hybrid quorum protocol for Byzantine fault tolerance. Proceedings of the 7th symposium on Operating Systems Design and Implementation, Seattle, WA, USA.
  95. Hao, X., Yu, L., Zhiqiang, L., Zhen, L., and Dawu, G. (June, January 30). Dynamic practical byzantine fault tolerance. Proceedings of the 2018 IEEE Conference on Communications and Network Security (CNS), Beijing, China. · DOI
  96. Huang, 2022, Workload-based randomization byzantine fault tolerance consensus protocol, High-Confid. Comput., 2, 100070, 10.1016/j.hcc.2022.100070 · DOI
  97. Malkhi, D., Nayak, K., and Ren, L. (2019, January 11–15). Flexible byzantine fault tolerance. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, London, UK. · DOI
  98. Buchman, E. (2016). Tendermint: Byzantine Fault Tolerance in the Age of Blockchains. [Ph.D. Thesis, University of Guelph].
  99. Miller, A., Xia, Y., Croman, K., Shi, E., and Song, D. (2016, January 24–28). The honey badger of BFT protocols. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria. · DOI
  100. Yang, L., Park, S.J., Alizadeh, M., Kannan, S., and Tse, D. (2022, January 4–6). {DispersedLedger}:{High-Throughput} Byzantine Consensus on Variable Bandwidth Networks. Proceedings of the 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22), Renton, WA, USA.
  101. Guo, B., Lu, Z., Tang, Q., Xu, J., and Zhang, Z. (2020, January 9–13). Dumbo: Faster asynchronous bft protocols. Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual. · DOI
  102. Gao, Y., Lu, Y., Lu, Z., Tang, Q., Xu, J., and Zhang, Z. (2022, January 7–11). Dumbo-ng: Fast asynchronous bft consensus with throughput-oblivious latency. Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, Los Angeles, CA, USA. · DOI
  103. Jannes, 2023, BeauForT: Robust Byzantine Fault Tolerance for Client-Centric Mobile Web Applications, IEEE Trans. Parallel Distrib. Syst., 34, 1241, 10.1109/TPDS.2023.3241963 · DOI
  104. Fischer, 1985, Impossibility of distributed consensus with one faulty process, J. ACM, 32, 374, 10.1145/3149.214121 · DOI
  105. Duan, S., Reiter, M.K., and Zhang, H. (2018, January 15–19). BEAT: Asynchronous BFT made practical. Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, Toronto, ON, Canada. · DOI
  106. Ben-Or, M., Kelmer, B., and Rabin, T. (1994, January 14–17). Asynchronous secure computations with optimal resilience. Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, CA, USA. · DOI
  107. Abraham, I., Malkhi, D., and Spiegelman, A. (August, January 29). Asymptotically optimal validated asynchronous byzantine agreement. Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, Toronto, ON, Canada. · DOI
  108. Liu, C., Duan, S., and Zhang, H. (July, January 29). Epic: Efficient asynchronous bft with adaptive security. Proceedings of the 2020 50th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), Valencia, Spain. · DOI
  109. Gągol, A., Leśniak, D., Straszak, D., and Świętek, M. (2019, January 21–23). Aleph: Efficient atomic broadcast in asynchronous networks with byzantine nodes. Proceedings of the 1st ACM Conference on Advances in Financial Technologies, Zurich, Switzerland. · DOI
  110. Keidar, I., Kokoris-Kogias, E., Naor, O., and Spiegelman, A. (2021, January 26–31). All you need is dag. Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Virtual. · DOI
  111. Guo, B., Lu, Y., Lu, Z., Tang, Q., Xu, J., and Zhang, Z. (2022). Speeding dumbo: Pushing asynchronous bft closer to practice. Cryptol. Eprint Arch., Available online: https://eprint.iacr.org/2022/027. · DOI
  112. Boneh, 2004, Short signatures from the Weil pairing, J. Cryptol., 17, 297, 10.1007/s00145-004-0314-9 · DOI
  113. Gilad, Y., Hemo, R., Micali, S., Vlachos, G., and Zeldovich, N. (2017, January 28–31). Algorand: Scaling byzantine agreements for cryptocurrencies. Proceedings of the 26th Symposium on Operating Systems Principles, Shanghai, China. · DOI · Paper page

Cited by

Sorted by citations

Metadata

Authors
Zhong, W., Yang, C., Liang, W., Cai, J., Chen, L., Liao, J., & Xiong, N.
Affiliations
Hunan University of Science and Technology (CN)
Corresponding author
Xiong, Naixue
ORCID
Venue
Electronics
Publisher
MDPI AG
Published
2023-09-08
Volume
12
Issue
18
Pages
3801
ISSN
2079-9292 (ISSN-L)
DOI
10.3390/electronics12183801
OpenAlex
W4386541372
Cited by
90
References
1
Citations by year
2026: 35 · 2025: 36 · 2024: 17 · 2023: 2
FWCI
10.01
Type
journal article
Language
en
Open access
Licence
Locations
Electronics (publishedVersion, cc-by)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Distributed systems and fault tolerance
  • Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
  • Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
Keywords
Byzantine fault tolerance, consensus algorithms, Byzantine nodes, distributed systems, blockchain, decentralized systems, fault tolerance

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