{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T05:27:49Z","timestamp":1775107669824,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T00:00:00Z","timestamp":1717113600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T00:00:00Z","timestamp":1717113600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Social Science Fund of China","award":["21XTQ015"],"award-info":[{"award-number":["21XTQ015"]}]},{"name":"National Social Science Fund of China","award":["21XTQ015"],"award-info":[{"award-number":["21XTQ015"]}]},{"name":"National Social Science Fund of China","award":["21XTQ015"],"award-info":[{"award-number":["21XTQ015"]}]},{"name":"National Social Science Fund of China","award":["21XTQ015"],"award-info":[{"award-number":["21XTQ015"]}]},{"name":"Natural Science Foundation of Fujian Province of China under Grant","award":["2023J01920"],"award-info":[{"award-number":["2023J01920"]}]},{"name":"Natural Science Foundation of Fujian Province of China under Grant","award":["2023J01920"],"award-info":[{"award-number":["2023J01920"]}]},{"name":"Natural Science Foundation of Fujian Province of China under Grant","award":["2023J01920"],"award-info":[{"award-number":["2023J01920"]}]},{"name":"Natural Science Foundation of Fujian Province of China under Grant","award":["2023J01920"],"award-info":[{"award-number":["2023J01920"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s11227-024-06199-2","type":"journal-article","created":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T03:42:28Z","timestamp":1717126948000},"page":"20270-20301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A practical byzantine fault tolerance improvement algorithm based on credit grouping-classification"],"prefix":"10.1007","volume":"80","author":[{"given":"Yilin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amei","family":"Lan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenjie","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,31]]},"reference":[{"issue":"2","key":"6199_CR1","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.future.2016.12.016","volume":"78","author":"H Huang","year":"2018","unstructured":"Huang H, Chen X, Wu Q, Huang X, Shen J (2018) Bitcoin-based fair payments for outsourcing computations of fog devices. Futur Gener Comput Syst 78(2):850\u2013858","journal-title":"Futur Gener Comput Syst"},{"issue":"2","key":"6199_CR2","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.3390\/app13021117","volume":"13","author":"W Jiang","year":"2023","unstructured":"Jiang W, Wu X, Song M, Qin J, Jia Z (2023) Improved PBFT algorithm based on comprehensive evaluation model. Appl Sci 13(2):1117","journal-title":"Appl Sci"},{"issue":"4","key":"6199_CR3","doi-asserted-by":"publisher","first-page":"1696","DOI":"10.1007\/s12083-023-01469-x","volume":"16","author":"J Wang","year":"2023","unstructured":"Wang J, Li S, Ji W, Li D, Song B (2023) A composite blockchain associated event traceability method for financial activities. Peer-to-Peer Netw Appl 16(4):1696\u20131715","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"3","key":"6199_CR4","doi-asserted-by":"publisher","first-page":"1327","DOI":"10.1007\/s12083-023-01466-0","volume":"16","author":"Y Wang","year":"2023","unstructured":"Wang Y, Wang W, Zeng Y, Yang T (2023) GradingShard: a new sharding protocol to improve blockchain throughput. Peer-to-Peer Netw Appl 16(3):1327\u20131339","journal-title":"Peer-to-Peer Netw Appl"},{"key":"6199_CR5","first-page":"258","volume":"23","author":"M Jakobsson","year":"1999","unstructured":"Jakobsson M, Juels A (1999) Proofs of work and bread pudding protocols (extended abstract). Secur Inf Netw 23:258\u2013272","journal-title":"Secur Inf Netw"},{"key":"6199_CR6","unstructured":"King S, Nadal S (2012) PPCoin: peer-to-peer crypto-currency with proof-of-stake. self-published paper 19(1)"},{"key":"6199_CR7","first-page":"4010","volume":"10","author":"Y Lin","year":"2023","unstructured":"Lin Y, Wang Z, Hu G, Cao C, Li L (2023) An improved model on the vague sets-based DPoS\u2019s voting phase in blockchain. IEEE Trans Netw Sci Eng 10:4010\u20134019","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"6199_CR8","unstructured":"Ongaro D, Ousterhout JK (2014) In search of an understandable consensus algorithm. draft of October"},{"key":"6199_CR9","unstructured":"Castro M, Liskov B (1999) Practical byzantine fault tolerance. ACM"},{"key":"6199_CR10","doi-asserted-by":"publisher","first-page":"11440","DOI":"10.1109\/JIOT.2023.3243189","volume":"10","author":"Q Haytham","year":"2023","unstructured":"Haytham Q, Jelena M, Vojislav BM, Chang X (2023) A two-stage PBFT architecture with trust and reward incentive mechanism. IEEE Internet Things J 10:11440\u201311452","journal-title":"IEEE Internet Things J"},{"key":"6199_CR11","doi-asserted-by":"publisher","first-page":"10200","DOI":"10.3934\/mbe.2023447","volume":"20","author":"P Wang","year":"2023","unstructured":"Wang P, Wang X, Shen Y, Wang J, Xiong X (2023) PBFT optimization algorithm based on community contributions. Math Biosci Eng 20:10200\u201310222","journal-title":"Math Biosci Eng"},{"key":"6199_CR12","doi-asserted-by":"publisher","first-page":"3757","DOI":"10.3390\/app13063757","volume":"13","author":"H Pawan","year":"2023","unstructured":"Pawan H, Maddikunta PKR (2023) Secure PBFT consensus-based lightweight blockchain for healthcare application. Appl Sci 13:3757","journal-title":"Appl Sci"},{"key":"6199_CR13","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.3390\/electronics12061460","volume":"12","author":"J Liu","year":"2023","unstructured":"Liu J, Feng W, Zhang Y, He F (2023) Improvement of PBFT algorithm based on CART. Electronics 12:1460","journal-title":"Electronics"},{"key":"6199_CR14","doi-asserted-by":"crossref","unstructured":"Lei K, Zhang Q, Xu L, Qi Z (2018) Reputation-based byzantine fault-tolerance for consortium blockchain. In: ICPADS 2018, pp 604\u2013611","DOI":"10.1109\/PADSW.2018.8644933"},{"key":"6199_CR15","doi-asserted-by":"publisher","first-page":"10224","DOI":"10.1109\/ACCESS.2019.2891065","volume":"7","author":"Y Wang","year":"2019","unstructured":"Wang Y, Cai S, Lin C, Chen Z, Wang T, Gao Z, Zhou C (2019) Study of blockchains\u2019s consensus mechanism based on credit(article). IEEE Access 7:10224\u201310231","journal-title":"IEEE Access"},{"issue":"12","key":"6199_CR16","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","journal-title":"China Commun"},{"key":"6199_CR17","doi-asserted-by":"crossref","unstructured":"Du N, Liang Z, Huang Y, Guo Z, Wang S (2020) Performance optimisation method of PBFT consensus for supply chain integration SVM. In: 2020 7th international conference on dependable systems and their applications (DSA)","DOI":"10.1109\/DSA51864.2020.00066"},{"key":"6199_CR18","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/1855238","author":"R Almakki","year":"2022","unstructured":"Almakki R, AlSuwaidan L, Khan S, Baig AR, Basee S, Singh M (2022) Fault tolerance byzantine algorithm for lower overhead blockchain. Secur Commun Netw. https:\/\/doi.org\/10.1155\/2022\/1855238","journal-title":"Secur Commun Netw"},{"key":"6199_CR19","unstructured":"Micali S (2016) Algorand: The efficient and democratic ledger"},{"issue":"10","key":"6199_CR20","first-page":"7","volume":"34","author":"Q Huang","year":"2017","unstructured":"Huang Q, An Q, Su H (2017) Study and realization of an improved PBFT algorithm as an Ethereum consensus mechanism. Comput Appl Softw 34(10):7","journal-title":"Comput Appl Softw"},{"key":"6199_CR21","unstructured":"Fan X (2018) Scalable practical byzantine fault tolerance with short-lived signature schemes"},{"issue":"12","key":"6199_CR22","first-page":"101","volume":"46","author":"Z Chen","year":"2019","unstructured":"Chen Z, Li Q (2019) Improved PBFT consensus mechanism based on k-medoids. Comput Sci 46(12):101\u2013107","journal-title":"Comput Sci"},{"issue":"7","key":"6199_CR23","first-page":"5","volume":"38","author":"J Chen","year":"2021","unstructured":"Chen J, Xian X, Yang Z, Liu W (2021) Improved practical byzantine fault tolerant consensus algorithm combined with BLS aggregating signature. Appl Res Comput 38(7):5","journal-title":"Appl Res Comput"},{"issue":"11","key":"6199_CR24","first-page":"7","volume":"38","author":"N Gao","year":"2021","unstructured":"Gao N, Zhou C, Yang C, Song L, He W (2021) Improved PBFT algorithm based on network self clustering. Appl Res Comput 38(11):7","journal-title":"Appl Res Comput"},{"issue":"1","key":"6199_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3395331","volume":"21","author":"X Xu","year":"2021","unstructured":"Xu X, Zhu D, Yang X, Wang S, Qi L, Dou W (2021) Concurrent practical byzantine fault tolerance for integration of blockchain and supply chain. ACM Trans Internet Technol 21(1):1\u201317","journal-title":"ACM Trans Internet Technol"},{"issue":"1","key":"6199_CR26","first-page":"122","volume":"43","author":"J Wang","year":"2023","unstructured":"Wang J, Li Q (2023) Improved practical byzantine fault tolerance consensus algorithm based on raft algorithm. J Comput Appl 43(1):122\u2013129","journal-title":"J Comput Appl"},{"key":"6199_CR27","doi-asserted-by":"crossref","unstructured":"Zhuang Q, Liu Y, Chen L, Ai Z (2019) Proof of reputation: a reputation-based consensus protocol for blockchain based systems, 131\u2013138","DOI":"10.1145\/3343147.3343169"},{"issue":"6","key":"6199_CR28","first-page":"1766","volume":"39","author":"H Wang","year":"2019","unstructured":"Wang H, Guo K, Pan Q (2019) Byzantine fault tolerance consensus algorithm based on voting mechanism. J Comput Appl 39(6):1766","journal-title":"J Comput Appl"},{"key":"6199_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2019.101056","volume":"59","author":"A Bugday","year":"2019","unstructured":"Bugday A, Ozsoy A, Oztaner SM, Sever H (2019) Creating consensus group using online learning based reputation in blockchain networks. Pervasive Mob Comput 59:101056","journal-title":"Pervasive Mob Comput"},{"key":"6199_CR30","doi-asserted-by":"crossref","unstructured":"Li F, Liu K, Liu J, Fan Y, Wang S (2020) DHBFT: Dynamic hierarchical byzantine fault-tolerant consensus mechanism based on credit. In: Aisa-pacific web and web-age information management joint conference on web and big data","DOI":"10.1007\/978-3-030-60290-1_1"},{"issue":"1","key":"6199_CR31","first-page":"79","volume":"39","author":"Y Tu","year":"2021","unstructured":"Tu Y, Chen Y, Li T, Ren X, Qing X (2021) Improved PBFT scheme based on reputation voting. J Appl Sci 39(1):79\u201389","journal-title":"J Appl Sci"},{"key":"6199_CR32","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/1060765","author":"X Deng","year":"2022","unstructured":"Deng X, Li K, Wang Z, Liu H (2022) A novel consensus algorithm based on segmented DAG and BP neural network for consortium blockchain. Secur Commun Netw. https:\/\/doi.org\/10.1155\/2022\/1060765","journal-title":"Secur Commun Netw"},{"issue":"5","key":"6199_CR33","first-page":"1500","volume":"42","author":"X Ren","year":"2022","unstructured":"Ren X, Zhang L (2022) Improved multi-primary-node consensus mechanism based on practical byzantine fault tolerance. J Comput Appl 42(5):1500","journal-title":"J Comput Appl"},{"issue":"6","key":"6199_CR34","first-page":"42","volume":"48","author":"R Chen","year":"2022","unstructured":"Chen R, Wang L, Zhu R (2022) PBFT consensus algorithm based on reputation value voting and random number election. Comput Eng 48(6):42\u20134956","journal-title":"Comput Eng"},{"issue":"3","key":"6199_CR35","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 Forensics 14(3):1\u201315","journal-title":"Int J Digit Crime Forensics"},{"issue":"1","key":"6199_CR36","doi-asserted-by":"publisher","first-page":"12515","DOI":"10.1038\/s41598-022-15282-8","volume":"12","author":"Y Wang","year":"2022","unstructured":"Wang Y, Zhong M, Cheng T (2022) Research on PBFT consensus algorithm for grouping based on feature trust. Sci Rep 12(1):12515","journal-title":"Sci Rep"},{"key":"6199_CR37","unstructured":"Micali S, Rabin M, Vadhan S (1999) Verifiable random functions. IEEE Comput Soc"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06199-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06199-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06199-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T13:49:09Z","timestamp":1722606549000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06199-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,31]]},"references-count":37,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["6199"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06199-2","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,31]]},"assertion":[{"value":"8 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2024","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 no commercial or related interests conflict with any of the submitted work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}]}}