{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T22:22:39Z","timestamp":1782166959999,"version":"3.54.5"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T00:00:00Z","timestamp":1747180800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T00:00:00Z","timestamp":1747180800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Scientific and Technological Innovation Programs of Higher Education Institutions in Shanxi","award":["2023L237"],"award-info":[{"award-number":["2023L237"]}]},{"name":"Taiyuan Normal University 2024 Graduate Education Innovation Project","award":["SYYJSYC-2475"],"award-info":[{"award-number":["SYYJSYC-2475"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07342-3","type":"journal-article","created":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T19:57:16Z","timestamp":1747252636000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Cs-pbft: a comprehensive scoring-based Practical Byzantine Fault Tolerance consensus algorithm"],"prefix":"10.1007","volume":"81","author":[{"given":"Bo","family":"Liang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fujiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaru","family":"Deng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jie","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,14]]},"reference":[{"key":"7342_CR1","doi-asserted-by":"publisher","first-page":"113385","DOI":"10.1016\/j.eswa.2020.113385","volume":"154","author":"SMH Bamakan","year":"2020","unstructured":"Bamakan SMH, Motavali A, Bondarti AB (2020) A survey of blockchain consensus algorithms performance evaluation criteria. Expert Syst Appl 154:113385. https:\/\/doi.org\/10.1016\/j.eswa.2020.113385","journal-title":"Expert Syst Appl"},{"key":"7342_CR2","doi-asserted-by":"publisher","first-page":"108632","DOI":"10.1016\/j.comnet.2021.108632","volume":"204","author":"R Saltini","year":"2022","unstructured":"Saltini R (2022) Bigfoot: a robust optimal-latency bft blockchain consensus protocol with dynamic validator membership. Comput Netw 204:108632. https:\/\/doi.org\/10.1016\/j.comnet.2021.108632","journal-title":"Comput Netw"},{"key":"7342_CR3","doi-asserted-by":"publisher","unstructured":"Aggarwal S, Kumar N (2021) Cryptographic consensus mechanisms. In: Aggarwal, S., Kumar, N., Raj, P. (eds.) Blockchain Technology for Secure and Smart Applications Across Industry Verticals. Advances in Computers. vol. 121, pp. 211\u2013226. https:\/\/doi.org\/10.1016\/bs.adcom.2020.08.011","DOI":"10.1016\/bs.adcom.2020.08.011"},{"issue":"4","key":"7342_CR4","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1504\/IJWGS.2018.095647","volume":"14","author":"Z Zheng","year":"2018","unstructured":"Zheng Z, Xie S, Dai H-N, Chen X, Wang H (2018) Blockchain challenges and opportunities: a survey. Int J Web Grid Serv 14(4):352\u2013375. https:\/\/doi.org\/10.1504\/IJWGS.2018.095647","journal-title":"Int J Web Grid Serv"},{"key":"7342_CR5","doi-asserted-by":"publisher","first-page":"103276","DOI":"10.1016\/j.autcon.2020.103276","volume":"118","author":"R Yang","year":"2020","unstructured":"Yang R, Wakefield R, Lyu S, Jayasuriya S, Han F, Yi X, Yang X, Amarasinghe G, Chen S (2020) Public and private blockchain in construction business process and information integration. Automat Construct 118:103276. https:\/\/doi.org\/10.1016\/j.autcon.2020.103276","journal-title":"Automat Construct"},{"key":"7342_CR6","doi-asserted-by":"publisher","first-page":"115425","DOI":"10.1016\/j.eswa.2021.115425","volume":"184","author":"I Eluubek kyzy","year":"2021","unstructured":"Eluubek kyzy I, Song H, Vajdi A, Wang Y, Zhou J (2021) Blockchain for consortium: a practical paradigm in agricultural supply chain system. Expert Syst Appl 184:115425. https:\/\/doi.org\/10.1016\/j.eswa.2021.115425","journal-title":"Expert Syst Appl"},{"key":"7342_CR7","doi-asserted-by":"publisher","first-page":"121071","DOI":"10.1016\/j.eswa.2023.121071","volume":"234","author":"G Sathish Kumar","year":"2023","unstructured":"Sathish Kumar G, Premalatha K, Uma Maheshwari G, Rajesh Kanna P (2023) No more privacy concern: a privacy-chain based homomorphic encryption scheme and statistical method for privacy preservation of user\u2019s private and sensitive data. Expert Syst Appl 234:121071. https:\/\/doi.org\/10.1016\/j.eswa.2023.121071","journal-title":"Expert Syst Appl"},{"key":"7342_CR8","doi-asserted-by":"publisher","first-page":"109003","DOI":"10.1016\/j.comnet.2022.109003","volume":"211","author":"RD Garcia","year":"2022","unstructured":"Garcia RD, Ramachandran G, Ueyama J (2022) Exploiting smart contracts in pbft-based blockchains: a case study in medical prescription system. Comput Netw 211:109003. https:\/\/doi.org\/10.1016\/j.comnet.2022.109003","journal-title":"Comput Netw"},{"key":"7342_CR9","doi-asserted-by":"publisher","first-page":"107975","DOI":"10.1016\/j.comcom.2024.107975","volume":"228","author":"S-P Lu","year":"2024","unstructured":"Lu S-P, Lei C-L, Tsai M-H (2024) An efficient proof-of-authority consensus scheme against cloning attacks. Comput Commun 228:107975. https:\/\/doi.org\/10.1016\/j.comcom.2024.107975","journal-title":"Comput Commun"},{"key":"7342_CR10","doi-asserted-by":"publisher","unstructured":"Yoo J, Jung Y, Shin D, Bae M, Jee E (2019) Formal modeling and verification of a federated byzantine agreement algorithm for blockchain platforms. In: 2019 IEEE International Workshop on Blockchain Oriented Software Engineering (IWBOSE), pp. 11\u201321. https:\/\/doi.org\/10.1109\/IWBOSE.2019.8666514","DOI":"10.1109\/IWBOSE.2019.8666514"},{"key":"7342_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.future.2023.12.028","volume":"154","author":"TP Raptis","year":"2024","unstructured":"Raptis TP, Cicconetti C, Passarella A (2024) Efficient topic partitioning of apache kafka for high-reliability real-time data streaming applications. Future Generat Comput Syst 154:173\u2013188. https:\/\/doi.org\/10.1016\/j.future.2023.12.028","journal-title":"Future Generat Comput Syst"},{"issue":"3","key":"7342_CR12","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1093\/rfs\/hhaa075","volume":"34","author":"F Saleh","year":"2020","unstructured":"Saleh F (2020) Blockchain without Waste: proof-of-stake. Revi Financ Stud 34(3):1156\u20131190. https:\/\/doi.org\/10.1093\/rfs\/hhaa075","journal-title":"Revi Financ Stud"},{"key":"7342_CR13","doi-asserted-by":"publisher","unstructured":"Mingxiao D, Xiaofeng M, Zhe Z, Xiangwei W, Qijun C (2017) A review on consensus algorithm of blockchain. In: 2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 2567\u20132572. https:\/\/doi.org\/10.1109\/SMC.2017.8123011","DOI":"10.1109\/SMC.2017.8123011"},{"issue":"4","key":"7342_CR14","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M Castro","year":"2002","unstructured":"Castro M, Liskov B (2002) Practical byzantine fault tolerance and proactive recovery. ACM Trans Comput Syst 20(4):398\u2013461. https:\/\/doi.org\/10.1145\/571637.571640","journal-title":"ACM Trans Comput Syst"},{"issue":"3","key":"7342_CR15","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.dcan.2020.10.002","volume":"7","author":"N Shi","year":"2021","unstructured":"Shi N, Tan L, Li W, Qi X, Yu K (2021) A blockchain-empowered aaa scheme in the large-scale hetnet. Dig Commun Netw 7(3):308\u2013316. https:\/\/doi.org\/10.1016\/j.dcan.2020.10.002","journal-title":"Dig Commun Netw"},{"issue":"1","key":"7342_CR16","doi-asserted-by":"publisher","first-page":"305","DOI":"10.3390\/s21010305","volume":"21","author":"J Hu","year":"2021","unstructured":"Hu J, Reed MJ, Al-Naday M, Thomos N (2021) Hybrid blockchain for iot-energy analysis and reward plan. Sensors 21(1):305. https:\/\/doi.org\/10.3390\/s21010305","journal-title":"Sensors"},{"key":"7342_CR17","doi-asserted-by":"publisher","unstructured":"Li Y, Wang Z, Fan J, Zheng Y, Luo Y, Deng C, Ding J (2019) An extensible consensus algorithm based on pbft. In: 2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), pp. 17\u201323. https:\/\/doi.org\/10.1109\/CyberC.2019.00013","DOI":"10.1109\/CyberC.2019.00013"},{"issue":"6","key":"7342_CR18","doi-asserted-by":"publisher","first-page":"2915","DOI":"10.1007\/s12083-023-01566-x","volume":"16","author":"Z-F Wang","year":"2023","unstructured":"Wang Z-F, Liu S-Q, Wang P, Zhang L-Y (2023) Bw-pbft: Practical byzantine fault tolerance consensus algorithm based on credit bidirectionally waning. Peer-to-Peer Netw Appl 16(6):2915\u20132928. https:\/\/doi.org\/10.1007\/s12083-023-01566-x","journal-title":"Peer-to-Peer Netw Appl"},{"key":"7342_CR19","doi-asserted-by":"publisher","first-page":"125102","DOI":"10.1016\/j.eswa.2024.125102","volume":"257","author":"D Zhu","year":"2024","unstructured":"Zhu D, Guan Y (2024) Mbft: a modular byzantine fault tolerance protocol for high adaptability. Expert Syst Appl 257:125102. https:\/\/doi.org\/10.1016\/j.eswa.2024.125102","journal-title":"Expert Syst Appl"},{"key":"7342_CR20","doi-asserted-by":"publisher","first-page":"30274","DOI":"10.1109\/ACCESS.2022.3153701","volume":"10","author":"J Yang","year":"2022","unstructured":"Yang J, Jia Z, Su R, Wu X, Qin J (2022) Improved fault-tolerant consensus based on the pbft algorithm. IEEE Access 10:30274\u201330283. https:\/\/doi.org\/10.1109\/ACCESS.2022.3153701","journal-title":"IEEE Access"},{"issue":"1","key":"7342_CR21","doi-asserted-by":"publisher","first-page":"6144664","DOI":"10.1155\/2022\/6144664","volume":"2022","author":"G Xu","year":"2022","unstructured":"Xu G, Wang Y (2022) Improved pbft algorithm based on vague sets. Sec Commun Netw 2022(1):6144664. https:\/\/doi.org\/10.1155\/2022\/6144664","journal-title":"Sec Commun Netw"},{"key":"7342_CR22","doi-asserted-by":"publisher","first-page":"109541","DOI":"10.1016\/j.comnet.2022.109541","volume":"222","author":"J Tian","year":"2023","unstructured":"Tian J, Tian J, Xu H (2023) Tsbft: a scalable and efficient leaderless byzantine consensus for consortium blockchain. Comput Netw 222:109541. https:\/\/doi.org\/10.1016\/j.comnet.2022.109541","journal-title":"Comput Netw"},{"key":"7342_CR23","doi-asserted-by":"publisher","unstructured":"Wang Y, Song Z, Cheng T (2020) Improvement research of pbft consensus algorithm based on credit. In: Zheng, Z., Dai, H.-N., Tang, M., Chen, X. (eds.) Blockchain and Trustworthy Systems, pp. 47\u201359. Springer, Singapore. https:\/\/doi.org\/10.1007\/978-981-15-2777-7_4.","DOI":"10.1007\/978-981-15-2777-7_4."},{"key":"7342_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2022.01.029","volume":"164","author":"G Xu","year":"2022","unstructured":"Xu G, Bai H, Xing J, Luo T, Xiong NN, Cheng X, Liu S, Zheng X (2022) Sg-pbft: a secure and highly efficient distributed blockchain PBFT consensus algorithm for intelligent internet of vehicles. J Parall Distribut Comput 164:1\u201311. https:\/\/doi.org\/10.1016\/j.jpdc.2022.01.029","journal-title":"J Parall Distribut Comput"},{"key":"7342_CR25","doi-asserted-by":"publisher","first-page":"21533","DOI":"10.1007\/s11227-024-06284-6","volume":"80","author":"F Bai","year":"2024","unstructured":"Bai F, Li F, Shen T, Zeng K, Zhang X, Zhang C (2024) Rabft: an improved byzantine fault tolerance consensus algorithm based on raft. J Supercomput 80:21533\u201321560. https:\/\/doi.org\/10.1007\/s11227-024-06284-6","journal-title":"J Supercomput"},{"key":"7342_CR26","doi-asserted-by":"publisher","first-page":"17849","DOI":"10.1007\/s11227-024-06122-9","volume":"80","author":"J Li","year":"2024","unstructured":"Li J, Cao L, Zhao S, Wan J, Bai J (2024) Lc-pbft: Layered cross-chain consensus algorithm based on forest topology. J Supercomput 80:17849\u201317873. https:\/\/doi.org\/10.1007\/s11227-024-06122-9","journal-title":"J Supercomput"},{"issue":"3","key":"7342_CR27","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/2402.322398","volume":"30","author":"L Lamport","year":"1983","unstructured":"Lamport L (1983) The weak byzantine generals problem. J ACM (JACM) 30(3):668\u2013676. https:\/\/doi.org\/10.1145\/2402.322398","journal-title":"J ACM (JACM)"},{"issue":"3","key":"7342_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/IJDCF.315615","volume":"14","author":"S Liu","year":"2022","unstructured":"Liu S, Zhang R, Liu C, Xu C, Zhou J, Wang J (2022) Improvement of the pbft algorithm based on grouping and reputation value voting. Int J Digit Crime Forens (IJDCF) 14(3):1\u201315. https:\/\/doi.org\/10.4018\/IJDCF.315615","journal-title":"Int J Digit Crime Forens (IJDCF)"},{"issue":"2","key":"7342_CR29","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1145\/78922.78925","volume":"15","author":"K-Y Whang","year":"1990","unstructured":"Whang K-Y, Vander-Zanden BT, Taylor HM (1990) A linear-time probabilistic counting algorithm for database applications. ACM Trans Database Syst 15(2):208\u2013229. https:\/\/doi.org\/10.1145\/78922.78925","journal-title":"ACM Trans Database Syst"},{"key":"7342_CR30","doi-asserted-by":"publisher","unstructured":"Roy H, Shafiuzzaman M, Samsuddoha M (2019) Srcs: A new proposed counting sort algorithm based on square root method. In: 2019 22nd International Conference on Computer and Information Technology (ICCIT), pp. 1\u20136. https:\/\/doi.org\/10.1109\/ICCIT48885.2019.9038601","DOI":"10.1109\/ICCIT48885.2019.9038601"},{"issue":"13","key":"7342_CR31","doi-asserted-by":"publisher","first-page":"11440","DOI":"10.1109\/JIOT.2023.3243189","volume":"10","author":"H Qushtom","year":"2023","unstructured":"Qushtom H, Mi\u0161i\u0107 J, Mi\u0161i\u0107 VB, Chang X (2023) A two-stage pbft architecture with trust and reward incentive mechanism. IEEE Int Things J 10(13):11440\u201311452. https:\/\/doi.org\/10.1109\/JIOT.2023.3243189","journal-title":"IEEE Int Things J"},{"issue":"12","key":"7342_CR32","doi-asserted-by":"publisher","first-page":"111","DOI":"10.23919\/JCC.2019.12.008","volume":"16","author":"S Gao","year":"2019","unstructured":"Gao S, Yu T, Zhu J, Cai W (2019) T-pbft: an eigentrust-based practical byzantine fault tolerance consensus algorithm. China Commun 16(12):111\u2013123. https:\/\/doi.org\/10.23919\/JCC.2019.12.008","journal-title":"China Commun"},{"key":"7342_CR33","doi-asserted-by":"publisher","unstructured":"Zhang Z, Zhu D, Fan W (2020) Qpbft: Practical byzantine fault tolerance consensus algorithm based on quantified-role. In: 2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), pp. 991\u2013997. https:\/\/doi.org\/10.1109\/TrustCom50675.2020.00132 . IEEE","DOI":"10.1109\/TrustCom50675.2020.00132"},{"key":"7342_CR34","doi-asserted-by":"publisher","unstructured":"Riahi K, Brahmia M-e-A, Abouaissa A, Idoumghar L (2022) Apbft: An adaptive pbft consensus for private blockchains. In: GLOBECOM 2022 - 2022 IEEE Global Communications Conference, pp. 1788\u20131793. https:\/\/doi.org\/10.1109\/GLOBECOM48099.2022.10001568","DOI":"10.1109\/GLOBECOM48099.2022.10001568"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07342-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07342-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07342-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T19:57:16Z","timestamp":1747252636000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07342-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,14]]},"references-count":34,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2025,5]]}},"alternative-id":["7342"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07342-3","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,14]]},"assertion":[{"value":"23 April 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The data used in this paper are all publicly available and have no ethical violations.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"859"}}