Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

VSSB-Raft: A Secure and Efficient Zero Trust Consensus Algorithm for Blockchain

Published: 09 January 2024 Publication History

Abstract

To solve the problems of vote forgery and malicious election of candidate nodes in the Raft consensus algorithm, we combine zero trust with the Raft consensus algorithm and propose a secure and efficient consensus algorithm -Verifiable Secret Sharing Byzantine Fault Tolerance Raft Consensus Algorithm (VSSB-Raft). The VSSB-Raft consensus algorithm realizes zero trust through the supervisor node and secret sharing algorithm without the invisible trust between nodes required by the algorithm. Meanwhile, the VSSB-Raft consensus algorithm uses the SM2 signature algorithm to realize the characteristics of zero trust requiring authentication before data use. In addition, by introducing the NDN network, we redesign the communication between nodes and guarantee the communication quality among nodes. The VSSB-Raft consensus algorithm proposed in this paper can make the algorithm Byzantine fault tolerant by setting a threshold for secret sharing while maintaining the algorithm’s complexity to be O(n). Experiments show that the VSSB-Raft consensus algorithm is secure and efficient with high throughput and low consensus latency.

References

[1]
S. Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. Bitcoin. 4, 2 (2008). https://bitcoin.org/bitcoin.pdf
[2]
T. T. Kuo, H. E. Kim, and L. Ohno-Machado. 2017. Blockchain distributed ledger technologies for biomedical and health care applications. Journal of the American Medical Informatics Association 24, 6 (2017), 1211–1220.
[3]
T. T. Kuo, H. Rojas Zavaleta, and L. Ohno-Machado. 2019. Comparison of blockchain platforms: A systematic review and healthcare examples. Journal of the American Medical Informatics Association 26, 5 (2019), 462–478.
[4]
H. Yi, W. Lin, X. Huang, X. Cai, R. Chi, and Z. Nie. 2021. Energy trading IoT system based on blockchain. Swarm and Evolutionary Computation. 64 2021, 100891.
[5]
S. Hati, D. De, and A. Mukherjee. 2022. DewBCity: Blockchain network-based dew-cloud modeling for distributed and decentralized smart cities. The Journal of Supercomputing 2022, 1–21.
[6]
N. U. Hassan, C. Yuen, and D. Niyato. 2019. Blockchain technologies for smart energy systems: Fundamentals, challenges, and solutions. IEEE Industrial Electronics Magazine 13, 4 (2019), 106–118.
[7]
X. Shen, S. Chen, Z. Yan, J. Ping, and B. Luo. 2021. Analysis on value application scenarios and applicability of blockchain in energy industry. Automation of Electric Power Systems 45, 5 (2021), 18–29.
[8]
M. Castro and B. Liskov. 1999. Practical Byzantine fault tolerance. OsDI. 99 (1999), 173–186.
[9]
D. Ongaro and J. Ousterhout. 2014. In search of an understandable consensus algorithm. 2014 USENIX Annual Technical Conference (USENIXATC 14). 305–319.
[10]
F. Song, Y. T. Zhou, Y. Wang, T. M. Zhao, I. You, and H. K. Zhang. 2019. Smart collaborative distribution for privacy enhancement in moving target defense. Information Sciences, 479 (2019), 593–606.
[11]
F. Song, Z. Ai, H. Zhang, I. You, and S. Li. 2020. Smart collaborative balancing for dependable network components in cyber-physical systems. IEEE Transactions on Industrial Informatics 17, 10 (2020), 6916–6924.
[12]
Y. Chen, P. Liu, and W. Zhang. 2020. Raft consensus algorithm based on credit model in consortium blockchain. Wuhan University Journal of Natural Sciences 2, 8 (2020).
[13]
Y. Wang, S. Li, L. Xu, and L. Xu. 2021. Improved raft consensus algorithm in high real-time and highly adversarial environment. Web Information Systems and Applications: 18th International Conference, WISA 2021, Kaifeng, China, September 24–26, 2021, Proceedings 18. Springer International Publishing, 718–726.
[14]
S. Tian, Y. Liu, Y. Zhang, and Y. Zhao. 2021. A Byzantine fault-tolerant raft algorithm combined with Schnorr signature. 2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM). IEEE, 1–5.
[15]
Z. D. Wang and Q. Li. 2023. A practical Byzantine fault-tolerant consensus algorithm based on Raft algorithm improvement. Computer Applications 43, 1 (2023), 122.
[16]
V. A. Stafford. 2020. Zero Trust Architecture. NIST special publication, Vol. 800, 207.
[17]
J. Y. Feng, T. T. Yu, Z. Y. Wang, W. B. Zhang, G. Han, and W. H. Huang. 2022. An edge-zero trust model for resisting the threat of lost terminals in power IoT scenarios. Computer Research and Development 59, 5 (2022), 1120–1132.
[18]
Z. Du, J. Gong, and H. Qian. 2022. LBFT: An asynchronous committee-based blockchain storage strategy on zero trust model. Applied Sciences 12, 22 (2022), 11790.
[19]
J. Wang, J. Chen, N. Xiong, O. Alfarraj, A. Tolba, and Y. Ren. 2022. S-BDS: An effective blockchain-based data storage scheme in zero-trust IoT. ACM Transactions on Internet Technology.
[20]
J. H. Seo. 2020. Efficient digital signatures from RSA without random oracles. Information Sciences, 512 (2020), 471–480.
[21]
T. Xia and J. He. 2022. An identity authentication scheme based on SM2 algorithm in UAV communication network. Wireless Communications & Mobile Computing (Online).
[22]
G. R. Blakley. 1979. Safeguarding cryptographic keys. Managing Requirements Knowledge, International Workshop on. IEEE Computer Society, (1979), 313–313.
[23]
Y. Kim, R. K. Raman, Y. S. Kim, L. R. Varshney, and N. R. Shanbhag. 2018. Efficient local secret sharing for distributed blockchain systems. IEEE Communications Letters 23, 2 (2018), 282–285.
[24]
H. Dai, B. Liu, Y. Chen, and Y. Wang. 2012. On pending interest table in named data networking. Proceedings of the Eighth ACM/IEEE Symposium on Architectures for Networking and Communications Systems. 211–222.
[25]
M. Aggarwal, K. Nilay, and K. Yadav. 2017. Survey of named data networks: Future of internet. International Journal of Information Technology 9 (2017), 197–207.
[26]
G. Zhang, F. Pan, M. Dang'ana, Y. Mao, S. Motepalli, S. Zhang, and H. A. Jacobsen. 2022. Reaching consensus in the Byzantine empire: A comprehensive review of BFT consensus algorithms. arXiv preprint arXiv:2204.03181.
[27]
F. Song, L. Li, I. You, S. Yu, and H. Zhang. 2022. Optimizing high-speed mobile networks with smart collaborative theory. IEEE Wireless Communications 29, 3 (2022), 48–54.
[28]
F. Song, M. Zhu, Y. Zhou, I. You, and H. Zhang. 2019. Smart collaborative tracking for ubiquitous power IoT in edge-cloud interplay domain. IEEE Internet of Things Journal 7, 7 (2019), 6046–6055.
[29]
Z. Xiaohui and M. Xianghua. 2021. A reputation-based approach using consortium blockchain for cyber threat intelligence sharing. arXiv preprint arXiv:2107.06662.
[30]
S. M. H. Bamakan, A. Motavali, and A. B. Bondarti. 2020. A survey of blockchain consensus algorithms performance evaluation criteria. Expert Systems with Applications 154 (2020), 113385.

