{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T17:25:47Z","timestamp":1767979547084,"version":"3.49.0"},"reference-count":116,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T00:00:00Z","timestamp":1761264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T00:00:00Z","timestamp":1761264000000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s11432-024-4431-y","type":"journal-article","created":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T10:41:46Z","timestamp":1761561706000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["From PBFT to the present: a thorough overview of blockchain consensus protocols"],"prefix":"10.1007","volume":"69","author":[{"given":"Liaoliao","family":"Feng","sequence":"first","affiliation":[]},{"given":"Xiang","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Huaimin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Keming","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Peichang","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Feng","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Moheng","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,24]]},"reference":[{"key":"4431_CR1","volume-title":"Bitcoin: a peer-to-peer electronic cash system","author":"S Nakamoto","year":"2008","unstructured":"Nakamoto S. Bitcoin: a peer-to-peer electronic cash system. 2008. https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"4431_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.csbj.2019.01.010","volume":"17","author":"G Drosatos","year":"2019","unstructured":"Drosatos G, Kaldoudi E. Blockchain applications in the biomedical domain: a scoping review. Comput Struct Biotechnol J, 2019, 17: 229\u2013240","journal-title":"Comput Struct Biotechnol J"},{"key":"4431_CR3","first-page":"80","volume":"39","author":"N Kshetri","year":"2018","unstructured":"Kshetri N. 1 Blockchain\u2019s roles in meeting key supply chain management objectives. Int J Inf Manage, 2018, 39: 80\u201389","journal-title":"Int J Inf Manage"},{"key":"4431_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.bushor.2018.08.012","volume":"62","author":"H Min","year":"2019","unstructured":"Min H. Blockchain technology for enhancing supply chain resilience. Business Horizons, 2019, 62: 35\u201345","journal-title":"Business Horizons"},{"key":"4431_CR5","doi-asserted-by":"publisher","first-page":"2337","DOI":"10.1016\/j.tele.2018.10.004","volume":"35","author":"D Macrinici","year":"2018","unstructured":"Macrinici D, Cartofeanu C, Gao S. Smart contract applications within blockchain technology: a systematic mapping study. Telematics Inf, 2018, 35: 2337\u20132354","journal-title":"Telematics Inf"},{"key":"4431_CR6","doi-asserted-by":"publisher","first-page":"36500","DOI":"10.1109\/ACCESS.2019.2903554","volume":"7","author":"J Al-Jaroodi","year":"2019","unstructured":"Al-Jaroodi J, Mohamed N. Blockchain in industries: a survey. IEEE Access, 2019, 7: 36500\u201336515","journal-title":"IEEE Access"},{"key":"4431_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tele.2018.11.006","volume":"36","author":"F Casino","year":"2019","unstructured":"Casino F, Dasaklis T K, Patsakis C. A systematic literature review of blockchain-based applications: current status, classification and open issues. Telemat Inf, 2019, 36: 55\u201381","journal-title":"Telemat Inf"},{"key":"4431_CR8","first-page":"225","volume-title":"Blockchain Technology: Principles and Applications","author":"M Pilkington","year":"2016","unstructured":"Pilkington M. Blockchain Technology: Principles and Applications. Cheltenham: Edward Elgar Publishing, 2016. 225\u2013253"},{"key":"4431_CR9","first-page":"4182","volume-title":"In: Proceedings of the Hawaii International Conference on System Sciences","author":"K Korpela","year":"2017","unstructured":"Korpela K, Hallikas J, Dahlberg T. Digital supply chain transformation toward blockchain integration. In: Proceedings of the Hawaii International Conference on System Sciences, 2017. 4182\u20134191"},{"key":"4431_CR10","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/62546.62549","volume-title":"Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing","author":"B M Oki","year":"1988","unstructured":"Oki B M, Liskov B H. Viewstamped replication: a new primary copy method to support highly-available distributed systems. In: Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988. 8\u201317"},{"key":"4431_CR11","first-page":"51","volume":"32","author":"L Lamport","year":"2001","unstructured":"Lamport L. Paxos made simple. ACM SIGACT News, 2001, 32: 51\u201358","journal-title":"ACM SIGACT News"},{"key":"4431_CR12","first-page":"305","volume-title":"Proceedings of the 2014 USENIX Annual Technical Conference","author":"D Ongaro","year":"2014","unstructured":"Ongaro D, Ousterhout J. In search of an understandable consensus algorithm. In: Proceedings of the 2014 USENIX Annual Technical Conference, 2014. 305\u2013319"},{"key":"4431_CR13","doi-asserted-by":"publisher","first-page":"121101","DOI":"10.1007\/s11432-019-2790-1","volume":"64","author":"X Fu","year":"2021","unstructured":"Fu X, Wang H M, Shi P C. A survey of Blockchain consensus algorithms: mechanism, design and applications. Sci China Inf Sci, 2021, 64: 121101","journal-title":"Sci China Inf Sci"},{"key":"4431_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/3284764.3284767","volume-title":"Proceedings of the 2nd Workshop on Scalable and Resilient Infrastructures for Distributed Ledgers","author":"C Berger","year":"2018","unstructured":"Berger C, Reiser H P. Scaling Byzantine consensus: a broad analysis. In: Proceedings of the 2nd Workshop on Scalable and Resilient Infrastructures for Distributed Ledgers, 2018. 13\u201318"},{"key":"4431_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1504\/IJCCBS.2011.041257","volume":"2","author":"M Correia","year":"2011","unstructured":"Correia M, Veronese G S, Neves N F, et al. Byzantine consensus in asynchronous message-passing systems: a survey. Int J Crit Comput-Based Syst, 2011, 2: 141\u2013161","journal-title":"Int J Crit Comput-Based Syst"},{"key":"4431_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2886780","volume":"48","author":"M Platania","year":"2016","unstructured":"Platania M, Obenshain D, Tantillo T, et al. On choosing server- or client-side solutions for BFT. ACM Comput Surv, 2016, 48: 1\u201330","journal-title":"ACM Comput Surv"},{"key":"4431_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3436728","volume":"54","author":"T Distler","year":"2022","unstructured":"Distler T. Byzantine fault-tolerant state-machine replication from a systems perspective. ACM Comput Surv, 2022, 54: 1\u201338","journal-title":"ACM Comput Surv"},{"key":"4431_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3676955","volume":"56","author":"G Zhang","year":"2024","unstructured":"Zhang G, Pan F, Mao Y, et al. Reaching consensus in the Byzantine empire: a comprehensive review of BFT consensus algorithms. ACM Comput Surv, 2024, 56: 1\u201341","journal-title":"ACM Comput Surv"},{"key":"4431_CR19","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1145\/3552326.3587455","volume-title":"Proceedings of the Eighteenth European Conference on Computer Systems","author":"S Gupta","year":"2023","unstructured":"Gupta S, Rahnama S, Pandey S, et al. Dissecting BFT consensus: in trusted components we trust! In: Proceedings of the Eighteenth European Conference on Computer Systems, 2023. 521\u2013539"},{"key":"4431_CR20","first-page":"371","volume-title":"Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation","author":"M J Amiri","year":"2024","unstructured":"Amiri M J, Wu C, Agrawal D, et al. The bedrock of Byzantine fault tolerance: a unified platform for BFT protocols analysis, implementation, and experimentation. In: Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation, 2024. 371\u2013400"},{"key":"4431_CR21","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/TIFS.2023.3318943","volume":"19","author":"X Sui","year":"2023","unstructured":"Sui X, Duan S, Zhang H. BG: a modular treatment of BFT consensus toward a unified theory of BFT replication. IEEE TransInform-Forensic Secur, 2023, 19: 44\u201358","journal-title":"IEEE TransInform-Forensic Secur"},{"key":"4431_CR22","first-page":"205","volume-title":"Proceedings of the 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)","author":"Z Xiang","year":"2021","unstructured":"Xiang Z, Malkhi D, Nayak K, et al. Strengthened fault tolerance in Byzantine fault tolerant replication. In: Proceedings of the 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), 2021. 205\u2013215"},{"key":"4431_CR23","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"F B Schneider","year":"1990","unstructured":"Schneider F B. Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput Surv, 1990, 22: 299\u2013319","journal-title":"ACM Comput Surv"},{"key":"4431_CR24","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1145\/2815400.2815427","volume-title":"Proceedings of the 25th Symposium on Operating Systems Principles","author":"H Cui","year":"2015","unstructured":"Cui H, Gu R, Liu C, et al. Paxos made transparent. In: Proceedings of the 25th Symposium on Operating Systems Principles, 2015. 105\u2013120"},{"key":"4431_CR25","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations, and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"Attiya H, Welch J. Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Hoboken: John Wiley & Sons, 2004"},{"key":"4431_CR26","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/190.357399","volume":"2","author":"F B Schneider","year":"1984","unstructured":"Schneider F B. Byzantine generals in action: implementing fail-stop processors. ACM Trans Comput Syst, 1984, 2: 145\u2013154","journal-title":"ACM Trans Comput Syst"},{"key":"4431_CR27","first-page":"203","volume-title":"Concurrency: the Works of Leslie Lamport","author":"L Lamport","year":"2019","unstructured":"Lamport L, Shostak R, Pease M. The Byzantine generals problem. In: Concurrency: the Works of Leslie Lamport. New York: ACM Books, 2019. 203\u2013226"},{"key":"4431_CR28","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. Consensus in the presence of partial synchrony. J ACM, 1988, 35: 288\u2013323","journal-title":"J ACM"},{"key":"4431_CR29","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M J Fischer","year":"1985","unstructured":"Fischer M J, Lynch N A, Paterson M S. Impossibility of distributed consensus with one faulty process. J ACM, 1985, 32: 374\u2013382","journal-title":"J ACM"},{"key":"4431_CR30","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D Dolev","year":"1987","unstructured":"Dolev D, Dwork C, Stockmeyer L. On the minimal synchronism needed for distributed consensus. J ACM, 1987, 34: 77\u201397","journal-title":"J ACM"},{"key":"4431_CR31","first-page":"173","volume-title":"Proceedings of the Third Symposium on Operating Systems Design and Implementation","author":"M Castro","year":"1999","unstructured":"Castro M, Liskov B. Practical Byzantine fault tolerance. In: Proceedings of the Third Symposium on Operating Systems Design and Implementation, 1999. 173\u2013186"},{"key":"4431_CR32","unstructured":"Buchman E, Kwon J, Milosevic Z. The latest gossip on BFT consensus. 2028. ArXiv:1807.04938"},{"key":"4431_CR33","series-title":"Studies in Cognitive Systems","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-94-011-1793-7_4","volume-title":"Program Verification","author":"R W Floyd","year":"1993","unstructured":"Floyd R W. Assigning meanings to programs. In: Program Verification. Studies in Cognitive Systems. Dordrecht: Springer, 1993. 65\u201381"},{"key":"4431_CR34","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1145\/3548606.3559375","volume-title":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","author":"B David","year":"2022","unstructured":"David B, Magri B, Matt C, et al. Gearbox: optimal-size shard committees by leveraging the safety-liveness dichotomy. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022. 683\u2013696"},{"key":"4431_CR35","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D Boneh","year":"2004","unstructured":"Boneh D, Lynn B, Shacham H. Short signatures from the Weil pairing. J Cryptol, 2004, 17: 297\u2013319","journal-title":"J Cryptol"},{"key":"4431_CR36","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/343477.343531","volume-title":"Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing","author":"C Cachin","year":"2000","unstructured":"Cachin C, Kursawe K, Shoup V. Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography. In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000. 123\u2013132"},{"key":"4431_CR37","first-page":"207","volume-title":"Proceedings of the 19th International Conference on Theory and Application of Cryptographic Techniques","author":"V Shoup","year":"2000","unstructured":"Shoup V. Practical threshold signatures. In: Proceedings of the 19th International Conference on Theory and Application of Cryptographic Techniques, 2000. 207\u2013220"},{"key":"4431_CR38","first-page":"416","volume-title":"Proceedings of the 22nd International Conference on Theory and Applications of Cryptographic Techniques","author":"D Boneh","year":"2003","unstructured":"Boneh D, Gentry C, Lynn B, et al. Aggregate and verifiably encrypted signatures from bilinear maps. In: Proceedings of the 22nd International Conference on Theory and Applications of Cryptographic Techniques, 2003. 416\u2013432"},{"key":"4431_CR39","first-page":"435","volume-title":"Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security","author":"D Boneh","year":"2018","unstructured":"Boneh D, Drijvers M, Neven G. Compact multi-signatures for smaller blockchains. In: Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, 2018. 435\u2013464"},{"key":"4431_CR40","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A. How to share a secret. Commun ACM, 1979, 22: 612\u2013613","journal-title":"Commun ACM"},{"key":"4431_CR41","first-page":"568","volume-title":"Proceedings of the 2019 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN)","author":"G G Gueta","year":"2019","unstructured":"Gueta G G, Abraham I, Grossman S, et al. SBFT: a scalable and decentralized trust infrastructure. In: Proceedings of the 2019 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), 2019. 568\u2013580"},{"key":"4431_CR42","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1145\/3293611.3331591","volume-title":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","author":"M Yin","year":"2019","unstructured":"Yin M, Malkhi D, Reiter M K, et al. Hotstuff: BFT consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019. 347\u2013356"},{"key":"4431_CR43","first-page":"1471","volume":"49","author":"H Sun","year":"2021","unstructured":"Sun H, Zhang W, Wang X, et al. A robust Byzantine fault-tolerant consensus algorithm against adaptive attack based on ring signature and threshold signature. Acta Autom Sin, 2021, 49: 1471\u20131482","journal-title":"Acta Autom Sin"},{"key":"4431_CR44","doi-asserted-by":"publisher","first-page":"2478","DOI":"10.1109\/TDSC.2023.3308848","volume":"21","author":"M M Jalalzai","year":"2023","unstructured":"Jalalzai M M, Niu J, Feng C, et al. Fast-HotStuff: a fast and robust BFT protocol for blockchains. IEEE Trans Dependable Secure Comput, 2023, 21: 2478\u20132493","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"4431_CR45","unstructured":"Hanke T, Movahedi M, Williams D. Dfinity technology overview series, consensus system. 2018. ArXiv:1805.04548"},{"key":"4431_CR46","doi-asserted-by":"publisher","first-page":"107922","DOI":"10.1016\/j.comcom.2024.08.004","volume":"226\u2013227","author":"F Tang","year":"2024","unstructured":"Tang F, Peng J, Wang P, et al. Improved dynamic Byzantine fault tolerant consensus mechanism. Comput Commun, 2024, 226\u2013227: 107922","journal-title":"Comput Commun"},{"key":"4431_CR47","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TC.2018.2860009","volume":"68","author":"J Liu","year":"2018","unstructured":"Liu J, Li W, Karame G O, et al. Scalable Byzantine consensus via hardware-assisted secret sharing. IEEE Trans Comput, 2018, 68: 139\u2013151","journal-title":"IEEE Trans Comput"},{"key":"4431_CR48","first-page":"1004","volume-title":"Proceedings of the IEEE International Conference on Communications","author":"J Zhang","year":"2022","unstructured":"Zhang J, Gao J, Wang K, et al. TBFT: efficient Byzantine fault tolerance using trusted execution environment. In: Proceedings of the IEEE International Conference on Communications, 2022. 1004\u20131009"},{"key":"4431_CR49","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/2976749.2978399","volume-title":"Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security","author":"A Miller","year":"2016","unstructured":"Miller A, Xia Y, Croman K, et al. The honey badger of BFT protocols. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016. 31\u201342"},{"key":"4431_CR50","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1145\/3372297.3417262","volume-title":"Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security","author":"B Guo","year":"2020","unstructured":"Guo B, Lu Z, Tang Q, et al. Dumbo: faster asynchronous BFT protocols. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020. 803\u2013818"},{"key":"4431_CR51","volume-title":"Speeding dumbo: pushing asynchronous BFT closer to practice","author":"B Guo","year":"2022","unstructured":"Guo B, Lu Y, Lu Z, et al. Speeding dumbo: pushing asynchronous BFT closer to practice. Cryptology ePrint Archive, 2022. https:\/\/eprint.iacr.org\/2022\/027"},{"key":"4431_CR52","doi-asserted-by":"publisher","first-page":"2387","DOI":"10.1145\/3319535.3354207","volume-title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security","author":"S Basu","year":"2019","unstructured":"Basu S, Tomescu A, Abraham I, et al. Efficient verifiable secret sharing with share recovery in BFT protocols. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019. 2387\u20132402"},{"key":"4431_CR53","volume-title":"Ferveo: threshold decryption for mempool privacy in BFT networks","author":"J Bebel","year":"2022","unstructured":"Bebel J, Ojha D. Ferveo: threshold decryption for mempool privacy in BFT networks. Cryptology ePrint Archive, 2022. https:\/\/eprint.iacr.org\/2022\/898"},{"key":"4431_CR54","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1145\/3465084.3467899","volume-title":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing","author":"I Abraham","year":"2021","unstructured":"Abraham I, Nayak K, Ren L, et al. Good-case latency of Byzantine broadcast: a complete categorization. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, 2021. 331\u2013341"},{"key":"4431_CR55","first-page":"1","volume-title":"Proceedings of the IEEE Conference on Computer Communications","author":"H Xu","year":"2024","unstructured":"Xu H, Liu X, Zhang C, et al. Crackle: a fast sector-based BFT consensus with sublinear communication complexity. In: Proceedings of the IEEE Conference on Computer Communications, 2024. 1\u201310"},{"key":"4431_CR56","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1658357.1658358","volume":"27","author":"R Kotla","year":"2009","unstructured":"Kotla R, Alvisi L, Dahlin M, et al. Zyzzyva: speculative Byzantine fault tolerance. ACM Trans Comput Syst, 2009, 27: 1\u201339","journal-title":"ACM Trans Comput Syst"},{"key":"4431_CR57","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TDSC.2006.35","volume":"3","author":"J P Martin","year":"2006","unstructured":"Martin J P, Alvisi L. Fast Byzantine consensus. IEEE Trans Dependable Secure Comput, 2006, 3: 202\u2013215","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"4431_CR58","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1145\/3064176.3064213","volume-title":"Proceedings of the Twelfth European Conference on Computer Systems","author":"J Behl","year":"2017","unstructured":"Behl J, Distler T, Kapitza R. Hybrids on steroids: SGX-based high performance BFT. In: Proceedings of the Twelfth European Conference on Computer Systems, 2017. 222\u2013237"},{"key":"4431_CR59","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/2168836.2168866","volume-title":"Proceedings of the 7th ACM European Conference on Computer Systems","author":"R Kapitza","year":"2012","unstructured":"Kapitza R, Behl J, Cachin C, et al. CheapBFT: resource-efficient Byzantine fault tolerance. In: Proceedings of the 7th ACM European Conference on Computer Systems, 2012. 295\u2013308"},{"key":"4431_CR60","first-page":"3","volume-title":"Proceedings of the 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"R Pass","year":"2018","unstructured":"Pass R, Shi E. Thunderella: blockchains with optimistic instant confirmation. In: Proceedings of the 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2018. 3\u201333"},{"key":"4431_CR61","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1145\/3576915.3616658","volume-title":"Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security","author":"M Kelkar","year":"2023","unstructured":"Kelkar M, Deb S, Long S, et al. Themis: fast, strong order-fairness in Byzantine consensus. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023. 475\u2013489"},{"key":"4431_CR62","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/3477132.3483584","volume-title":"Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles","author":"R Neiheiser","year":"2021","unstructured":"Neiheiser R, Matos M, Rodrigues L. Kauri: scalable BFT consensus with pipelined tree-based dissemination and aggregation. In: Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles, 2021. 35\u201348"},{"key":"4431_CR63","first-page":"1","volume-title":"Proceedings of the IEEE Conference on Computer Communications","author":"Q Wang","year":"2021","unstructured":"Wang Q, Li R. A weak consensus algorithm and its application to high-performance blockchain. In: Proceedings of the IEEE Conference on Computer Communications, 2021. 1\u201310"},{"key":"4431_CR64","doi-asserted-by":"publisher","first-page":"4964","DOI":"10.1109\/TPDS.2022.3211829","volume":"33","author":"X Fu","year":"2022","unstructured":"Fu X, Wang H, Shi P. Votes-as-a-Proof (VaaP): permissioned blockchain consensus protocol made simple. IEEE Trans Parallel Distrib Syst, 2022, 33: 4964\u20134973","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4431_CR65","first-page":"234","volume-title":"Proceedings of the European Dependable Computing Conference","author":"M Correia","year":"2002","unstructured":"Correia M, Ver\u00edssimo P, Neves N F. The design of a cots real-time distributed security kernel. In: Proceedings of the European Dependable Computing Conference, 2002. 234\u2013252"},{"key":"4431_CR66","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/1323293.1294280","volume":"41","author":"B G Chun","year":"2007","unstructured":"Chun B G, Maniatis P, Shenker S, et al. Attested append-only memory: making adversaries stick to their word. SIGOPS Oper Syst Rev, 2007, 41: 189\u2013204","journal-title":"SIGOPS Oper Syst Rev"},{"key":"4431_CR67","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TC.2011.221","volume":"62","author":"G S Veronese","year":"2011","unstructured":"Veronese G S, Correia M, Bessani A N, et al. Efficient Byzantine fault-tolerance. IEEE Trans Comput, 2011, 62: 16\u201330","journal-title":"IEEE Trans Comput"},{"key":"4431_CR68","first-page":"135","volume-title":"Proceedings of the 2009 28th IEEE International Symposium on Reliable Distributed Systems","author":"G S Veronese","year":"2009","unstructured":"Veronese G S, Correia M, Bessani A N, et al. Spin one\u2019s wheels? Byzantine fault tolerance with a spinning primary. In: Proceedings of the 2009 28th IEEE International Symposium on Reliable Distributed Systems, 2009. 135\u2013144"},{"key":"4431_CR69","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/TDSC.2010.70","volume":"8","author":"Y Amir","year":"2010","unstructured":"Amir Y, Coan B, Kirsch J, et al. Prime: Byzantine replication under attack. IEEE Trans Dependable Secure Comput, 2010, 8: 564\u2013577","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"4431_CR70","volume-title":"Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation","author":"A Clement","year":"2009","unstructured":"Clement A, Wong E, Alvisi L, et al. Making Byzantine fault tolerant systems tolerate Byzantine faults. In: Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, 2009"},{"key":"4431_CR71","first-page":"1","volume-title":"Proceedings of the IEEE Conference on Computer Communications","author":"J Niu","year":"2021","unstructured":"Niu J, Gai F, Jalalzai M M, et al. On the performance of pipelined hotstuff. In: Proceedings of the IEEE Conference on Computer Communications, 2021. 1\u201310"},{"key":"4431_CR72","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/3492321.3519594","volume-title":"Proceedings of the Seventeenth European Conference on Computer Systems","author":"G Danezis","year":"2022","unstructured":"Danezis G, Kokoris-Kogias L, Sonnino A, et al. Narwhal and tusk: a dag-based mempool and efficient BFT consensus. In: Proceedings of the Seventeenth European Conference on Computer Systems, 2022. 34\u201350"},{"key":"4431_CR73","first-page":"2057","volume-title":"Proceedings of the 29th USENIX Security Symposium (USENIX Security 20)","author":"D Moghimi","year":"2020","unstructured":"Moghimi D, Sunar B, Eisenbarth T, et al. TPM-FAIL: TPM meets timing and lattice attacks. In: Proceedings of the 29th USENIX Security Symposium (USENIX Security 20), 2020. 2057\u20132073"},{"key":"4431_CR74","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1145\/3319535.3363205","volume-title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security","author":"S Zhao","year":"2019","unstructured":"Zhao S, Zhang Q, Qin Y, et al. SecTEE: a software-based approach to secure enclave architecture using TEE. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019. 1723\u20131740"},{"key":"4431_CR75","first-page":"282","volume-title":"Proceedings of the 19th International Symposium","author":"L Chen","year":"2017","unstructured":"Chen L, Xu L, Shah N, et al. On security analysis of proof-of-elapsed-time (POET). In: Proceedings of the 19th International Symposium, 2017. 282\u2013297"},{"key":"4431_CR76","first-page":"1","volume-title":"Proceedings of the 1st Workshop on System Software for Trusted Execution","author":"M Milutinovic","year":"2016","unstructured":"Milutinovic M, He W, Wu H, et al. Proof of luck: an efficient blockchain consensus protocol. In: Proceedings of the 1st Workshop on System Software for Trusted Execution, 2016. 1\u20136"},{"key":"4431_CR77","first-page":"1","volume":"62","author":"S Yandamuri","year":"2021","unstructured":"Yandamuri S, Abraham I, Nayak K, et al. Brief announcement: communication-efficient BFT using small trusted hardware to tolerate minority corruption. In: Proceedings of the 35th International Symposium on Distributed Computing (DISC 2021), 2021. 62:1\u201362:4","journal-title":"Proceedings of the 35th International Symposium on Distributed Computing (DISC 2021)"},{"key":"4431_CR78","first-page":"1","volume-title":"Proceedings of the Seventeenth European Conference on Computer Systems","author":"J Decouchant","year":"2022","unstructured":"Decouchant J, Kozhaya D, Rahli V, et al. Damysus: streamlined BFT consensus leveraging trusted components. In: Proceedings of the Seventeenth European Conference on Computer Systems, 2022. 1\u201316"},{"key":"4431_CR79","doi-asserted-by":"crossref","unstructured":"Gupta S, Rahnama S, Hellings J, et al. ResilientDB: global scale resilient blockchain fabric. 2020. ArXiv:2002.00160","DOI":"10.14778\/3380750.3380757"},{"key":"4431_CR80","doi-asserted-by":"publisher","first-page":"139104","DOI":"10.1007\/s11432-019-1516-3","volume":"65","author":"X Fu","year":"2022","unstructured":"Fu X, Wang H M, Shi P C, et al. Teegraph: trusted execution environment and directed acyclic graph-based consensus algorithm for IoT blockchains. Sci China Inf Sci, 2022, 65: 139104","journal-title":"Sci China Inf Sci"},{"key":"4431_CR81","first-page":"1392","volume-title":"Proceedings of the 2021 IEEE 37th International Conference on Data Engineering (ICDE)","author":"S Gupta","year":"2021","unstructured":"Gupta S, Hellings J, Sadoghi M. RCC: resilient concurrent consensus for high-throughput secure transaction processing. In: Proceedings of the 2021 IEEE 37th International Conference on Data Engineering (ICDE), 2021. 1392\u20131403"},{"key":"4431_CR82","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/3492321.3519579","volume-title":"Proceedings of the Seventeenth European Conference on Computer Systems","author":"C Stathakopoulou","year":"2022","unstructured":"Stathakopoulou C, Pavlovic M, Vukoli\u0107 M. State machine replication scalability made simple. In: Proceedings of the Seventeenth European Conference on Computer Systems, 2022. 17\u201333"},{"key":"4431_CR83","unstructured":"Huawei. Blockchain service (BCS). 2024. https:\/\/www.huaweicloud.com\/intl\/en-us\/product\/bcs.html"},{"key":"4431_CR84","doi-asserted-by":"publisher","first-page":"2841","DOI":"10.1145\/3548606.3560639","volume-title":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","author":"W Wang","year":"2022","unstructured":"Wang W, Deng S, Niu J, et al. Engraft: enclave-guarded raft on Byzantine faulty nodes. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022. 2841\u20132855"},{"key":"4431_CR85","first-page":"20","volume":"45","author":"S Zhang","year":"2018","unstructured":"Zhang S, Chai J, Chen Z, et al. Byzantine consensus algorithm based on gossip protocol. Comput Sci, 2018, 45: 20\u201324","journal-title":"Comput Sci"},{"key":"4431_CR86","first-page":"391","volume":"47","author":"Q Zhang","year":"2020","unstructured":"Zhang Q, Wang Z, Zhang Y. Research on trust collection consensus algorithm based on gossip protocol. Comput Sci, 2020, 47: 391\u2013394","journal-title":"Comput Sci"},{"key":"4431_CR87","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/DSN53405.2022.00018","volume-title":"Proceedings of the 2022 52nd Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN)","author":"X Sui","year":"2022","unstructured":"Sui X, Duan S, Zhang H. Marlin: two-phase BFT with linearity. In: Proceedings of the 2022 52nd Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), 2022. 54\u201366"},{"key":"4431_CR88","first-page":"279","volume-title":"Proceedings of the 25th USENIX Security Symposium (USENIX Security 16)","author":"E K Kogias","year":"2016","unstructured":"Kogias E K, Jovanovic P, Gailly N, et al. Enhancing bitcoin security and performance with strong consistency via collective signing. In: Proceedings of the 25th USENIX Security Symposium (USENIX Security 16), 2016. 279\u2013296"},{"key":"4431_CR89","volume-title":"Robust and scalable consensus for sharded distributed ledgers","author":"E Kokoris-Kogias","year":"2019","unstructured":"Kokoris-Kogias E. Robust and scalable consensus for sharded distributed ledgers. Cryptology ePrint Archive, 2019. https:\/\/eprint.iacr.org\/2019\/676"},{"key":"4431_CR90","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1109\/TPDS.2020.3042392","volume":"32","author":"W Li","year":"2020","unstructured":"Li W, Feng C, Zhang L, et al. A scalable multi-layer PBFT consensus for blockchain. IEEE Trans Parallel Distrib Syst, 2020, 32: 1146\u20131160","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4431_CR91","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2658994","volume":"32","author":"P L Aublin","year":"2015","unstructured":"Aublin P L, Guerraoui R, Kne\u017eevi\u0107 N, et al. The next 700 BFT protocols. ACM Trans Comput Syst, 2015, 32: 1\u201345","journal-title":"ACM Trans Comput Syst"},{"key":"4431_CR92","first-page":"357","volume-title":"Proceedings of the Annual International Cryptology Conference","author":"A Kiayias","year":"2017","unstructured":"Kiayias A, Russell A, David B, et al. Ouroboros: a provably secure proof-of-stake blockchain protocol. In: Proceedings of the Annual International Cryptology Conference, 2017. 357\u2013388"},{"key":"4431_CR93","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-030-51280-4_2","volume-title":"Proceedings of the International Conference on Financial Cryptography and Data Security","author":"Q Wang","year":"2020","unstructured":"Wang Q, Yu J, Peng Z, et al. Security analysis on DBFT protocol of NEO. In: Proceedings of the International Conference on Financial Cryptography and Data Security, 2020. 20\u201331"},{"key":"4431_CR94","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/2976749.2978389","volume-title":"Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security","author":"L Luu","year":"2016","unstructured":"Luu L, Narayanan V, Zheng C, et al. A secure sharding protocol for open blockchains. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016. 17\u201330"},{"key":"4431_CR95","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/SP.2018.000-5","volume-title":"Proceedings of the 2018 IEEE Symposium on Security and Privacy (SP)","author":"E Kokoris-Kogias","year":"2018","unstructured":"Kokoris-Kogias E, Jovanovic P, Gasser L, et al. OmniLedger: a secure, scale-out, decentralized ledger via sharding. In: Proceedings of the 2018 IEEE Symposium on Security and Privacy (SP), 2018. 583\u2013598"},{"key":"4431_CR96","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1109\/SP.2014.37","volume-title":"Proceedings of the 2014 IEEE Symposium on Security and Privacy","author":"A Miller","year":"2014","unstructured":"Miller A, Juels A, Shi E, et al. Permacoin: repurposing bitcoin work for data preservation. In: Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014. 475\u2013490"},{"key":"4431_CR97","volume-title":"Spacecoin: a cryptocurrency based on proofs of space","author":"S Park","year":"2015","unstructured":"Park S, Pietrzak K, Alwen J, et al. Spacecoin: a cryptocurrency based on proofs of space. Cryptology ePrint Archive, 2015. https:\/\/www.allcryptowhitepapers.com\/wp-content\/uploads\/2018\/05\/Spacecoin.pdf"},{"key":"4431_CR98","doi-asserted-by":"publisher","first-page":"2415","DOI":"10.1109\/TSMC.2019.2913007","volume":"51","author":"F Xiang","year":"2021","unstructured":"Xiang F, Huaimin W, Peichang S. Proof of previous transactions (PoPT): an efficient approach to consensus for JCLedger. IEEE Trans Syst Man Cybern Syst, 2021, 51: 2415\u20132424","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"4431_CR99","first-page":"120","volume-title":"Proceedings of the 40th Annual Symposium on Foundations of Computer Science","author":"S Micali","year":"1999","unstructured":"Micali S, Rabin M, Vadhan S. Verifiable random functions. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999. 120\u2013130"},{"key":"4431_CR100","volume-title":"Ontology launches VBFT, a next-generation consensus mechanism, becoming one of the first VRF-based public chains","author":"T O Team","year":"2018","unstructured":"Team T O. Ontology launches VBFT, a next-generation consensus mechanism, becoming one of the first VRF-based public chains. 2018. https:\/\/medium.com\/ontologynetwork\/ontology-launches-vbft-a-next-generation-consensus-mechanism-becoming-one-of-the-first-vrf-based-91f782308db4"},{"key":"4431_CR101","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/3132747.3132757","volume-title":"Proceedings of the 26th Symposium on Operating Systems Principles","author":"Y Gilad","year":"2017","unstructured":"Gilad Y, Hemo R, Micali S, et al. Algorand: scaling Byzantine agreements for cryptocurrencies. In: Proceedings of the 26th Symposium on Operating Systems Principles, 2017. 51\u201368"},{"key":"4431_CR102","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/MSN57253.2022.00066","volume-title":"Proceedings of the 2022 18th International Conference on Mobility, Sensing and Networking (MSN)","author":"L Feng","year":"2022","unstructured":"Feng L, Ding Y, Tan Y, et al. Trusted-committee-based secure and scalable BFT consensus for consortium blockchain. In: Proceedings of the 2022 18th International Conference on Mobility, Sensing and Networking (MSN), 2022. 363\u2013370"},{"key":"4431_CR103","doi-asserted-by":"publisher","first-page":"2807","DOI":"10.1109\/TC.2015.2495213","volume":"65","author":"T Distler","year":"2015","unstructured":"Distler T, Cachin C, Kapitza R. Resource-efficient Byzantine fault tolerance. IEEE Trans Comput, 2015, 65: 2807\u20132819","journal-title":"IEEE Trans Comput"},{"key":"4431_CR104","first-page":"3382","volume":"37","author":"R Wang","year":"2020","unstructured":"Wang R, Zhang L, Xu Q, et al. Byzantine fault-tolerant consensus algorithm that can be applied to the alliance chain. Appl Res Comput, 2020, 37: 3382\u20133386","journal-title":"Appl Res Comput"},{"key":"4431_CR105","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/1095809.1095817","volume":"39","author":"M Abd-El-Malek","year":"2005","unstructured":"Abd-El-Malek M, Ganger G R, Goodson G R, et al. Fault-scalable Byzantine fault-tolerant services. SIGOPS Oper Syst Rev, 2005, 39: 59\u201374","journal-title":"SIGOPS Oper Syst Rev"},{"key":"4431_CR106","first-page":"177","volume-title":"Proceedings of the 7th Symposium on Operating Systems Design and Implementation","author":"J Cowling","year":"2006","unstructured":"Cowling J, Myers D, Liskov B, et al. Hq replication: a hybrid quorum protocol for Byzantine fault tolerance. In: Proceedings of the 7th Symposium on Operating Systems Design and Implementation, 2006. 177\u2013190"},{"key":"4431_CR107","unstructured":"Stathakopoulou C, David T, Pavlovic M, et al. Mir-BFT: high-throughput robust BFT for decentralized networks. 2019. ArXiv:1906.05552"},{"key":"4431_CR108","unstructured":"Voron G, Gramoli V. Dispel: Byzantine SMR with distributed pipelining. 2019. ArXiv:1912.10367"},{"key":"4431_CR109","doi-asserted-by":"crossref","unstructured":"Arun B, Ravindran B. Scalable Byzantine fault tolerance via partial decentralization. 2022. ArXiv:2202.13408","DOI":"10.14778\/3538598.3538599"},{"key":"4431_CR110","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/3460537.3460560","volume-title":"Proceedings of the 2021 3rd International Conference on Blockchain Technology","author":"Y Bai","year":"2021","unstructured":"Bai Y, Zhi Y, Li H, et al. On parallel mechanism of consortium blockchain: take POV as an example. In: Proceedings of the 2021 3rd International Conference on Blockchain Technology, 2021. 147\u2013154"},{"key":"4431_CR111","first-page":"3656","volume-title":"Proceedings of the 2021 IEEE International Conference on Big Data","author":"Z Wang","year":"2021","unstructured":"Wang Z, Li H, Wang H, et al. A data lightweight scheme for parallel proof of vote consensus. In: Proceedings of the 2021 IEEE International Conference on Big Data, 2021. 3656\u20133662"},{"key":"4431_CR112","first-page":"3215","volume-title":"Proceedings of the 2022 IEEE International Conference on Big Data","author":"Z Xiao","year":"2022","unstructured":"Xiao Z, Li H, Wang H, et al. Optimizing parallel proof of vote consensus based on mimic security in consortium blockchains. In: Proceedings of the 2022 IEEE International Conference on Big Data, 2022. 3215\u20133224"},{"key":"4431_CR113","first-page":"466","volume-title":"Proceedings of the 2017 IEEE 19th International Conference on High Performance Computing and Communications; IEEE 15th International Conference on Smart City; IEEE 3rd International Conference on Data Science and Systems (HPCC\/SmartCity\/DSS)","author":"K Li","year":"2017","unstructured":"Li K, Li H, Hou H, et al. Proof of vote: a high-performance consensus protocol based on vote mechanism & consortium blockchain. In: Proceedings of the 2017 IEEE 19th International Conference on High Performance Computing and Communications; IEEE 15th International Conference on Smart City; IEEE 3rd International Conference on Data Science and Systems (HPCC\/SmartCity\/DSS), 2017. 466\u2013473"},{"key":"4431_CR114","doi-asserted-by":"publisher","first-page":"11","DOI":"10.3389\/fbloc.2020.00011","volume":"3","author":"K Li","year":"2020","unstructured":"Li K, Li H, Wang H, et al. PoV: an efficient voting-based consensus algorithm for consortium blockchains. Front Blockchain, 2020, 3: 11","journal-title":"Front Blockchain"},{"key":"4431_CR115","first-page":"565","volume-title":"Proceedings of the 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS)","author":"B Arun","year":"2019","unstructured":"Arun B, Peluso S, Ravindran B. ezBFT: decentralizing Byzantine fault-tolerant state machine replication. In: Proceedings of the 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS), 2019. 565\u2013577"},{"key":"4431_CR116","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1109\/SP40001.2021.00045","volume-title":"Proceedings of the 2021 IEEE Symposium on Security and Privacy (SP)","author":"J Neu","year":"2021","unstructured":"Neu J, Tas E N, Tse D. Ebb-and-flow protocols: a resolution of the availability-finality dilemma. In: Proceedings of the 2021 IEEE Symposium on Security and Privacy (SP), 2021. 446\u2013465"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-024-4431-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-024-4431-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-024-4431-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T23:02:24Z","timestamp":1761606144000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-024-4431-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,24]]},"references-count":116,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["4431"],"URL":"https:\/\/doi.org\/10.1007\/s11432-024-4431-y","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,24]]},"assertion":[{"value":"22 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"111102"}}