{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T23:57:00Z","timestamp":1781308620582,"version":"3.54.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T00:00:00Z","timestamp":1751846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T00:00:00Z","timestamp":1751846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Innovation Project of GUET Graduate Education","award":["2024YCXS051"],"award-info":[{"award-number":["2024YCXS051"]}]},{"DOI":"10.13039\/501100015646","name":"Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology","doi-asserted-by":"publisher","award":["KX202328"],"award-info":[{"award-number":["KX202328"]}],"id":[{"id":"10.13039\/501100015646","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>The Practical Byzantine Fault Tolerance consensus algorithm faces several challenges in large-scale networks, such as the simplistic primary node selection, high communication overhead, poor scalability, and low costs for malicious behavior. To address these issues, this paper proposes a Grouped Byzantine Fault-Tolerant Consensus Algorithm based on aggregated signatures (GABFT). This algorithm utilizes aggregated signature technology to reduce both communication and storage overhead by combining the signatures of multiple nodes into a single signature. This effectively prevents dishonest behavior by proxy nodes and ensures the security of the consensus. Additionally, we have developed the HonestPeer++ reputation model. It assigns trust values to each node and regulates node behavior through a penalty mechanism. The optimized consensus protocol adopts node grouping and one-to-many communication, achieving linear communication complexity and enhancing system scalability and consensus efficiency. Experimental results show that the GABFT algorithm significantly improves system throughput and scalability while reducing latency and communication overhead, making it well-suited for large-scale networks.<\/jats:p>","DOI":"10.1186\/s42400-025-00362-9","type":"journal-article","created":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T00:03:13Z","timestamp":1751846593000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Grouped Byzantine fault tolerant consensus algorithm based on aggregated signatures"],"prefix":"10.1186","volume":"8","author":[{"given":"Yong","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3491-3259","authenticated-orcid":false,"given":"Qiancheng","family":"Wan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yifan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lijie","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,7]]},"reference":[{"key":"362_CR1","doi-asserted-by":"publisher","first-page":"102199","DOI":"10.1016\/j.ijinfomgt.2020.102199","volume":"54","author":"O Ali","year":"2020","unstructured":"Ali O, Ally M, Clutterbuck Dwivedi Y (2020) The state of play of blockchain technology in the financial services sector: a systematic literature review. Int J Inf Manage 54:102199. https:\/\/doi.org\/10.1016\/j.ijinfomgt.2020.102199","journal-title":"Int J Inf Manage"},{"key":"362_CR2","doi-asserted-by":"publisher","unstructured":"Bacho R, Loss J (2022) On the adaptive security of the threshold bls signature scheme. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201922, pp. 193\u2013207. Association for Computing Machinery, New York, NY, USA .https:\/\/doi.org\/10.1145\/3548606.3560656","DOI":"10.1145\/3548606.3560656"},{"key":"362_CR3","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, Babaei Bondarti A (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":"362_CR4","volume-title":"Advances in Cryptology\u2014CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh D, Franklin M (2001) Identity-Based Encryption from the Weil Pairing. In: Kilian J (ed) Advances in Cryptology\u2014CRYPTO 2001. Springer, Berlin"},{"key":"362_CR5","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh D, Lynn B, Shacham H (2001) Short Signatures from the Weil Pairing. In: Boyd C (ed) Advances in Cryptology\u2014ASIACRYPT 2001. Springer, Berlin"},{"key":"362_CR6","doi-asserted-by":"publisher","unstructured":"Cason D, Fynn E, Milosevic N, Milosevic Z, Buchman E, Pedone F (2021) The design, architecture and performance of the tendermint blockchain network. In: 2021 40th International Symposium on Reliable Distributed Systems (SRDS), pp. 23\u201333. https:\/\/doi.org\/10.1109\/SRDS53918.2021.00012","DOI":"10.1109\/SRDS53918.2021.00012"},{"issue":"4","key":"362_CR7","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"},{"key":"362_CR8","doi-asserted-by":"publisher","first-page":"28712","DOI":"10.1109\/ACCESS.2019.2901858","volume":"7","author":"E Deirmentzoglou","year":"2019","unstructured":"Deirmentzoglou E, Papakyriakopoulos G, Patsakis C (2019) A survey on long-range attacks for proof of stake protocols. IEEE Access 7:28712\u201328725. https:\/\/doi.org\/10.1109\/ACCESS.2019.2901858","journal-title":"IEEE Access"},{"issue":"3","key":"362_CR9","doi-asserted-by":"publisher","first-page":"2114","DOI":"10.1109\/TSC.2022.3201568","volume":"16","author":"X Feng","year":"2023","unstructured":"Feng X, Ma J, Miao Y, Liu X, Choo K-KR (2023) Regulatable and hardware-based proof of stake to approach nothing at stake and long range attacks. IEEE Trans Serv Comput 16(3):2114\u20132125. https:\/\/doi.org\/10.1109\/TSC.2022.3201568","journal-title":"IEEE Trans Serv Comput"},{"issue":"12","key":"362_CR10","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":"362_CR11","doi-asserted-by":"publisher","unstructured":"Golan\u00a0Gueta 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: 2019 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 568\u2013580. https:\/\/doi.org\/10.1109\/DSN.2019.00063","DOI":"10.1109\/DSN.2019.00063"},{"key":"362_CR12","doi-asserted-by":"publisher","first-page":"100585","DOI":"10.1016\/j.cosrev.2023.100585","volume":"50","author":"V Gugueoth","year":"2023","unstructured":"Gugueoth V, Safavat S, Shetty S, Rawat D (2023) A review of iot security and privacy using decentralized blockchain techniques. Comput Sci Rev 50:100585. https:\/\/doi.org\/10.1016\/j.cosrev.2023.100585","journal-title":"Comput Sci Rev"},{"issue":"6","key":"362_CR13","doi-asserted-by":"publisher","first-page":"4291","DOI":"10.1109\/JIOT.2020.3028449","volume":"8","author":"C Huang","year":"2021","unstructured":"Huang C, Wang Z, Chen H, Hu Q, Zhang Q, Wang W, Guan X (2021) Repchain: a reputation-based secure, fast, and high incentive blockchain system via sharding. IEEE Int Things J 8(6):4291\u20134304. https:\/\/doi.org\/10.1109\/JIOT.2020.3028449","journal-title":"IEEE Int Things J"},{"issue":"1","key":"362_CR14","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1186\/s42400-023-00163-y","volume":"6","author":"Z Hussein","year":"2023","unstructured":"Hussein Z, Salama MA, El-Rahman SA (2023) Evolution of blockchain consensus algorithms: a review on the latest milestones of blockchain consensus algorithms. Cybersecurity 6(1):30. https:\/\/doi.org\/10.1186\/s42400-023-00163-y","journal-title":"Cybersecurity"},{"key":"362_CR15","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.future.2023.02.008","volume":"143","author":"T Huynh-The","year":"2023","unstructured":"Huynh-The T, Gadekallu TR, Wang W, Yenduri G, Ranaweera P, Pham Q-V, da Costa DB, Liyanage M (2023) Blockchain for the metaverse: a review. Futur Gener Comput Syst 143:401\u2013419. https:\/\/doi.org\/10.1016\/j.future.2023.02.008","journal-title":"Futur Gener Comput Syst"},{"issue":"5","key":"362_CR16","doi-asserted-by":"publisher","first-page":"2591","DOI":"10.1007\/s12083-023-01550-5","volume":"16","author":"Y Jiang","year":"2023","unstructured":"Jiang Y, Guan Y (2023) A cluster reputation-based hierarchical consensus model in blockchain. Peer-to-Peer Netw Appl 16(5):2591\u20132606. https:\/\/doi.org\/10.1007\/s12083-023-01550-5","journal-title":"Peer-to-Peer Netw Appl"},{"key":"362_CR17","doi-asserted-by":"publisher","unstructured":"Kamvar SD, Schlosser MT, Garcia-Molina H (2003) The eigentrust algorithm for reputation management in p2p networks. In: Proceedings of the 12th International Conference on World Wide Web. WWW \u201903, pp. 640\u2013651. Association for Computing Machinery, New York, NY, USA .https:\/\/doi.org\/10.1145\/775152.775242","DOI":"10.1145\/775152.775242"},{"key":"362_CR18","volume-title":"Financial Cryptography and Data Security","author":"K Karantias","year":"2020","unstructured":"Karantias K, Kiayias A, Zindros D (2020) Proof-of-Burn. In: Bonneau J, Heninger N (eds) Financial Cryptography and Data Security. Springer, Cham"},{"key":"362_CR19","doi-asserted-by":"publisher","first-page":"100609","DOI":"10.1016\/j.vehcom.2023.100609","volume":"41","author":"A Kumar","year":"2023","unstructured":"Kumar A, Vishwakarma L, Das D (2023) R-pbft: A secure and intelligent consensus algorithm for internet of vehicles. Vehicular Commun 41:100609. https:\/\/doi.org\/10.1016\/j.vehcom.2023.100609","journal-title":"Vehicular Commun"},{"issue":"3","key":"362_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.jksuci.2014.10.002","volume":"27","author":"HA Kurdi","year":"2015","unstructured":"Kurdi HA (2015) HonestPeer: An enhanced EigenTrust algorithm for reputation management in P2P systems. J King Saud Univ Comput Inform Sci 27(3):315\u2013322. https:\/\/doi.org\/10.1016\/j.jksuci.2014.10.002","journal-title":"J King Saud Univ Comput Inform Sci"},{"key":"362_CR21","doi-asserted-by":"publisher","unstructured":"Lamport L, Shostak R, Pease M (2019) The Byzantine generals problem, pp. 203\u2013226. Association for Computing Machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/3335772.3335936","DOI":"10.1145\/3335772.3335936"},{"key":"362_CR22","doi-asserted-by":"publisher","first-page":"109118","DOI":"10.1016\/j.comnet.2022.109118","volume":"214","author":"N Lasla","year":"2022","unstructured":"Lasla N, Al-Sahan L, Abdallah M, Younis M (2022) Green-pow: an energy-efficient blockchain proof-of-work consensus algorithm. Comput Netw 214:109118. https:\/\/doi.org\/10.1016\/j.comnet.2022.109118","journal-title":"Comput Netw"},{"issue":"5","key":"362_CR23","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 Distrib Syst 32(5):1146\u20131160. https:\/\/doi.org\/10.1109\/TPDS.2020.3042392","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"362_CR24","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/s12083-022-01373-w","volume":"16","author":"J Li","year":"2023","unstructured":"Li J, Li X, Zhao H, Yu B, Zhou T, Cheng H, Sheng N (2023) MANDALA: a scalable blockchain model with mesh-and-spoke network and H-PBFT consensus algorithm. Peer-to-Peer Netw Appl 16(1):226\u2013244. https:\/\/doi.org\/10.1007\/s12083-022-01373-w","journal-title":"Peer-to-Peer Netw Appl"},{"key":"362_CR25","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":"3","key":"362_CR26","doi-asserted-by":"publisher","first-page":"4367","DOI":"10.1109\/JSYST.2020.3019923","volume":"15","author":"C Lin","year":"2021","unstructured":"Lin C, He D, Huang X, Xie X, Choo K-KR (2021) Ppchain: a privacy-preserving permissioned blockchain architecture for cryptocurrency and other regulated applications. IEEE Syst J 15(3):4367\u20134378. https:\/\/doi.org\/10.1109\/JSYST.2020.3019923","journal-title":"IEEE Syst J"},{"issue":"1","key":"362_CR27","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TC.2018.2860009","volume":"68","author":"J Liu","year":"2019","unstructured":"Liu J, Li W, Karame GO, Asokan N (2019) Scalable byzantine consensus via hardware-assisted secret sharing. IEEE Trans Comput 68(1):139\u2013151. https:\/\/doi.org\/10.1109\/TC.2018.2860009","journal-title":"IEEE Trans Comput"},{"key":"362_CR28","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.future.2023.12.023","volume":"154","author":"Y Liu","year":"2024","unstructured":"Liu Y, Liu Z, Zhang Q, Su J, Cai Z, Li X (2024) Blockchain and trusted reputation assessment-based incentive mechanism for healthcare services. Futur Gener Comput Syst 154:59\u201371. https:\/\/doi.org\/10.1016\/j.future.2023.12.023","journal-title":"Futur Gener Comput Syst"},{"key":"362_CR29","doi-asserted-by":"publisher","first-page":"107882","DOI":"10.1016\/j.ijpe.2020.107882","volume":"228","author":"J Lohmer","year":"2020","unstructured":"Lohmer J, Bugert N, Lasch R (2020) Analysis of resilience strategies and ripple effect in blockchain-coordinated supply chains: An agent-based simulation study. Int J Prod Econ 228:107882. https:\/\/doi.org\/10.1016\/j.ijpe.2020.107882","journal-title":"Int J Prod Econ"},{"key":"362_CR30","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 2016 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201916, pp. 31\u201342. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/2976749.2978399","DOI":"10.1145\/2976749.2978399"},{"key":"362_CR31","unstructured":"Nakamoto S (2008) Bitcoin: a peer-to-peer electronic cash system. Decentralized Business Review. https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"362_CR32","doi-asserted-by":"publisher","unstructured":"Pal A, Kant K (2021) Dc-poet: Proof-of-elapsed-time consensus with distributed coordination for blockchain networks. In: 2021 IFIP Networking Conference (IFIP Networking), pp. 1\u20139.https:\/\/doi.org\/10.23919\/IFIPNetworking52078.2021.9472787","DOI":"10.23919\/IFIPNetworking52078.2021.9472787"},{"issue":"3","key":"362_CR33","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. Rev Financ Stud 34(3):1156\u20131190. https:\/\/doi.org\/10.1093\/rfs\/hhaa075","journal-title":"Rev Financ Stud"},{"key":"362_CR34","doi-asserted-by":"publisher","first-page":"100362","DOI":"10.1016\/j.cosrev.2021.100362","volume":"39","author":"Q Wang","year":"2021","unstructured":"Wang Q, Li R, Zhan L (2021) Blockchain technology in the energy sector: from basic research to real world applications. Comput Sci Rev 39:100362. https:\/\/doi.org\/10.1016\/j.cosrev.2021.100362","journal-title":"Comput Sci Rev"},{"issue":"6","key":"362_CR35","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"},{"issue":"1","key":"362_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. https:\/\/doi.org\/10.1038\/s41598-022-15282-8","journal-title":"Sci Rep"},{"issue":"10","key":"362_CR37","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1002\/spe.2748","volume":"51","author":"F Xiang","year":"2021","unstructured":"Xiang F, Huaimin W, Peichang S, Xue O, Xunhui Z (2021) Jointgraph: a dag-based efficient consensus algorithm for consortium blockchains. Software Practice Experience 51(10):1987\u20131999. https:\/\/doi.org\/10.1002\/spe.2748","journal-title":"Software Practice Experience"},{"issue":"2","key":"362_CR38","doi-asserted-by":"publisher","first-page":"101957","DOI":"10.1016\/j.jksuci.2024.101957","volume":"36","author":"J Xiao","year":"2024","unstructured":"Xiao J, Luo T, Li C, Zhou J, Li Z (2024) Ce-pbft: A high availability consensus algorithm for large-scale consortium blockchain. J King Saud Univ Comput Inform Sci 36(2):101957. https:\/\/doi.org\/10.1016\/j.jksuci.2024.101957","journal-title":"J King Saud Univ Comput Inform Sci"},{"key":"362_CR39","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.ins.2022.12.068","volume":"624","author":"J Xu","year":"2023","unstructured":"Xu J, Zhao Y, Chen H, Deng W (2023) Abc-gspbft: Pbft with grouping score mechanism and optimized consensus process for flight operation data-sharing. Inf Sci 624:110\u2013127. https:\/\/doi.org\/10.1016\/j.ins.2022.12.068","journal-title":"Inf Sci"},{"key":"362_CR40","doi-asserted-by":"publisher","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 \u201919, pp. 347\u2013356. Association for Computing Machinery, New York, NY, USA . https:\/\/doi.org\/10.1145\/3293611.3331591","DOI":"10.1145\/3293611.3331591"},{"key":"362_CR41","doi-asserted-by":"publisher","DOI":"10.1145\/3636553","author":"G Zhang","year":"2024","unstructured":"Zhang G, Pan F, Mao Y, Tijanic S, Dang\u2019ana M, Motepalli S, Zhang S, Jacobsen H-A (2024) Reaching consensus in the byzantine empire: a comprehensive review of bft consensus algorithms. ACM Comput Surv. https:\/\/doi.org\/10.1145\/3636553","journal-title":"ACM Comput Surv"},{"key":"362_CR42","doi-asserted-by":"publisher","unstructured":"Zhang M, Li J, Chen Z, Chen H, Deng X (2020) Cycledger: A scalable and secure parallel protocol for distributed ledger via sharding. In: 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 358\u2013367 . https:\/\/doi.org\/10.1109\/IPDPS47924.2020.00045","DOI":"10.1109\/IPDPS47924.2020.00045"},{"issue":"12","key":"362_CR43","doi-asserted-by":"publisher","first-page":"4296","DOI":"10.1109\/TMC.2021.3074934","volume":"21","author":"H Zhao","year":"2022","unstructured":"Zhao H, Deng S, Liu Z, Xiang Z, Yin J, Dustdar S, Zomaya AY (2022) Dpos: decentralized, privacy-preserving, and low-complexity online slicing for multi-tenant networks. IEEE Trans Mob Comput 21(12):4296\u20134309. https:\/\/doi.org\/10.1109\/TMC.2021.3074934","journal-title":"IEEE Trans Mob Comput"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00362-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00362-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00362-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T00:03:15Z","timestamp":1751846595000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-025-00362-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,7]]},"references-count":43,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["362"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00362-9","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,7]]},"assertion":[{"value":"26 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2025","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 that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"60"}}