Cited By
View all- Bai FLi FShen TZeng KZhang XZhang C(2024)RaBFT: an improved Byzantine fault tolerance consensus algorithm based on raftThe Journal of Supercomputing10.1007/s11227-024-06284-680:14(21533-21560)Online publication date: 12-Jun-2024
A Raft Algorithm with Byzantine Fault-Tolerant Performance
Authors: 
Ting Xie, Xiaofeng LiuAuthors Info & Claims
Ting Xie, Xiaofeng LiuAuthors Info & ClaimsPages 95 - 99
Abstract
In view of the disadvantage that Raft algorithm does not have byzantine fault tolerance, this paper improves Raft algorithm and proposes a Raft algorithm with Byzantine fault tolerance – NRaft algorithm. First, NRaft algorithm uses the Shamir threshold secret sharing algorithm to solve the log tampering and information quantity fraud in Byzantine nodes; second, RSA encryption algorithm is used to further ensure the integrity of logs. Finally, the experimental data show that NRaft algorithm outperforms PBFT algorithm as the number of nodes increases. Therefore, the NRaft algorithm is not only suitable for environmentally secure private blockchain, but also for consortium blockchain where Byzantine nodes exist.
References
[1]
Nakamoto S. Bitcoin: A peer-to-peer electronic cash system[J]. Decentralized Business Review, 2008: 21260.
[2]
Buterin V. A next-generation smart contract and decentralized application platform[J]. white paper, 2014, 3(37): 2-1.
[3]
Chenpei Wang. Dynamic Improved PBFT algorithm based on credit coefficient [J]. Electronic Production, 2019, 8.
[4]
Jakobsson M, Juels A. Proofs of work and bread pudding protocols[M]//Secure information networks. Springer, Boston, MA, 1999: 258-272.
[5]
King S, Nadal S. Ppcoin: Peer-to-peer crypto-currency with proof-of-stake[J]. self-published paper, August, 2012, 19(1).
[6]
Liu W, Li Y, Wang X, A donation tracing blockchain model using improved DPoS consensus algorithm[J]. Peer-to-Peer Networking and Applications, 2021, 14(5): 2789-2800.
[7]
Castro M, Liskov B. Practical byzantine fault tolerance[C]//OsDI. 1999, 99(1999): 173-186.
[8]
Ongaro D, Ousterhout J. In search of an understandable consensus algorithm[C]//2014 USENIX Annual Technical Conference (Usenix ATC 14). 2014: 305-319.
[9]
Lamport L. Paxos made simple[J]. ACM SIGACT News (Distributed Computing Column) 32, 4 (Whole Number 121, December 2001), 2001: 51-58.
[10]
Chun Zeng, Wen Shen, Yingjie Fan, Application of digital copyright protection scheme based on block chain in the construction of city-level finance media platform of "Beijing Cloud" [J]. Cable TV Technology, 2019, 9.
[11]
Xiaoqiang Zhu, Minghui Zheng, Yixuan Qiao, A consensus algorithm based on verifiable Secret Sharing in blockchain [J]. Journal of South-Central University for Nationalities, 2022, 41(2): 215-221.
[12]
Chun Zeng, Wen Shen, Yingjie Fan, Cao Yang. Application of digital copyright protection scheme based on block chain in the construction of "Beijing Cloud" city-level finance media platform [J]. Cable TV technology, 2019 (10) : 22. / j.carol carroll nki catvtec. 2019.10.008.
[13]
Jie Peng. (T, N) Threshold Secret sharing Scheme Research [D]. Henan Normal University,2018.
[14]
Shamir A. How to share a secret[J]. Communications of the ACM, 1979, 22(11): 612-613.
[15]
Yu Wang, Ming Zhu, Yan Xia. Application research of asymmetric encryption algorithm in identity authentication [J]. Computer technology and development,2020,30(01):94-98.
[16]
Rivest R L, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems[J]. Communications of the ACM, 1978, 21(2): 120-126.
Index Terms
- A Raft Algorithm with Byzantine Fault-Tolerant Performance
Recommendations
Blockchain-enabled resilient Byzantine fault tolerance consensus mechanism for supply chain management
A blockchain is a shared ledger that keeps track of all the transactions in a network. This evolving technology plays a major role in enhancing smart city services, including food tracking and supply-demand synchronisation. We proposed a smarter ...
A novel Raft consensus algorithm combining comprehensive evaluation partitioning and Byzantine fault tolerance
AbstractCurrently, Raft, as an mainstream consensus mechanism, has received widespread attention. Partition consensus can reduce the number of nodes involved in a single consensus and improve consensus efficiency. However, existing algorithms suffer from ...
Multi-Threshold Byzantine Fault Tolerance
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications SecurityClassic Byzantine fault tolerant (BFT) protocols are designed for a specific timing model, most often one of the following: synchronous, asynchronous or partially synchronous. It is well known that the timing model and fault tolerance threshold present ...
Comments
Information & Contributors
Information
Published In
August 2022
188 pages
ISBN:9781450396837
DOI:10.1145/3561877
Copyright © 2022 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 ACM 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: 20 November 2022
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ICISS 2022
ICISS 2022: 2022 the 5th International Conference on Information Science and Systems
August 26 - 28, 2022
Beijing, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 78Total Downloads
- Downloads (Last 12 months)26
- Downloads (Last 6 weeks)1
Reflects downloads up to 08 Feb 2025
Other Metrics
Citations
Cited By
View all- Bai FLi FShen TZeng KZhang XZhang C(2024)RaBFT: an improved Byzantine fault tolerance consensus algorithm based on raftThe Journal of Supercomputing10.1007/s11227-024-06284-680:14(21533-21560)Online publication date: 12-Jun-2024
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format