{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T03:13:59Z","timestamp":1785467639487,"version":"3.56.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T00:00:00Z","timestamp":1734912000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T00:00:00Z","timestamp":1734912000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s12083-024-01888-4","type":"journal-article","created":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T13:39:12Z","timestamp":1734961152000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["HML-BFT: Hybrid multi-layer BFT consensus with reputation model for large-scale blockchain"],"prefix":"10.1007","volume":"18","author":[{"given":"Wei","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiangyang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gaoli","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leibo","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiachen","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Entang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,23]]},"reference":[{"key":"1888_CR1","unstructured":"Nakamoto S (2008) Bitcoin: a peer-to-peer electronic cash system. http:\/\/www.bitcoin.org\/bitcoin.pdf"},{"key":"1888_CR2","unstructured":"Vasin P (2014) Blackcoin\u2019s proof-of-stake protocol v2. https:\/\/blackcoin.co\/blackcoin-posprotocol-v2-whitepaper.pdf"},{"key":"1888_CR3","doi-asserted-by":"crossref","unstructured":"Yin M, Malkhi D, Reiter MK, Gueta GG, Abraham I (2019) Hotstuff: Bft consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC \u201819), pp 347\u2013356","DOI":"10.1145\/3293611.3331591"},{"issue":"6","key":"1888_CR4","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1109\/LWC.2020.2971469","volume":"9","author":"H Xu","year":"2020","unstructured":"Xu H, Zhang L, Liu Y, Cao B (2020) Raft based wireless blockchain networks in the presence of malicious jamming. IEEE Wireless Commun Lett 9(6):817\u2013821","journal-title":"IEEE Wireless Commun Lett"},{"key":"1888_CR5","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:398\u2013461","journal-title":"ACM Trans Comput Syst"},{"key":"1888_CR6","doi-asserted-by":"crossref","unstructured":"Berger C, Schwarz-Ruesch S, Vogel A, Bleeke K, Jehl L, Reiser HP, Kapitza R (2023) Sok: scalability techniques for bft consensus. ser. IEEE International Conference on Blockchain and Cryptocurrency","DOI":"10.1109\/ICBC56567.2023.10174976"},{"key":"1888_CR7","doi-asserted-by":"crossref","unstructured":"Crain T, Natoli C, Gramoli V (2021) Red belly: a secure, fair and scalable open blockchain. In: 2021 IEEE symposium on Security and Privacy (SP), Conference Paper, pp 466\u201383","DOI":"10.1109\/SP40001.2021.00087"},{"key":"1888_CR8","doi-asserted-by":"crossref","unstructured":"Zamani M, Movahedi M, Raykova M (2018) Rapidchain: Scaling blockchain via full sharding. In: Proceedings of the 2018 ACM SIGSAC conference on Computer and Communications Security (CCS\u201918), pp 931\u2013948","DOI":"10.1145\/3243734.3243853"},{"issue":"5","key":"1888_CR9","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1109\/TPDS.2020.3042392","volume":"32","author":"W Li","year":"2021","unstructured":"Li W, Feng C, Zhang L, Xu H, Cao B, Imran MA (2021) A scalable multi-layer pbft consensus for blockchain. IEEE Trans Parallel Distributed Syst 32(5):1146\u20131160","journal-title":"IEEE Trans Parallel Distributed Syst"},{"key":"1888_CR10","doi-asserted-by":"crossref","unstructured":"Wen F, Yang L, Cai W, Zhou P (2020) Dp-hybrid: A two-layer consensus protocol for high scalability in permissioned blockchain, vol 1267. China, Dali, pp 57\u201371","DOI":"10.1007\/978-981-15-9213-3_5"},{"issue":"5","key":"1888_CR11","doi-asserted-by":"publisher","first-page":"2826","DOI":"10.1007\/s12083-021-01103-8","volume":"14","author":"Y Li","year":"2021","unstructured":"Li Y, Qiao L, Lv Z (2021) An optimized byzantine fault tolerance algorithm for consortium blockchain. Peer-to-Peer Netw Appl 14(5):2826\u20132839","journal-title":"Peer-to-Peer Netw Appl"},{"key":"1888_CR12","doi-asserted-by":"crossref","unstructured":"Yang J, Jia Z, Su R, Wu X, Qin J (2022) Improved fault-tolerant consensus based on the pbft algorithm. IEEE Access 10:30 274\u201330 283","DOI":"10.1109\/ACCESS.2022.3153701"},{"key":"1888_CR13","doi-asserted-by":"crossref","unstructured":"Wang Y, Zhong M, Cheng T (2022) Research on pbft consensus algorithm for grouping based on feature trust. Sci Rep 12(1)","DOI":"10.1038\/s41598-022-15282-8"},{"issue":"2","key":"1888_CR14","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1109\/TNSE.2020.2984490","volume":"8","author":"L-E Wang","year":"2021","unstructured":"Wang L-E, Bai Y, Jiang Q, Leung VCM, Cai W, Li X (2021) Beh-raft-chain: a behavior-based fast blockchain protocol for complex networks. IEEE Trans Netw Sci Eng 8(2):1154\u20131166","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"1888_CR15","doi-asserted-by":"publisher","unstructured":"Golan Gueta G, Abraham I, Grossman S, Malkhi D, Pinkas B, Reiter M, Seredinschi D-A, Tamir O, Tomescu A (2019) Sbft: A scalable and decentralized trust infrastructure. In: Proceedings - 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2019, pp 568 \u2013 580. [Online]. Available: https:\/\/doi.org\/10.1109\/DSN.2019.00063","DOI":"10.1109\/DSN.2019.00063"},{"key":"1888_CR16","doi-asserted-by":"crossref","unstructured":"Jalalzai MM, Busch C (2018) Window based bft blockchain consensus. In: IEEE 2018 international congress on cybermatics, pp 971\u2013979","DOI":"10.1109\/Cybermatics_2018.2018.00184"},{"key":"1888_CR17","doi-asserted-by":"crossref","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","DOI":"10.1109\/CyberC.2019.00013"},{"key":"1888_CR18","doi-asserted-by":"crossref","unstructured":"Gao S, Yu T, Zhu J, Cai W (2019) T-pbft: an eigentrust-based practical byzantine fault tolerance consensus algorithm. vol\u00a016, no\u00a012, pp 111\u2013123","DOI":"10.23919\/JCC.2019.12.008"},{"key":"1888_CR19","doi-asserted-by":"publisher","unstructured":"Kalala K, Feng T, Kiringa I (2017) Eigentrust for hierarchically structured chord, vol 10547 LNCS, Oslo, Norway, pp 203 \u2013 212, eigentrust;Hierarchical Chord;Hierarchical P2P;Reputation;Trust;. [Online]. Available: https:\/\/doi.org\/10.1007\/978-3-319-68063-7_14","DOI":"10.1007\/978-3-319-68063-7_14"},{"key":"1888_CR20","doi-asserted-by":"crossref","unstructured":"Ding Z, Dong X, Shen J, Cao Z (2022) A hybrid double-layer bft consensus protocol for large-scale iot blockchain. In: 2022 2nd International Conference on Frontiers of Electronics, Information and Computation Technologies (ICFEICT), Conference Paper, pp 354\u201361","DOI":"10.1109\/ICFEICT57213.2022.00071"},{"key":"1888_CR21","doi-asserted-by":"publisher","unstructured":"Miller A, Xia Y, Croman K, Shi E, Song D (2016) The honey badger of bft protocols. In: Proceedings of the ACM conference on computer and communications security, vol 24-28-October-2016, Vienna, Austria, pp 31 \u2013 42. [Online]. Available: https:\/\/doi.org\/10.1145\/2976749.2978399","DOI":"10.1145\/2976749.2978399"},{"key":"1888_CR22","doi-asserted-by":"crossref","unstructured":"Guo B, Lu Z, Tang Q, Xu J, Zhang Z (2020) Dumbo: Faster asynchronous bft protocols. In: CCS \u201820: Proceedings of the 2020 ACM SIGSAC conference on computer and communications security, pp 803\u2013818","DOI":"10.1145\/3372297.3417262"},{"issue":"3","key":"1888_CR23","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D Boneh","year":"2003","unstructured":"Boneh D, Franklin M (2003) Identity-based encryption from the weil pairing. SIAM J Comput 32(3):586\u2013615","journal-title":"SIAM J Comput"},{"key":"1888_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.ins.2012.07.004","volume":"219","author":"H Xiong","year":"2013","unstructured":"Xiong H, Guan Z, Chen Z, Li F (2013) An efficient certificateless aggregate signature with constant pairing computations. Inf Sci 219:225\u2013235","journal-title":"Inf Sci"},{"key":"1888_CR25","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork C, Lynch N, Stockmeyer L (1988) Consensus in the presence of partial synchrony. J Assoc Comput Mach 35:288\u2013323","journal-title":"J Assoc Comput Mach"},{"key":"1888_CR26","doi-asserted-by":"publisher","unstructured":"Kamvar SD, Schlosser MT, Garcia-Molina H (2003) The eigentrust algorithm for reputation management in p2p networks. Budapest, Hungary, pp 640 \u2013 651, eigenvector computations;Malicious peer;Peer to peer;Peer-to-peer file sharing networks;reputation;Reputation management;Reputation systems;Trust values;. [Online]. Available: https:\/\/doi.org\/10.1145\/775152.775242","DOI":"10.1145\/775152.775242"},{"key":"1888_CR27","doi-asserted-by":"crossref","unstructured":"Stoica I, Morris R, Karger D, Kaashoek M, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Computer Communication Review, 31(4), pp. 149\u2013160, ACM SIGCOMM, (2001) Conference. San Diego, CA","DOI":"10.1145\/964723.383071"},{"key":"1888_CR28","doi-asserted-by":"crossref","unstructured":"Ganganath N, Cheng C-T, Tse CK (2014) Data clustering with cluster size constraints using a modified k-means algorithm. In: International Conference On Cyber-Enabled Distributed Computing And Knowledge Discovery (CYBERC), pp 158\u2013161","DOI":"10.1109\/CyberC.2014.36"},{"key":"1888_CR29","unstructured":"hyperledger-fabricdocs documentation (2020). https:\/\/hyperledger-fabric.readthedocs.io\/downloads\/en\/release-1.1\/pdf"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-024-01888-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-024-01888-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-024-01888-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T09:34:07Z","timestamp":1747474447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-024-01888-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,23]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1888"],"URL":"https:\/\/doi.org\/10.1007\/s12083-024-01888-4","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,23]]},"assertion":[{"value":"2 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2024","order":3,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Publish"}}],"article-number":"62"}}