{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T09:35:10Z","timestamp":1767519310061,"version":"3.48.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T00:00:00Z","timestamp":1767484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T00:00:00Z","timestamp":1767484800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007957","name":"Chongqing Education Commission","doi-asserted-by":"crossref","award":["KJZD-K202400610"],"award-info":[{"award-number":["KJZD-K202400610"]}],"id":[{"id":"10.13039\/501100007957","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005230","name":"Chongqing Natural Science Foundation","doi-asserted-by":"crossref","award":["CSTB2025NSCQ-GPX1263"],"award-info":[{"award-number":["CSTB2025NSCQ-GPX1263"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Key Research and Development Program of China","award":["YFF0704102"],"award-info":[{"award-number":["YFF0704102"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Private Information Retrieval (PIR) is a cryptographic technique that allows Data User (DU) to retrieve data from a SERVER without revealing which specific data item is being accessed. Traditional PIR protocols typically assume that the data is locally stored and directly controlled by Data Owner (DO), but in real-world scenarios, data is often hosted on untrusted third-party SERVERs, making it difficult for DO to effectively restrict the SERVER\u2019s access to their data or control which DU is authorized to retrieve the data. Consequently, malicious SERVERs or unauthorized DU may infringe upon the privacy rights of DO. This paper presents SecOutPIR, a novel outsourced PIR system that addresses two key challenges: privacy preservation for DO and access control for DU. SecOutPIR integrates attribute-based encryption for fine-grained retrieval access control to ensure that only DU with valid retrieval can access the data, while also utilizing a decentralized identity management system based on decentralized identifiers and verifiable credentials to authenticate DU requests. The proposed system ensures that the DO\u2019s data privacy is protected during data storage and retrieval, while also ensuring that only DU with authorized retrieval can make retrieval requests, thus preventing unauthorized access. We provide a detailed description of the system model, security requirements, and an in-depth security analysis. Furthermore, experimental results demonstrate that SecOutPIR significantly enhances the practicality and efficiency of PIR in outsourced settings by enabling fine-grained retrieval access control without degrading query performance. Our implementation demonstrates that the SERVER reply time increases with the dataset size, from 82.5 ms (1000 entries) to 113.8 ms (2000 entries) and 199.6 ms (5000 entries), while the query generation time remains approximately constant at around 2.0 ms.<\/jats:p>","DOI":"10.1186\/s42400-025-00533-8","type":"journal-article","created":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T09:33:17Z","timestamp":1767519197000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SecOutPIR: privacy preservation for data owner and access control for data user in outsourced private information retrieval"],"prefix":"10.1186","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0048-9876","authenticated-orcid":false,"given":"Fei","family":"Tang","sequence":"first","affiliation":[]},{"given":"Ruixue","family":"Li","sequence":"additional","affiliation":[]},{"given":"Huihui","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Mingjie","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,4]]},"reference":[{"issue":"4","key":"533_CR1","doi-asserted-by":"publisher","first-page":"643","DOI":"10.14778\/3574245.3574251","volume":"16","author":"I Ahmad","year":"2022","unstructured":"Ahmad I, Agrawal D, Abbadi AE, Gupta T (2022) Pantheon: private retrieval from public key-value store. Proc VLDB Endow 16(4):643\u2013656. https:\/\/doi.org\/10.14778\/3574245.3574251","journal-title":"Proc VLDB Endow"},{"key":"533_CR2","unstructured":"Ali A, Lepoint T, Patel S, Raykova M, Schoppmann P, Seth K, Yeo K (2019) Communication-computation trade-offs in pir. In: IACR cryptology ePrint Archive. https:\/\/api.semanticscholar.org\/CorpusID:209466032"},{"key":"533_CR3","doi-asserted-by":"publisher","first-page":"4795","DOI":"10.1109\/TDSC.2025.3553868","volume":"22","author":"MA Al-Shareeda","year":"2025","unstructured":"Al-Shareeda MA, Gaber T, Alqarni MA, Alkinani MH, Almazroey AA, Almazroi AA (2025) Chebyshev polynomial based emergency conditions with authentication scheme for 5g-assisted vehicular fog computing. IEEE Trans Dependable Secure Comput 22:4795\u20134812","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"533_CR4","doi-asserted-by":"publisher","unstructured":"Angel S, Chen H, Laine K, Setty S (2018) Pir with compressed queries and amortized query processing. In: 2018 IEEE symposium on security and privacy (SP), pp 962\u2013979. https:\/\/doi.org\/10.1109\/SP.2018.00062","DOI":"10.1109\/SP.2018.00062"},{"key":"533_CR5","doi-asserted-by":"crossref","unstructured":"Burton A, Menon SJ, Wu DJ (2024) Respire: high-rate pir for databases with small records. Proceedings of the 2024 on ACM SIGSAC conference on computer and communications security","DOI":"10.1145\/3658644.3690328"},{"key":"533_CR6","doi-asserted-by":"publisher","unstructured":"Celi S, Davidson A (2024) Call me by my name: simple, practical private information retrieval for keyword queries. In: Proceedings of the 2024 on ACM SIGSAC conference on computer and communications security. CCS \u201924, pp. 4107\u20134121. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3658644.3670271","DOI":"10.1145\/3658644.3670271"},{"issue":"6","key":"533_CR7","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor B, Kushilevitz E, Goldreich O, Sudan M (1998) Private information retrieval. J ACM 45(6):965\u2013981. https:\/\/doi.org\/10.1145\/293347.293350","journal-title":"J ACM"},{"key":"533_CR8","unstructured":"Davidson A, Pestana G, Celi S (2022) FrodoPIR: simple, scalable, single-server private information retrieval. Cryptology ePrint Archive, Paper 2022\/981. https:\/\/eprint.iacr.org\/2022\/981"},{"key":"533_CR9","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1109\/JSTSP.2015.2432740","volume":"9","author":"GC Fanti","year":"2015","unstructured":"Fanti GC, Ramchandran K (2015) Efficient private information retrieval over unsynchronized databases. IEEE J Sel Topics Signal Proc 9:1229\u20131239","journal-title":"IEEE J Sel Topics Signal Proc"},{"key":"533_CR10","doi-asserted-by":"crossref","unstructured":"Gasc\u00f3n A, Ishai Y, Kelkar M, Li B, Ma Y, Raykova M (2024) Computationally secure aggregation and private information retrieval in the shuffle model. In: Proceedings of the 2024 on ACM SIGSAC conference on computer and communications security","DOI":"10.1145\/3658644.3670391"},{"key":"533_CR11","doi-asserted-by":"crossref","unstructured":"Gong T, Henry R, Psomas A, Kate A (2022) More is merrier: relax the non-collusion assumption in multi-server pir. In: 2024 IEEE symposium on security and privacy (SP), pp 4348\u20134366","DOI":"10.1109\/SP54263.2024.00095"},{"key":"533_CR12","doi-asserted-by":"crossref","unstructured":"Grissa M, Yavuz AA, Hamdaoui B (2014) Lpos: location privacy for optimal sensing in cognitive radio networks. In: 2015 IEEE global communications conference (GLOBECOM), pp 1\u20136","DOI":"10.1109\/GLOCOM.2014.7417611"},{"key":"533_CR13","unstructured":"G\u00fcnther D, Heymann M, Pinkas B, Schneider T (2022) GPU-accelerated PIR with client-independent preprocessing for large-scale applications. In: 31st USENIX security symposium (USENIX Security 22), pp 1759\u20131776. USENIX Association, Boston, MA. https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/gunther"},{"key":"533_CR14","doi-asserted-by":"publisher","unstructured":"Guo T, Zhou R, Tian C (2020) On the information leakage in private information retrieval systems. In: 2020 IEEE international symposium on information theory (ISIT), pp 1018\u20131023. https:\/\/doi.org\/10.1109\/ISIT44484.2020.9174308","DOI":"10.1109\/ISIT44484.2020.9174308"},{"key":"533_CR15","doi-asserted-by":"publisher","unstructured":"Hafiz SM, Henry R (2017) Querying for queries: indexes of queries for efficient and expressive it-pir. In: Proceedings of the 2017 ACM conference on computer and communications security (CCS) https:\/\/doi.org\/10.1145\/3133956.3134008","DOI":"10.1145\/3133956.3134008"},{"key":"533_CR16","unstructured":"Henzinger A, Hong MM, Corrigan-Gibbs H, Meiklejohn S, Vaikuntanathan V (2023) One server for the price of two: simple and fast single-server private information retrieval. In: Proceedings of the 32nd USENIX conference on security symposium. SEC \u201923. USENIX Association, USA"},{"issue":"1","key":"533_CR17","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TDSC.2023.3253786","volume":"21","author":"C Huang","year":"2024","unstructured":"Huang C, Liu D, Yang A, Lu R, Shen X (2024) Multi-client secure and efficient dpf-based keyword search for cloud storage. IEEE Trans Dependable Secure Comput 21(1):353\u2013371. https:\/\/doi.org\/10.1109\/TDSC.2023.3253786","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"533_CR18","doi-asserted-by":"publisher","unstructured":"Ji S, Yang Z, Chen X, Cahoon S, Hu J, Shi Y, Jones AK, Zhou P (2024) Scarif: towards carbon modeling of cloud servers with accelerators. In: 2024 IEEE computer society annual symposium on VLSI (ISVLSI), pp 496\u2013501. https:\/\/doi.org\/10.1109\/ISVLSI61997.2024.00095","DOI":"10.1109\/ISVLSI61997.2024.00095"},{"issue":"12","key":"533_CR19","doi-asserted-by":"publisher","first-page":"12302","DOI":"10.1109\/TVT.2018.2876683","volume":"67","author":"MK Kiskani","year":"2018","unstructured":"Kiskani MK, Sadjadpour HR (2018) Secure and private information retrieval (sapir) in cloud storage systems. IEEE Trans Veh Technol 67(12):12302\u201312312. https:\/\/doi.org\/10.1109\/TVT.2018.2876683","journal-title":"IEEE Trans Veh Technol"},{"issue":"1","key":"533_CR20","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1109\/TCC.2021.3098420","volume":"11","author":"D Li","year":"2023","unstructured":"Li D, Wu J, Le J, Liao X, Xiang T (2023) A novel privacy-preserving location-based services search scheme in outsourced cloud. IEEE Trans Cloud Comput 11(1):457\u2013469. https:\/\/doi.org\/10.1109\/TCC.2021.3098420","journal-title":"IEEE Trans Cloud Comput"},{"key":"533_CR21","doi-asserted-by":"publisher","unstructured":"Lin W-K, Mook E, Wichs D (2023) Doubly efficient private information retrieval and fully homomorphic ram computation from ring lwe. In: Proceedings of the 55th annual ACM symposium on theory of computing. STOC 2023, pp 595\u2013608. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3564246.3585175","DOI":"10.1145\/3564246.3585175"},{"issue":"2","key":"533_CR22","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1109\/TIT.2021.3126865","volume":"68","author":"H-Y Lin","year":"2022","unstructured":"Lin H-Y, Kumar S, Rosnes E, Amat A, Yaakobi E (2022) Multi-server weakly-private information retrieval. IEEE Trans Inf Theor 68(2):1197\u20131219. https:\/\/doi.org\/10.1109\/TIT.2021.3126865","journal-title":"IEEE Trans Inf Theor"},{"key":"533_CR23","unstructured":"Mahdavi RA, Kerschbaum F (2022) Constant-weight PIR: single-round keyword PIR via constant-weight equality operators. In: 31st USENIX security symposium (USENIX Security 22), pp 1723\u20131740. USENIX Association, Boston, MA. https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/mahdavi"},{"key":"533_CR24","unstructured":"Ma Y, Zhong K, Rabin T, Angel S (2022) Incremental Offline\/Online PIR. In: 31st USENIX security symposium (USENIX Security 22), pp 1741\u20131758. USENIX Association, Boston, MA. https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/ma"},{"key":"533_CR25","doi-asserted-by":"publisher","unstructured":"Menon SJ, Wu DJ (2022) Spiral: fast, high-rate single-server pir via fhe composition. In: 2022 IEEE symposium on security and privacy (SP), pp 930\u2013947. https:\/\/doi.org\/10.1109\/SP46214.2022.9833700","DOI":"10.1109\/SP46214.2022.9833700"},{"key":"533_CR26","doi-asserted-by":"publisher","unstructured":"Menon SJ, Wu DJ (2022) Spiral: fast, high-rate single-server pir via fhe composition. In: 2022 IEEE symposium on security and privacy (SP), pp. 930\u2013947. https:\/\/doi.org\/10.1109\/SP46214.2022.9833700","DOI":"10.1109\/SP46214.2022.9833700"},{"issue":"6","key":"533_CR27","doi-asserted-by":"publisher","first-page":"1446","DOI":"10.3390\/math11061446","volume":"11","author":"BA Mohammed","year":"2023","unstructured":"Mohammed BA, Al-Shareeda MA, Manickam S, Al-Mekhlafi ZG, Alayba AM, Sallam AA (2023) Anaa-fog: a novel anonymous authentication scheme for 5g-enabled vehicular fog computing. Mathematics 11(6):1446","journal-title":"Mathematics"},{"key":"533_CR28","doi-asserted-by":"crossref","unstructured":"Mughees MH, Chen H, Ren L (2021) Onionpir: response efficient single-server pir. In: Proceedings of the 2021 ACM SIGSAC conference on computer and communications security, pp 2292\u20132306","DOI":"10.1145\/3460120.3485381"},{"key":"533_CR29","doi-asserted-by":"publisher","unstructured":"Mughees MH, Chen H, Ren L (2021) Onionpir: response efficient single-server pir. In: Proceedings of the 2021 ACM SIGSAC conference on computer and communications security. CCS \u201921, pp 2292\u20132306. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3460120.3485381","DOI":"10.1145\/3460120.3485381"},{"key":"533_CR30","doi-asserted-by":"crossref","unstructured":"Mughees MH, Ren L (2023) Vectorized batch private information retrieval. In: 2023 IEEE symposium on security and privacy (SP), pp 437\u2013452","DOI":"10.1109\/SP46215.2023.10179329"},{"issue":"1","key":"533_CR31","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1109\/TDSC.2010.60","volume":"9","author":"S Papadopoulos","year":"2012","unstructured":"Papadopoulos S, Bakiras S, Papadias D (2012) pCloud: a distributed system for practical pir. IEEE Trans Dependable Secure Comput 9(1):115\u2013127. https:\/\/doi.org\/10.1109\/TDSC.2010.60","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"533_CR32","doi-asserted-by":"publisher","unstructured":"Park A, Leong T, Maturana F, Zheng W, Rashmi KV (2024) Communication-efficient, fault tolerant PIR over erasure coded storage. In: 2024 IEEE symposium on security and privacy (SP), pp 4331\u20134347. IEEE Computer Society, Los Alamitos, CA, USA. https:\/\/doi.org\/10.1109\/SP54263.2024.00168","DOI":"10.1109\/SP54263.2024.00168"},{"key":"533_CR33","doi-asserted-by":"publisher","unstructured":"Patel S, Persiano G, Yeo K (2018) Private stateful information retrieval. In: Proceedings of the 2018 ACM SIGSAC conference on computer and communications security. CCS \u201918, pp. 1002\u20131019. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3243734.3243821","DOI":"10.1145\/3243734.3243821"},{"key":"533_CR34","doi-asserted-by":"publisher","unstructured":"Pournajaf L, Tahmasebian F, Xiong L, Sunderam V, Shahabi C (2018) Privacy preserving reverse k-nearest neighbor queries. In: 2018 19th IEEE international conference on mobile data management (MDM), pp 177\u2013186. https:\/\/doi.org\/10.1109\/MDM.2018.00035","DOI":"10.1109\/MDM.2018.00035"},{"key":"533_CR35","doi-asserted-by":"publisher","first-page":"3590","DOI":"10.1109\/TIT.2019.2955053","volume":"66","author":"N Raviv","year":"2018","unstructured":"Raviv N, Tamo I, Yaakobi E (2018) Private information retrieval in graph-based replication systems. IEEE Trans Inf Theory 66:3590\u20133602","journal-title":"IEEE Trans Inf Theory"},{"key":"533_CR36","doi-asserted-by":"publisher","unstructured":"Riepel D, Wee H (2022) Fabeo: fast attribute-based encryption with optimal security. In: Proceedings of the 2022 ACM SIGSAC conference on computer and communications security, pp. 2491\u20132504. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3548606.3560699","DOI":"10.1145\/3548606.3560699"},{"issue":"8","key":"533_CR37","doi-asserted-by":"publisher","first-page":"5352","DOI":"10.1109\/TIT.2021.3085363","volume":"67","author":"I Samy","year":"2021","unstructured":"Samy I, Attia M, Tandon R, Lazos L (2021) Asymmetric leaky private information retrieval. IEEE Trans Inf Theory 67(8):5352\u20135369. https:\/\/doi.org\/10.1109\/TIT.2021.3085363","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"533_CR38","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1016\/j.dcan.2022.05.004","volume":"9","author":"Y Shen","year":"2023","unstructured":"Shen Y, Shen S, Li Q, Zhou H, Wu Z, Qu Y (2023) Evolutionary privacy-preserving learning strategies for edge-based IoT data sharing schemes. Digital Comm Net 9(4):906\u2013919","journal-title":"Digital Comm Net"},{"key":"533_CR39","doi-asserted-by":"publisher","first-page":"120192","DOI":"10.1016\/j.eswa.2023.120192","volume":"225","author":"S Shen","year":"2023","unstructured":"Shen S, Wu X, Sun P, Zhou H, Wu Z, Yu S (2023) Optimal privacy preservation strategies with signaling q-learning for edge-computing-based IoT resource grant systems. Expert Syst Appl 225:120192","journal-title":"Expert Syst Appl"},{"key":"533_CR40","doi-asserted-by":"publisher","unstructured":"Stern JP (1998) A new efficient all-or-nothing disclosure of secrets protocol. In: Advances in cryptology - ASIACRYPT \u201998, International Conference on the Theory and Applications of Cryptology and Information Security, Beijing, China, October 18-22, 1998, Proceedings. Lecture Notes in Computer Science, vol 1514, pp 357\u2013371. Springer. https:\/\/doi.org\/10.1007\/3-540-49649-1_28","DOI":"10.1007\/3-540-49649-1_28"},{"issue":"21","key":"533_CR41","doi-asserted-by":"publisher","first-page":"34567","DOI":"10.1109\/JIOT.2024.3372518","volume":"11","author":"P Sun","year":"2024","unstructured":"Sun P, Shen S, Wan Y, Wu Z, Fang Z, Gao X-Z (2024) A survey of IoT privacy security: architecture, technology, challenges, and trends. IEEE Internet Thing J 11(21):34567\u201334591","journal-title":"IEEE Internet Thing J"},{"key":"533_CR42","doi-asserted-by":"publisher","unstructured":"Tovey E, Weiss J, Gilad Y (2024) Distributed pir: scaling private messaging via the users\u2019 machines. In: Proceedings of the 2024 on ACM SIGSAC conference on computer and communications security. CCS \u201924, pp 1967\u20131981. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3658644.3670350","DOI":"10.1145\/3658644.3670350"},{"issue":"7","key":"533_CR43","doi-asserted-by":"publisher","first-page":"4274","DOI":"10.1109\/TCOMM.2024.3375810","volume":"72","author":"K Vaidya","year":"2024","unstructured":"Vaidya K, Rajan BS (2024) Multi-access cache-aided multi-user private information retrieval. IEEE Trans Commun 72(7):4274\u20134286. https:\/\/doi.org\/10.1109\/TCOMM.2024.3375810","journal-title":"IEEE Trans Commun"},{"key":"533_CR44","doi-asserted-by":"publisher","unstructured":"Wang J, Berger DS, Kazhamiaka F, Irvene C, Zhang C, Choukse E, Frost K, Fonseca R, Warrier B, Bansal C, Stern J, Bianchini R, Sriraman A (2024) Designing cloud servers for lower carbon. In: 2024 ACM\/IEEE 51st annual international symposium on computer architecture (ISCA), pp 452\u2013470. https:\/\/doi.org\/10.1109\/ISCA59077.2024.00041","DOI":"10.1109\/ISCA59077.2024.00041"},{"issue":"10","key":"533_CR45","doi-asserted-by":"publisher","first-page":"18111","DOI":"10.1109\/JIOT.2024.3365532","volume":"11","author":"H Yang","year":"2024","unstructured":"Yang H, Zheng W, Zhang T, Vijayakumar P, Gupta BB, Arya V, Christo MS (2024) A flexible and verifiable keyword pir scheme for cloud\u2013edge\u2013terminal collaboration in AIoT. IEEE Internet Things J 11(10):18111\u201318122. https:\/\/doi.org\/10.1109\/JIOT.2024.3365532","journal-title":"IEEE Internet Things J"},{"key":"533_CR46","doi-asserted-by":"publisher","unstructured":"Zhang Z, Wang K, Lin W, Fu AW-C, Wong RC-W (2019) Practical access pattern privacy by combining pir and oblivious shuffle. In: Proceedings of the 28th ACM international conference on information and knowledge management. CIKM \u201919, pp 1331\u20131340. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3357384.3357975","DOI":"10.1145\/3357384.3357975"},{"key":"533_CR47","doi-asserted-by":"publisher","unstructured":"Zhou M, Park A, Zheng W, Shi E (2024) Piano: extremely simple, single-server pir with sublinear server computation. In: 2024 IEEE symposium on security and privacy (SP), pp 4296\u20134314. https:\/\/doi.org\/10.1109\/SP54263.2024.00055","DOI":"10.1109\/SP54263.2024.00055"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00533-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00533-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00533-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T09:33:20Z","timestamp":1767519200000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s42400-025-00533-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,4]]},"references-count":47,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["533"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00533-8","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,4]]},"assertion":[{"value":"17 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2026","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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"6"}}