{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:37:08Z","timestamp":1779935828842,"version":"3.53.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T00:00:00Z","timestamp":1732579200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005717","name":"University of Haifa","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005717","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Homomorphic encryption () protects data in-use, but can be computationally expensive. To avoid the costly bootstrapping procedure that refreshes ciphertexts, some works have explored client-aided outsourcing protocols, where the client intermittently refreshes ciphertexts for a server that is performing homomorphic computations. But is this approach secure against malicious servers? We present a -secure encryption scheme that is completely insecure in this setting. We define a new notion of security, called   , that we prove is sufficient. Additionally, we show:<jats:list list-type=\"bullet\">\n              <jats:list-item>\n                <jats:p>Homomorphic encryption schemes that have a certain type of circuit privacy\u2014for example, schemes in which ciphertexts can be \u201csanitized\"\u2014are -secure.<\/jats:p>\n              <\/jats:list-item>\n              <jats:list-item>\n                <jats:p>In particular, assuming certain existing  schemes are -secure, they are also -secure.<\/jats:p>\n              <\/jats:list-item>\n              <jats:list-item>\n                <jats:p>For certain encryption schemes, like Brakerski-Vaikuntanathan, that have a property that we call oblivious secret key extraction, -security implies circular security\u2014i.e., that it is secure to provide an encryption of the secret key in a form usable for bootstrapping (to construct fully homomorphic encryption).<\/jats:p>\n              <\/jats:list-item>\n            <\/jats:list>\n          <\/jats:p>","DOI":"10.1007\/s00145-024-09526-1","type":"journal-article","created":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T17:24:30Z","timestamp":1732641870000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Achievable CCA2 Relaxation for Homomorphic Encryption"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0853-3576","authenticated-orcid":false,"given":"Adi","family":"Akavia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Craig","family":"Gentry","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3432-7899","authenticated-orcid":false,"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1149-7182","authenticated-orcid":false,"given":"Margarita","family":"Vald","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,26]]},"reference":[{"key":"9526_CR1","doi-asserted-by":"crossref","unstructured":"A.\u00a0Akavia, D.\u00a0Feldman, H.\u00a0Shaul. Secure search on encrypted data via multi-ring sketch. In D.\u00a0Lie, M.\u00a0Mannan, M.\u00a0Backes, and X.\u00a0Wang, editors, Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, October 15-19, 2018, pages 985\u20131001. ACM, 2018.","DOI":"10.1145\/3243734.3243810"},{"key":"9526_CR2","doi-asserted-by":"crossref","unstructured":"A.\u00a0Akavia, C.\u00a0Gentry, S.\u00a0Halevi, M.\u00a0Vald. Achievable CCA2 relaxation for homomorphic encryption. In E.\u00a0Kiltz and V.\u00a0Vaikuntanathan, editors, Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part II, volume 13748 of Lecture Notes in Computer Science, pages 70\u201399. Springer, 2022.","DOI":"10.1007\/978-3-031-22365-5_3"},{"key":"9526_CR3","doi-asserted-by":"crossref","unstructured":"A.\u00a0Akavia, C.\u00a0Gentry, S.\u00a0Halevi, M.\u00a0Vald. Achievable cca2 relaxation for homomorphic encryption. Cryptology ePrint Archive, Paper 2022\/282, 2022. https:\/\/eprint.iacr.org\/2022\/282.","DOI":"10.1007\/978-3-031-22365-5_3"},{"key":"9526_CR4","unstructured":"A.\u00a0Akavia, M.\u00a0Leibovich, Y.\u00a0S. Resheff, R.\u00a0Ron, M.\u00a0Shahar, M.\u00a0Vald. Privacy-preserving decision tree training and prediction against malicious server. Cryptology ePrint Archive, Paper 2019\/1282, 2019. https:\/\/eprint.iacr.org\/2019\/1282."},{"key":"9526_CR5","doi-asserted-by":"crossref","unstructured":"A.\u00a0Akavia, M.\u00a0Leibovich, Y.\u00a0S. Resheff, R.\u00a0Ron, M.\u00a0Shahar, M.\u00a0Vald. Privacy-preserving decision trees training and prediction. In F.\u00a0Hutter, K.\u00a0Kersting, J.\u00a0Lijffijt, and I.\u00a0Valera, editors, Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2020, Ghent, Belgium, September 14-18, 2020, Proceedings, Part I, volume 12457 of Lecture Notes in Computer Science, pages 145\u2013161. Springer, 2020.","DOI":"10.1007\/978-3-030-67658-2_9"},{"key":"9526_CR6","doi-asserted-by":"crossref","unstructured":"A.\u00a0Akavia, M.\u00a0Leibovich, Y.\u00a0S. Resheff, R.\u00a0Ron, M.\u00a0Shahar, M.\u00a0Vald. Privacy-preserving decision trees training and prediction. In Machine Learning and Knowledge Discovery in Databases, pages 145\u2013161. Springer International Publishing, 2021.","DOI":"10.1007\/978-3-030-67658-2_9"},{"key":"9526_CR7","doi-asserted-by":"crossref","unstructured":"A.\u00a0Akavia, M.\u00a0Leibovich, Y.\u00a0S. Resheff, R.\u00a0Ron, M.\u00a0Shahar, M.\u00a0Vald. Privacy-preserving decision trees training and prediction. ACM Trans. Priv. Secur., 25(3), may 2022.","DOI":"10.1145\/3517197"},{"key":"9526_CR8","unstructured":"A.\u00a0Akavia, N.\u00a0Oren, B.\u00a0Sapir, M.\u00a0Vald. CSHER: A system for compact storage with HE-Retrieval. In 32nd USENIX Security Symposium (USENIX Security 23), pages 4751\u20134768, Anaheim, CA, Aug. 2023. USENIX Association."},{"key":"9526_CR9","doi-asserted-by":"crossref","unstructured":"A.\u00a0Akavia, H.\u00a0Shaul, M.\u00a0Weiss, Z.\u00a0Yakhini. Linear-regression on packed encrypted data in the two-server model. In M.\u00a0Brenner, T.\u00a0Lepoint, and K.\u00a0Rohloff, editors, Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography, WAHC@CCS 2019, London, UK, November 11-15, 2019, pages 21\u201332. ACM, 2019.","DOI":"10.1145\/3338469.3358942"},{"key":"9526_CR10","unstructured":"A.\u00a0Akavia, M.\u00a0Vald. On the privacy of protocols based on cpa-secure homomorphic encryption. Cryptology ePrint Archive, Report 2021\/803, 2021. https:\/\/ia.cr\/2021\/803."},{"key":"9526_CR11","doi-asserted-by":"crossref","unstructured":"J.-F. Biasse, C.\u00a0Fieker. Subexponential class group and unit group computation in large degree number fields. LMS Journal of Computation and Mathematics, 17:385\u2013403, 1 2014.","DOI":"10.1112\/S1461157014000345"},{"key":"9526_CR12","doi-asserted-by":"crossref","unstructured":"J.-P. Bossuat, C.\u00a0Mouchet, J.\u00a0Troncoso-Pastoriza, J.-P. Hubaux. Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys. Springer-Verlag, 2021.","DOI":"10.1007\/978-3-030-77870-5_21"},{"key":"9526_CR13","doi-asserted-by":"crossref","unstructured":"R.\u00a0Bost, R.\u00a0A. Popa, S.\u00a0Tu, S.\u00a0Goldwasser. Machine learning classification over encrypted data. In NDSS, volume 4324, page 4325, 2015.","DOI":"10.14722\/ndss.2015.23241"},{"key":"9526_CR14","doi-asserted-by":"crossref","unstructured":"F.\u00a0Bourse, R.\u00a0Del\u00a0Pino, M.\u00a0Minelli, H.\u00a0Wee. FHE circuit privacy almost for free. In Advances in Cryptology \u2013 CRYPTO 2016, pages 62\u201389. Springer Berlin Heidelberg, 2016.","DOI":"10.1007\/978-3-662-53008-5_3"},{"key":"9526_CR15","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Brakerski. Fully homomorphic encryption without modulus switching from classical gapSVP. In Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings, pages 868\u2013886, 2012.","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"9526_CR16","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Brakerski, C.\u00a0Gentry, V.\u00a0Vaikuntanathan. (leveled) fully homomorphic encryption without bootstrapping. In Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, January 8-10, 2012, pages 309\u2013325, 2012.","DOI":"10.1145\/2090236.2090262"},{"issue":"2","key":"9526_CR17","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Z.\u00a0Brakerski, V.\u00a0Vaikuntanathan. Efficient fully homomorphic encryption from (standard) lwe. SIAM Journal on computing, 43(2):831\u2013871, 2014.","journal-title":"SIAM Journal on computing"},{"key":"9526_CR18","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, H.\u00a0Krawczyk, J.\u00a0B. Nielsen. Relaxing chosen-ciphertext security. In D.\u00a0Boneh, editor, Advances in Cryptology - CRYPTO 2003, pages 565\u2013582, Berlin, Heidelberg, 2003. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-540-45146-4_33"},{"key":"9526_CR19","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, S.\u00a0Raghuraman, S.\u00a0Richelson, V.\u00a0Vaikuntanathan. Chosen-ciphertext secure fully homomorphic encryption. In S.\u00a0Fehr, editor, Public-Key Cryptography \u2013 PKC 2017, pages 213\u2013240, Berlin, Heidelberg, 2017. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-662-54388-7_8"},{"key":"9526_CR20","doi-asserted-by":"crossref","unstructured":"D.\u00a0Cash, M.\u00a0Green, S.\u00a0Hohenberger. New definitions and separations for circular security. In International Workshop on Public Key Cryptography, pages 540\u2013557. Springer, 2012.","DOI":"10.1007\/978-3-642-30057-8_32"},{"key":"9526_CR21","doi-asserted-by":"crossref","unstructured":"J.\u00a0H. Cheon, A.\u00a0Kim, M.\u00a0Kim, Y.\u00a0Song. Homomorphic encryption for arithmetic of approximate numbers. In International Conference on the Theory and Application of Cryptology and Information Security, pages 409\u2013437. Springer, 2017.","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"9526_CR22","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2019","unstructured":"I.\u00a0Chillotti, N.\u00a0Gama, M.\u00a0Georgieva, M.\u00a0Izabach\u00e8ne. TFHE: Fast fully homomorphic encryption over the torus. Journal of Cryptology, 33:34\u201391, 2019.","journal-title":"Journal of Cryptology"},{"key":"9526_CR23","doi-asserted-by":"crossref","unstructured":"W.\u00a0Chongchitmate, R.\u00a0Ostrovsky. Circuit-private multi-key FHE. In 20th IACR International Conference on Public-Key Cryptography \u2013 PKC 2017, pages 24\u2013270. Springer Berlin Heidelberg, 2017.","DOI":"10.1007\/978-3-662-54388-7_9"},{"key":"9526_CR24","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Dodis, S.\u00a0Halevi, D.\u00a0Wichs. Security with functional re-encryption from cpa. In Theory of Cryptography: 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 \u2013 December 2, 2023, Proceedings, Part II, page 279\u2013305, Berlin, Heidelberg, 2023. Springer-Verlag.","DOI":"10.1007\/978-3-031-48618-0_10"},{"key":"9526_CR25","doi-asserted-by":"crossref","unstructured":"L.\u00a0Ducas, D.\u00a0Micciancio. FHEW: Bootstrapping homomorphic encryption in less than a second. In Advances in Cryptology \u2013 EUROCRYPT 2015, pages 617\u2013640. Springer Berlin Heidelberg, 2015.","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"9526_CR26","doi-asserted-by":"crossref","unstructured":"L.\u00a0Ducas, D.\u00a0Stehl\u00e9. Sanitization of FHE ciphertexts. In Advances in Cryptology \u2013 EUROCRYPT 2016, pages 294\u2013310. Springer Berlin Heidelberg, 2016.","DOI":"10.1007\/978-3-662-49890-3_12"},{"key":"9526_CR27","first-page":"144","volume":"2012","author":"J Fan","year":"2012","unstructured":"J.\u00a0Fan, F.\u00a0Vercauteren. Somewhat practical fully homomorphic encryption. IACR Cryptology ePrint Archive, 2012:144, 2012.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"9526_CR28","unstructured":"C.\u00a0Gentry. A fully homomorphic encryption scheme. PhD thesis, Stanford University, 2009. http:\/\/crypto.stanford.edu\/craig."},{"key":"9526_CR29","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry. Fully homomorphic encryption using ideal lattices. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC \u201909, pages 169\u2013178. Association for Computing Machinery, 2009.","DOI":"10.1145\/1536414.1536440"},{"key":"9526_CR30","doi-asserted-by":"crossref","unstructured":"C.\u00a0Gentry, A.\u00a0Sahai, B.\u00a0Waters. Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In Annual Cryptology Conference, pages 75\u201392. Springer, 2013.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"9526_CR31","doi-asserted-by":"crossref","unstructured":"I.\u00a0Giacomelli, S.\u00a0Jha, M.\u00a0Joye, C.\u00a0D. Page, K.\u00a0Yoon. Privacy-preserving ridge regression with only linearly-homomorphic encryption. In Applied Cryptography and Network Security - 16th International Conference, ACNS 2018, pages 243\u2013261. Springer, 2018.","DOI":"10.1007\/978-3-319-93387-0_13"},{"key":"9526_CR32","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"The Foundations of Cryptography -","author":"O Goldreich","year":"2001","unstructured":"O.\u00a0Goldreich. The Foundations of Cryptography - Volume 1, Basic Techniques. Cambridge University Press, 2001."},{"key":"9526_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14303-8","volume-title":"Efficient Secure Two-Party Protocols: Techniques and Constructions","author":"C Hazay","year":"2010","unstructured":"C.\u00a0Hazay, Y.\u00a0Lindell. Efficient Secure Two-Party Protocols: Techniques and Constructions. Springer-Verlag, Berlin, Heidelberg, 1st edition, 2010.","edition":"1"},{"key":"9526_CR34","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Ishai, A.\u00a0Paskin. Evaluating branching programs on encrypted data. In Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, pages 575\u2013594. Springer, 2007.","DOI":"10.1007\/978-3-540-70936-7_31"},{"key":"9526_CR35","unstructured":"C.\u00a0Juvekar, V.\u00a0Vaikuntanathan, A.\u00a0Chandrakasan. Gazelle: A low latency framework for secure neural network inference. In Proceedings of the 27th USENIX Conference on Security Symposium, SEC\u201918, page 1651\u20131668. USENIX Association, 2018."},{"key":"9526_CR36","unstructured":"J.\u00a0Katz, Y.\u00a0Lindell. Introduction to Modern Cryptography (Chapman & Hall\/Crc Cryptography and Network Security Series). Chapman & Hall\/CRC, 2007."},{"key":"9526_CR37","first-page":"1533","volume":"2020","author":"B Li","year":"2020","unstructured":"B.\u00a0Li, D.\u00a0Micciancio. On the security of homomorphic encryption on approximate numbers. IACR Cryptology ePrint Archive, 2020:1533, 2020.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"9526_CR38","doi-asserted-by":"crossref","unstructured":"J.\u00a0Loftus, A.\u00a0May, N.\u00a0P. Smart, F.\u00a0Vercauteren. On cca-secure somewhat homomorphic encryption. In A.\u00a0Miri and S.\u00a0Vaudenay, editors, Selected Areas in Cryptography, pages 55\u201372, Berlin, Heidelberg, 2012. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-642-28496-0_4"},{"key":"9526_CR39","first-page":"1454","volume":"2020","author":"G Malavolta","year":"2020","unstructured":"G.\u00a0Malavolta. Circuit privacy for quantum fully homomorphic encryption. IACR Cryptology ePrint Archive, 2020:1454, 2020.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"9526_CR40","series-title":"pp","first-page":"63","volume-title":"Advances in Cryptology - EUROCRYPT 2024","author":"M Manulis","year":"2024","unstructured":"M.\u00a0Manulis, J.\u00a0Nguyen. Fully homomorphic encryption beyond ind-cca1 security: Integrity through verifiability. In M.\u00a0Joye and G.\u00a0Leander, editors, Advances in Cryptology \u2013 EUROCRYPT 2024, pages 63\u201393, Cham, 2024. Springer Nature Switzerland."},{"key":"9526_CR41","doi-asserted-by":"crossref","unstructured":"K.\u00a0Nuida. How to handle invalid queries for malicious-private protocols based on homomorphic encryption. In Proceedings of the 9th ACM on ASIA Public-Key Cryptography Workshop, APKC \u201922, page 15\u201325, New York, NY, USA, 2022. Association for Computing Machinery.","DOI":"10.1145\/3494105.3526238"},{"key":"9526_CR42","doi-asserted-by":"crossref","unstructured":"R.\u00a0Ostrovsky, A.\u00a0Paskin-Cherniavsky, B.\u00a0Paskin-Cherniavsky. Maliciously circuit-private FHE. In Advances in Cryptology \u2013 CRYPTO 2014, pages 536\u2013553, Berlin, Heidelberg, 2014. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-662-44371-2_30"},{"issue":"4","key":"9526_CR43","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1561\/0400000074","volume":"10","author":"C Peikert","year":"2016","unstructured":"C.\u00a0Peikert. A decade of lattice cryptography. Found. Trends Theor. Comput. Sci., 10(4):283\u2013424, 2016.","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"9526_CR44","doi-asserted-by":"crossref","unstructured":"M.\u00a0Prabhakaran, M.\u00a0Rosulek. Homomorphic encryption with cca security. In L.\u00a0Aceto, I.\u00a0Damg\u00e5rd, L.\u00a0A. Goldberg, M.\u00a0M. Halld\u00f3rsson, A.\u00a0Ing\u00f3lfsd\u00f3ttir, and I.\u00a0Walukiewicz, editors, Automata, Languages and Programming, pages 667\u2013678, Berlin, Heidelberg, 2008. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-540-70583-3_54"},{"key":"9526_CR45","doi-asserted-by":"crossref","unstructured":"O.\u00a0Regev. On lattices, learning with errors, random linear codes, and cryptography. J. ACM, 56(6), Sept. 2009.","DOI":"10.1145\/1568318.1568324"},{"key":"9526_CR46","unstructured":"M.\u00a0Rosulek. The joy of cryptography. https:\/\/joyofcryptography.com."},{"key":"9526_CR47","unstructured":"V.\u00a0Shoup. A proposal for an ISO standard for public key encryption. IACR Cryptol. ePrint Arch., page 112, 2001."},{"key":"9526_CR48","unstructured":"W.\u00a0Wang, Y.\u00a0Jiang, Q.\u00a0Shen, W.\u00a0Huang, H.\u00a0Chen, S.\u00a0Wang, X.\u00a0Wang, H.\u00a0Tang, K.\u00a0Chen, K.\u00a0E. Lauter, D.\u00a0Lin. Toward scalable fully homomorphic encryption through light trusted computing assistance. CoRR, abs\/1905.07766, 2019."}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09526-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-024-09526-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09526-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T21:33:11Z","timestamp":1739309591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-024-09526-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,26]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["9526"],"URL":"https:\/\/doi.org\/10.1007\/s00145-024-09526-1","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,26]]},"assertion":[{"value":"16 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"5"}}