{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T15:53:45Z","timestamp":1770911625280,"version":"3.50.1"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T00:00:00Z","timestamp":1704758400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Major Scientific and Technological Projects in Yunnan Province","award":["202002AB080001-8"],"award-info":[{"award-number":["202002AB080001-8"]}]},{"name":"Yunnan Key Laboratory of Blockchain Application Technology","award":["202105AG070005, YNB202109, and YNB202115"],"award-info":[{"award-number":["202105AG070005, YNB202109, and YNB202115"]}]},{"name":"Scientific Research Fund Project of Yunnan Provincial Department of Education","award":["2022Y160"],"award-info":[{"award-number":["2022Y160"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61971208"],"award-info":[{"award-number":["61971208"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Yunnan Reserve Talents of Young and Middle-Aged Academic and Technical Leaders","award":["2019HB005"],"award-info":[{"award-number":["2019HB005"]}]},{"name":"Yunnan Young Top Talents of Ten thousand Plan","award":["2018 73"],"award-info":[{"award-number":["2018 73"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2024,3,31]]},"abstract":"<jats:p>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\u00a0(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\u2019s complexity to be O(n). Experiments show that the VSSB-Raft consensus algorithm is secure and efficient with high throughput and low consensus latency.<\/jats:p>","DOI":"10.1145\/3611308","type":"journal-article","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T12:04:02Z","timestamp":1691496242000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["VSSB-Raft: A Secure and Efficient Zero Trust Consensus Algorithm\u00a0for Blockchain"],"prefix":"10.1145","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4391-8009","authenticated-orcid":false,"given":"Siben","family":"Tian","sequence":"first","affiliation":[{"name":"Faculty of Information Engineering and Automation, Kunming University of Science and Technology; Yunnan Key Laboratory of Computer Technology Applications, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2505-0288","authenticated-orcid":false,"given":"Fenhua","family":"Bai","sequence":"additional","affiliation":[{"name":"Faculty of Information Engineering and Automation, Kunming University of Science and Technology; Yunnan Key Laboratory of Computer Technology Applications, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1273-7950","authenticated-orcid":false,"given":"Tao","family":"Shen","sequence":"additional","affiliation":[{"name":"Faculty of Information Engineering and Automation, Kunming University of Science and Technology; Yunnan Key Laboratory of Computer Technology Applications, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1475-333X","authenticated-orcid":false,"given":"Chi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Faculty of Information Engineering and Automation, Kunming University of Science and Technology; Yunnan Key Laboratory of Computer Technology Applications, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3188-3531","authenticated-orcid":false,"given":"Bei","family":"Gong","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Beijing University of Technology, China"}]}],"member":"320","published-online":{"date-parts":[[2024,1,9]]},"reference":[{"key":"e_1_3_1_2_2","volume-title":"Bitcoin: A peer-to-peer electronic cash system. Bitcoin. 4, 2","author":"Nakamoto S.","year":"2008","unstructured":"S. Nakamoto . 2008 . Bitcoin: A peer-to-peer electronic cash system. Bitcoin. 4, 2 (2008). https:\/\/bitcoin.org\/bitcoin.pdf S. Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. Bitcoin. 4, 2 (2008). https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1093\/jamia\/ocx068"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1093\/jamia\/ocy185"},{"key":"e_1_3_1_5_2","doi-asserted-by":"crossref","unstructured":"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.  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.","DOI":"10.1016\/j.swevo.2021.100891"},{"key":"e_1_3_1_6_2","first-page":"1","article-title":"DewBCity: Blockchain network-based dew-cloud modeling for distributed and decentralized smart cities","volume":"2022","author":"Hati S.","year":"2022","unstructured":"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 \u2013 21 . 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\u201321.","journal-title":"The Journal of Supercomputing"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/MIE.2019.2940335"},{"key":"e_1_3_1_8_2","first-page":"18","article-title":"Analysis on value application scenarios and applicability of blockchain in energy industry","volume":"45","author":"Shen X.","year":"2021","unstructured":"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 \u2013 29 . 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\u201329.","journal-title":"Automation of Electric Power Systems"},{"key":"e_1_3_1_9_2","first-page":"173","article-title":"Practical Byzantine fault tolerance","volume":"99","author":"Castro M.","year":"1999","unstructured":"M. Castro and B. Liskov . 1999 . Practical Byzantine fault tolerance . OsDI. 99 (1999), 173 \u2013 186 . M. Castro and B. Liskov. 1999. Practical Byzantine fault tolerance. OsDI. 99 (1999), 173\u2013186.","journal-title":"OsDI."},{"key":"e_1_3_1_10_2","volume-title":"2014 USENIX Annual Technical Conference (USENIXATC 14)","author":"Ongaro D.","unstructured":"D. Ongaro and J. Ousterhout . 2014. In search of an understandable consensus algorithm . 2014 USENIX Annual Technical Conference (USENIXATC 14) . 305\u2013319. D. Ongaro and J. Ousterhout. 2014. In search of an understandable consensus algorithm. 2014 USENIX Annual Technical Conference (USENIXATC 14). 305\u2013319."},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.06.002"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2020.3029766"},{"key":"e_1_3_1_13_2","article-title":"Raft consensus algorithm based on credit model in consortium blockchain","volume":"2","author":"Chen Y.","year":"2020","unstructured":"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). 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).","journal-title":"Wuhan University Journal of Natural Sciences"},{"key":"e_1_3_1_14_2","volume-title":"Web Information Systems and Applications: 18th International Conference, WISA 2021, Kaifeng, China, September 24\u201326, 2021, Proceedings 18","author":"Wang Y.","unstructured":"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\u201326, 2021, Proceedings 18 . Springer International Publishing, 718\u2013726. 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\u201326, 2021, Proceedings 18. Springer International Publishing, 718\u2013726."},{"key":"e_1_3_1_15_2","volume-title":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM). IEEE, 1\u20135.","author":"Tian S.","unstructured":"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\u20135. 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\u20135."},{"key":"e_1_3_1_16_2","first-page":"122","article-title":"A practical Byzantine fault-tolerant consensus algorithm based on Raft algorithm improvement","volume":"43","author":"Wang Z. D.","year":"2023","unstructured":"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 . 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.","journal-title":"Computer Applications"},{"key":"e_1_3_1_17_2","volume-title":"Zero Trust Architecture. NIST special publication","author":"Stafford V. A.","unstructured":"V. A. Stafford . 2020. Zero Trust Architecture. NIST special publication , Vol. 800 , 207. V. A. Stafford. 2020. Zero Trust Architecture. NIST special publication, Vol. 800, 207."},{"key":"e_1_3_1_18_2","first-page":"1120","article-title":"An edge-zero trust model for resisting the threat of lost terminals in power IoT scenarios","volume":"59","author":"Feng J. Y.","year":"2022","unstructured":"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 \u2013 1132 . 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\u20131132.","journal-title":"Computer Research and Development"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.3390\/app122211790"},{"key":"e_1_3_1_20_2","doi-asserted-by":"crossref","unstructured":"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.  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 .","DOI":"10.1145\/3511902"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.09.084"},{"key":"e_1_3_1_22_2","doi-asserted-by":"crossref","unstructured":"T. Xia and J. He. 2022. An identity authentication scheme based on SM2 algorithm in UAV communication network. Wireless Communications & Mobile Computing (Online).  T. Xia and J. He. 2022. An identity authentication scheme based on SM2 algorithm in UAV communication network. Wireless Communications & Mobile Computing (Online) .","DOI":"10.1155\/2022\/7537764"},{"key":"e_1_3_1_23_2","volume-title":"International Workshop on. IEEE Computer Society","author":"Blakley G. R.","year":"1979","unstructured":"G. R. Blakley . 1979 . Safeguarding cryptographic keys. Managing Requirements Knowledge , International Workshop on. IEEE Computer Society , (1979), 313\u2013313. G. R. Blakley. 1979. Safeguarding cryptographic keys. Managing Requirements Knowledge, International Workshop on. IEEE Computer Society, (1979), 313\u2013313."},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2886016"},{"key":"e_1_3_1_25_2","volume-title":"Proceedings of the Eighth ACM\/IEEE Symposium on Architectures for Networking and Communications Systems. 211\u2013222","author":"Dai H.","unstructured":"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\u2013222 . 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\u2013222."},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41870-017-0014-y"},{"key":"e_1_3_1_27_2","doi-asserted-by":"crossref","unstructured":"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.  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.","DOI":"10.1145\/3636553"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.001.2100579"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2958097"},{"key":"e_1_3_1_30_2","unstructured":"Z. Xiaohui and M. Xianghua. 2021. A reputation-based approach using consortium blockchain for cyber threat intelligence sharing. arXiv preprint arXiv:2107.06662.  Z. Xiaohui and M. Xianghua. 2021. A reputation-based approach using consortium blockchain for cyber threat intelligence sharing. arXiv preprint arXiv:2107.06662."},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113385"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3611308","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3611308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:50:54Z","timestamp":1750287054000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3611308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,9]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3,31]]}},"alternative-id":["10.1145\/3611308"],"URL":"https:\/\/doi.org\/10.1145\/3611308","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"value":"1550-4859","type":"print"},{"value":"1550-4867","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,9]]},"assertion":[{"value":"2022-08-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-25","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}