Cited By

View all
  • (2024)Improved Raft consensus algorithm based on NSGA-II and K-Means++2024 10th International Symposium on System Security, Safety, and Reliability (ISSSR)10.1109/ISSSR61934.2024.00055(383-390)Online publication date: 16-Mar-2024
  • (2024)BGRAFT: Grouped Anti-Byzantine RAFT Consensus Algorithm Based on RSA Encryption Algorithm2024 International Conference on Artificial Intelligence and Digital Technology (ICAIDT)10.1109/ICAIDT62617.2024.00067(279-283)Online publication date: 7-Jun-2024
  • (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

Index Terms

  1. VSSB-Raft: A Secure and Efficient Zero Trust Consensus Algorithm for Blockchain

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Transactions on Sensor Networks
    ACM Transactions on Sensor Networks  Volume 20, Issue 2
    March 2024
    572 pages
    EISSN:1550-4867
    DOI:10.1145/3618080
    • Editor:
    • Wen Hu
    Issue’s Table of Contents

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Journal Family

    Publication History

    Published: 09 January 2024
    Online AM: 08 August 2023
    Accepted: 25 July 2023
    Revised: 06 March 2023
    Received: 31 August 2022
    Published in TOSN Volume 20, Issue 2

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Blockchain
    2. zero trust
    3. Byzantine fault tolerance
    4. consensus algorithm
    5. secret sharing

    Qualifiers

    • Research-article

    Funding Sources

    • Major Scientific and Technological Projects in Yunnan Province
    • Yunnan Key Laboratory of Blockchain Application Technology
    • Scientific Research Fund Project of Yunnan Provincial Department of Education
    • National Natural Science Foundation of China
    • Yunnan Reserve Talents of Young and Middle-Aged Academic and Technical Leaders
    • Yunnan Young Top Talents of Ten thousand Plan

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)468
    • Downloads (Last 6 weeks)38
    Reflects downloads up to 02 Sep 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Improved Raft consensus algorithm based on NSGA-II and K-Means++2024 10th International Symposium on System Security, Safety, and Reliability (ISSSR)10.1109/ISSSR61934.2024.00055(383-390)Online publication date: 16-Mar-2024
    • (2024)BGRAFT: Grouped Anti-Byzantine RAFT Consensus Algorithm Based on RSA Encryption Algorithm2024 International Conference on Artificial Intelligence and Digital Technology (ICAIDT)10.1109/ICAIDT62617.2024.00067(279-283)Online publication date: 7-Jun-2024
    • (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

    Get Access

    Login options

    Full Access

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Full Text

    View this article in Full Text.

    Full Text

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media