{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T10:19:37Z","timestamp":1767867577445,"version":"3.49.0"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,2,7]],"date-time":"2022-02-07T00:00:00Z","timestamp":1644192000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,7]],"date-time":"2022-02-07T00:00:00Z","timestamp":1644192000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s00145-022-09420-8","type":"journal-article","created":{"date-parts":[[2022,2,7]],"date-time":"2022-02-07T21:04:21Z","timestamp":1644267861000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["CCA Security and Trapdoor Functions via Key-Dependent-Message Security"],"prefix":"10.1007","volume":"35","author":[{"given":"Fuyuki","family":"Kitagawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takahiro","family":"Matsuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keisuke","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,7]]},"reference":[{"key":"9420_CR1","doi-asserted-by":"crossref","unstructured":"B. Applebaum, D. Cash, C. Peikert, A. Sahai, Fast cryptographic primitives and circular-secure encryption based on hard learning problems, in S. Halevi, editor, CRYPTO\u00a02009. LNCS, vol 5677 (Springer, Heidelberg, 2009), pp. 595\u2013618","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"9420_CR2","unstructured":"M. Alekhnovich, More on average case vs approximation complexity, in 44th FOCS (IEEE Computer Society Press, 2003), pp. 298\u2013307"},{"key":"9420_CR3","doi-asserted-by":"crossref","unstructured":"B. Applebaum, Key-dependent message security: generic amplification and completeness, in K.G. Paterson, editor, EUROCRYPT\u00a02011. LNCS, vol. 6632 (Springer, Heidelberg, 2011), pp. 527\u2013546","DOI":"10.1007\/978-3-642-20465-4_29"},{"key":"9420_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Boldyreva, A. O\u2019Neill, Deterministic and efficiently searchable encryption, in A. Menezes, editor, CRYPTO\u00a02007. LNCS, vol. 4622 (Springer, Heidelberg, 2007), pp. 535\u2013552","DOI":"10.1007\/978-3-540-74143-5_30"},{"key":"9420_CR5","doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Boldyreva, J. Staddon, Randomness re-use in multi-recipient encryption schemeas, in Y. Desmedt, editor, PKC\u00a02003. LNCS, vol. 2567 (Springer, Heidelberg, 2003), pp. 85\u201399","DOI":"10.1007\/3-540-36288-6_7"},{"key":"9420_CR6","doi-asserted-by":"crossref","unstructured":"E. Birrell, K.M. Chung, R. Pass, S. Telang, Randomness-dependent message security, in A. Sahai, editor, TCC\u00a02013. LNCS, vol. 7785 (Springer, Heidelberg, 2013), pp. 700\u2013720","DOI":"10.1007\/978-3-642-36594-2_39"},{"key":"9420_CR7","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, S. Goldwasser, Circular and leakage resilient public-key encryption under subgroup indistinguishability - (or: Quadratic residuosity strikes back), in T. Rabin, editor, CRYPTO\u00a02010. LNCS, vol. 6223 (Springer, Heidelberg, 2010), pp. 1\u201320","DOI":"10.1007\/978-3-642-14623-7_1"},{"key":"9420_CR8","doi-asserted-by":"crossref","unstructured":"D. Boneh, S. Halevi, M. Hamburg, R. Ostrovsky, Circular-secure encryption from decision Diffie-Hellman, in D. Wagner, editor, CRYPTO\u00a02008. LNCS, vol. 5157 (Springer, Heidelberg, 2008), pp. 108\u2013125","DOI":"10.1007\/978-3-540-85174-5_7"},{"key":"9420_CR9","doi-asserted-by":"crossref","unstructured":"M. Bellare, S. Halevi, A. Sahai, S.P. Vadhan, Many-to-one trapdoor functions and their relation to public-key cryptosystems, in H. Krawczyk, editor, CRYPTO\u201998. LNCS, vol. 1462 (Springer, Heidelberg, 1998), pp. 283\u2013298","DOI":"10.1007\/BFb0055735"},{"key":"9420_CR10","doi-asserted-by":"crossref","unstructured":"M. Bellare, D. Hofheinz, S. Yilek, Possibility and impossibility results for encryption and commitment secure under selective opening, in A. Joux, editor, EUROCRYPT\u00a02009. LNCS, vol. 5479 (Springer, Heidelberg, 2009), pp. 1\u201335","DOI":"10.1007\/978-3-642-01001-9_1"},{"key":"9420_CR11","doi-asserted-by":"crossref","unstructured":"D. Boneh, J. Katz, Improved efficiency for CCA-secure cryptosystems built using identity-based encryption, in A. Menezes, editor, CT-RSA\u00a02005. LNCS, vol. 3376 (Springer, Heidelberg, 2005), pp. 87\u2013103","DOI":"10.1007\/978-3-540-30574-3_8"},{"key":"9420_CR12","doi-asserted-by":"crossref","unstructured":"S. Berndt, M. Liskiewicz, On the gold standard for security of universal steganography, in J.B. Nielsen, V. Rijmen, editors, EUROCRYPT\u00a02018, Part\u00a0I. LNCS, vol. 10820 (Springer, Heidelberg, 2018), pp. 29\u201360","DOI":"10.1007\/978-3-319-78381-9_2"},{"key":"9420_CR13","doi-asserted-by":"crossref","unstructured":"D. Bleichenbacher, Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1, in H. Krawczyk, editor, CRYPTO\u201998. LNCS, vol. 1462 (Springer, Heidelberg, 1998), pp. 1\u201312","DOI":"10.1007\/BFb0055716"},{"key":"9420_CR14","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, A. Lombardi, G. Segev, V. Vaikuntanathan, Anonymous IBE, leakage resilience and circular security from new assumptions, in J.B. Nielsen, V. Rijmen, editors, EUROCRYPT\u00a02018, Part\u00a0I. LNCS, vol. 10820 (Springer, Heidelberg, 2018), pp. 535\u2013564","DOI":"10.1007\/978-3-319-78381-9_20"},{"key":"9420_CR15","doi-asserted-by":"crossref","unstructured":"M. Bellare, P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, in D.E. Denning, R. Pyle, R. Ganesan, R.S. Sandhu, V. Ashby, editors, ACM CCS 93 (ACM Press, 1993), pp. 62\u201373","DOI":"10.1145\/168588.168596"},{"key":"9420_CR16","doi-asserted-by":"crossref","unstructured":"J. Black, P. Rogaway, T. Shrimpton. Encryption-scheme security in the presence of key-dependent messages. in K. Nyberg, H.M. Heys, editors, SAC 2002. LNCS, vol. 2595 (Springer, Heidelberg, 2003), pp. 62\u201375","DOI":"10.1007\/3-540-36492-7_6"},{"key":"9420_CR17","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, G. Segev, Better security for deterministic public-key encryption: the auxiliary-input setting, in P. Rogaway, editor, CRYPTO\u00a02011. LNCS, vol. 6841 (Springer, Heidelberg, 2011), pp. 543\u2013560","DOI":"10.1007\/978-3-642-22792-9_31"},{"key":"9420_CR18","doi-asserted-by":"crossref","unstructured":"J. Camenisch, A. Lysyanskaya, An efficient system for non-transferable anonymous credentials with optional anonymity revocation, in B. Pfitzmann, editor, EUROCRYPT\u00a02001. LNCS, vol. 2045 (Springer, Heidelberg, 2001), pp. 93\u2013118","DOI":"10.1007\/3-540-44987-6_7"},{"key":"9420_CR19","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork, M. Naor, Non-malleable cryptography (extended abstract), in 23rd ACM STOC (ACM Press, 1991), pp. 542\u2013552","DOI":"10.1145\/103418.103474"},{"key":"9420_CR20","doi-asserted-by":"crossref","unstructured":"N. D\u00f6ttling, S. Garg, M. Hajiabadi, D. Masny, New constructions of identity-based and key-dependent message secure encryption schemes, in M. Abdalla, R. Dahab, editors, PKC\u00a02018, Part\u00a0I. LNCS, vol. 10769 (Springer, Heidelberg, 2018), pp. 3\u201331","DOI":"10.1007\/978-3-319-76578-5_1"},{"key":"9420_CR21","doi-asserted-by":"crossref","unstructured":"N. D\u00f6ttling, J. M\u00fcller-Quade, A.C.A. Nascimento, IND-CCA secure cryptography based on a variant of the LPN problem, in X. Wang, K. Sako, editors, ASIACRYPT\u00a02012. LNCS, vol. 7658 (Springer, Heidelberg, 2012), pp. 485\u2013503","DOI":"10.1007\/978-3-642-34961-4_30"},{"key":"9420_CR22","doi-asserted-by":"crossref","unstructured":"C. Dwork, M. Naor, O. Reingold, Immunizing encryption schemes from decryption errors, in C. Cachin, J. Camenisch, editors, EUROCRYPT\u00a02004. LNCS, vol. 3027 (Springer, Heidelberg, 2004), pp. 342\u2013360","DOI":"10.1007\/978-3-540-24676-3_21"},{"key":"9420_CR23","doi-asserted-by":"crossref","unstructured":"S. Fehr, D. Hofheinz, E. Kiltz, H. Wee, Encryption schemes secure against chosen-ciphertext selective opening attacks, in H. Gilbert, editor, EUROCRYPT\u00a02010. LNCS, vol. 6110 (Springer, Heidelberg, 2010), pp. 381\u2013402","DOI":"10.1007\/978-3-642-13190-5_20"},{"key":"9420_CR24","doi-asserted-by":"crossref","unstructured":"E. Fujisaki, T. Okamoto, How to enhance the security of public-key encryption at minimum cost, in H. Imai, Y. Zheng, editors, PKC\u201999. LNCS, vol. 1560 (Springer, Heidelberg, 1999), pp. 53\u201368","DOI":"10.1007\/3-540-49162-7_5"},{"key":"9420_CR25","doi-asserted-by":"crossref","unstructured":"S. Garg, R. Gay, M. Hajiabadi, New techniques for efficient trapdoor functions and applications, in Y. Ishai, V. Rijmen, editors, EUROCRYPT\u00a02019, Part\u00a0III. LNCS, vol. 11478 (Springer, Heidelberg, 2019), pp. 33\u201363","DOI":"10.1007\/978-3-030-17659-4_2"},{"key":"9420_CR26","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, Probabilistic encryption and how to play mental poker keeping secret all partial information, in 14th ACM STOC (ACM Press, 1982), pp. 365\u2013377","DOI":"10.1145\/800070.802212"},{"key":"9420_CR27","doi-asserted-by":"crossref","unstructured":"Y. Gertner, T. Malkin, S. Myers, Towards a separation of semantic and CCA security for public key encryption, in S.P. Vadhan, editor, TCC\u00a02007. LNCS, vol. 4392 (Springer, Heidelberg, 2007), pp. 434\u2013455","DOI":"10.1007\/978-3-540-70936-7_24"},{"key":"9420_CR28","doi-asserted-by":"crossref","unstructured":"Y. Gertner, T. Malkin, O. Reingold, On the impossibility of basing trapdoor functions on trapdoor predicates, in 42nd FOCS (IEEE Computer Society Press, 2001), pp. 126\u2013135","DOI":"10.1109\/SFCS.2001.959887"},{"key":"9420_CR29","doi-asserted-by":"crossref","unstructured":"M. Hajiabadi, B.M. Kapron, Reproducible circularly-secure bit encryption: applications and realizations, in R. Gennaro, M.J.B. Robshaw, editors, CRYPTO\u00a02015, Part\u00a0I. LNCS, vol. 9215 (Springer, Heidelberg, 2015), pp. 224\u2013243","DOI":"10.1007\/978-3-662-47989-6_11"},{"key":"9420_CR30","doi-asserted-by":"crossref","unstructured":"S. Hohenberger, V. Koppula, B. Waters, Chosen ciphertext security from injective trapdoor functions, in D. Micciancio, T. Ristenpart, editors, CRYPTO\u00a02020, Part\u00a0I. LNCS, vol. 12170 (Springer, Heidelberg, 2020), pp. 836\u2013866","DOI":"10.1007\/978-3-030-56784-2_28"},{"key":"9420_CR31","doi-asserted-by":"crossref","unstructured":"N. Hopper, On steganographic chosen covertext security, in L. Caires, G.F. Italiano, L. Monteiro, C. Palamidessi, M. Yung, editors, ICALP 2005. LNCS, vol. 3580 (Springer, Heidelberg, 2005), pp. 311\u2013323","DOI":"10.1007\/11523468_26"},{"key":"9420_CR32","doi-asserted-by":"crossref","unstructured":"C.Y. Hsiao, L. Reyzin, Finding collisions on a public road, or do secure hash functions need secret coins? in M. Franklin, editor, CRYPTO\u00a02004. LNCS, vol. 3152 (Springer, Heidelberg, 2004), pp. 92\u2013105","DOI":"10.1007\/978-3-540-28628-8_6"},{"key":"9420_CR33","unstructured":"F. Kitagawa, T. Matsuda, CPA-to-CCA transformation for KDM security. Cryptology ePrint Archive, Report 2019\/609, 2019. https:\/\/eprint.iacr.org\/2019\/609"},{"key":"9420_CR34","doi-asserted-by":"crossref","unstructured":"F. Kitagawa, T. Matsuda, CPA-to-CCA transformation for KDM security, in D. Hofheinz, A. Rosen, editors, TCC\u00a02019, Part\u00a0II. LNCS, vol. 11892 (Springer, Heidelberg, 2019), pp. 118\u2013148","DOI":"10.1007\/978-3-030-36033-7_5"},{"key":"9420_CR35","doi-asserted-by":"crossref","unstructured":"F. Kitagawa, T. Matsuda, Circular security is complete for KDM security, in ASIACRYPT\u00a02020, Part\u00a0I. LNCS (Springer, Heidelberg, 2020), pp. 253\u2013285","DOI":"10.1007\/978-3-030-64837-4_9"},{"key":"9420_CR36","doi-asserted-by":"crossref","unstructured":"E. Kiltz, P. Mohassel, A. O\u2019Neill, Adaptive trapdoor functions and chosen-ciphertext security, in H. Gilbert, editor, EUROCRYPT\u00a02010. LNCS, vol. 6110 (Springer, Heidelberg, 2010), pp. 673\u2013692","DOI":"10.1007\/978-3-642-13190-5_34"},{"key":"9420_CR37","doi-asserted-by":"crossref","unstructured":"E. Kiltz, D. Masny, K. Pietrzak, Simple chosen-ciphertext security from low-noise LPN, in H. Krawczyk, editor, PKC\u00a02014. LNCS, vol. 8383 (Springer, Heidelberg, 2014), pp. 1\u201318","DOI":"10.1007\/978-3-642-54631-0_1"},{"key":"9420_CR38","doi-asserted-by":"crossref","unstructured":"F. Kitagawa, T. Matsuda, K. Tanaka, CCA security and trapdoor functions via key-dependent-message security, in A. Boldyreva, D. Micciancio, editors, CRYPTO\u00a02019, Part\u00a0III. LNCS, vol. 11694 (Springer, Heidelberg, 2019), pp. 33\u201364","DOI":"10.1007\/978-3-030-26954-8_2"},{"key":"9420_CR39","unstructured":"V. Koppula, B. Waters, Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption. Cryptology ePrint Archive, Report 2018\/847, 2018. https:\/\/eprint.iacr.org\/2018\/847"},{"key":"9420_CR40","doi-asserted-by":"crossref","unstructured":"V. Koppula, B. Waters, Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption, in A. Boldyreva, D. Micciancio, editors, CRYPTO\u00a02019, Part\u00a0II. LNCS, vol. 11693 (Springer, Heidelberg, 2019), pp. 671\u2013700","DOI":"10.1007\/978-3-030-26951-7_23"},{"key":"9420_CR41","doi-asserted-by":"crossref","unstructured":"S. Liu, K.G. Paterson, Simulation-based selective opening CCA security for PKE from key encapsulation mechanisms, in J. Katz, editor, PKC\u00a02015. LNCS, vol. 9020 (Springer, Heidelberg, 2015), pp. 3\u201326","DOI":"10.1007\/978-3-662-46447-2_1"},{"key":"9420_CR42","doi-asserted-by":"crossref","unstructured":"A. Lombardi, W. Quach, R.D. Rothblum, D. Wichs, D.J. Wu, New constructions of reusable designated-verifier NIZKs. Cryptology ePrint Archive, Report 2019\/242, 2019. https:\/\/eprint.iacr.org\/2019\/242. This is the initial version dated on Feb 27, 2019","DOI":"10.1007\/978-3-030-26954-8_22"},{"key":"9420_CR43","doi-asserted-by":"crossref","unstructured":"A. Lombardi, W. Quach, R.D. Rothblum, D. Wichs, D.J. Wu, New constructions of reusable designated-verifier NIZKs. Cryptology ePrint Archive, Report 2019\/242, 2019. https:\/\/eprint.iacr.org\/2019\/242. This is the latest version dated on Jun 5, 2019","DOI":"10.1007\/978-3-030-26954-8_22"},{"key":"9420_CR44","doi-asserted-by":"crossref","unstructured":"A. Lombardi, W. Quach, R.D. Rothblum, D. Wichs, D.J. Wu, New constructions of reusable designated-verifier NIZKs, in A. Boldyreva, D. Micciancio, editors, CRYPTO\u00a02019, Part\u00a0III. LNCS, vol. 11694 (Springer, Heidelberg, 2019), pp. 670\u2013700","DOI":"10.1007\/978-3-030-26954-8_22"},{"key":"9420_CR45","doi-asserted-by":"crossref","unstructured":"T. Matsuda, G. Hanaoka, Constructing and understanding chosen ciphertext security via puncturable key encapsulation mechanisms, in Y. Dodis, J.B. Nielsen, editors, TCC\u00a02015, Part\u00a0I. LNCS, vol. 9014 (Springer, Heidelberg, 2015), pp. 561\u2013590","DOI":"10.1007\/978-3-662-46494-6_23"},{"key":"9420_CR46","doi-asserted-by":"crossref","unstructured":"T. Malkin, I. Teranishi, M. Yung, Efficient circuit-size independent public key encryption with KDM security, in K.G. Paterson, editor, EUROCRYPT\u00a02011. LNCS, vol. 6632 (Springer, Heidelberg, 2011), pp. 507\u2013526","DOI":"10.1007\/978-3-642-20465-4_28"},{"key":"9420_CR47","doi-asserted-by":"crossref","unstructured":"M. Naor, G. Segev, Public-key cryptosystems resilient to key leakage. in S. Halevi, editor, CRYPTO\u00a02009. LNCS, vol. 5677 (Springer, Heidelberg, 2009), pp. 18\u201335","DOI":"10.1007\/978-3-642-03356-8_2"},{"key":"9420_CR48","doi-asserted-by":"crossref","unstructured":"C. Peikert, B. Waters, Lossy trapdoor functions and their applications, in R.E. Ladner, C.D. editors, 40th ACM STOC (ACM Press, 2008), pp. 187\u2013196","DOI":"10.1145\/1374376.1374406"},{"key":"9420_CR49","doi-asserted-by":"crossref","unstructured":"W. Quach, D. Wichs, G. Zirdelis, Watermarking PRFs under standard assumptions: public marking and security with extraction queries, in A. Beimel, S. Dziembowski, editors, TCC\u00a02018, Part\u00a0II. LNCS, vol. 11240 (Springer, Heidelberg, 2018), pp. 669\u2013698","DOI":"10.1007\/978-3-030-03810-6_24"},{"key":"9420_CR50","doi-asserted-by":"crossref","unstructured":"J. Rompel, One-way functions are necessary and sufficient for secure signatures, in 22nd ACM STOC (ACM Press, 1990), pp. 387\u2013394","DOI":"10.1145\/100216.100269"},{"key":"9420_CR51","doi-asserted-by":"crossref","unstructured":"C. Rackoff, D.R. Simon, Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack, in J. Feigenbaum, editor, CRYPTO\u201991. LNCS, vol. 576 (Springer, Heidelberg, 1992), pp. 433\u2013444","DOI":"10.1007\/3-540-46766-1_35"},{"key":"9420_CR52","doi-asserted-by":"crossref","unstructured":"A. Rosen, G. Segev, Chosen-ciphertext security via correlated products, in O. Reingold, editor, TCC\u00a02009. LNCS, vol. 5444 (Springer, Heidelberg, 2009), pp. 419\u2013436","DOI":"10.1007\/978-3-642-00457-5_25"},{"key":"9420_CR53","doi-asserted-by":"crossref","unstructured":"O. Reingold, L. Trevisan, S.P. Vadhan, Notions of reducibility between cryptographic primitives, in M. Naor, editor, TCC\u00a02004. LNCS, vol. 2951 (Springer, Heidelberg, 2004), pp. 1\u201320","DOI":"10.1007\/978-3-540-24638-1_1"},{"key":"9420_CR54","doi-asserted-by":"crossref","unstructured":"H. Wee, KDM-security via homomorphic smooth projective hashing, in C.M. Cheng, K.M. Chung, G. Persiano, B.Y. Yang, editors, PKC\u00a02016, Part\u00a0II. LNCS, vol. 9615 (Springer, Heidelberg, 2016), pp. 159\u2013179","DOI":"10.1007\/978-3-662-49387-8_7"},{"key":"9420_CR55","unstructured":"K. Xagawa, The Boneh-Katz transformation, revisited: pseudorandom\/obliviously-samplable PKE from lattices and codes and its application. Cryptology ePrint Archive, Report 2021\/740, 2021. https:\/\/eprint.iacr.org\/2021\/740. To appear in SAC 2021"},{"key":"9420_CR56","doi-asserted-by":"crossref","unstructured":"A.C.C. Yao, Theory and applications of trapdoor functions (extended abstract), in 23rd FOCS (IEEE Computer Society Press, 1982), pp. 80\u201391","DOI":"10.1109\/SFCS.1982.45"},{"key":"9420_CR57","doi-asserted-by":"crossref","unstructured":"A.C.C. Yao, How to generate and exchange secrets (extended abstract), in 27th FOCS (IEEE Computer Society Press, 1986), pp. 162\u2013167","DOI":"10.1109\/SFCS.1986.25"},{"key":"9420_CR58","doi-asserted-by":"crossref","unstructured":"Y. Yu, J. Zhang, Cryptography with auxiliary input and trapdoor from constant-noise LPN, in M. Robshaw, J. Katz, editors, CRYPTO\u00a02016, Part\u00a0I. LNCS, vol. 9814 (Springer, Heidelberg, 2016), pp. 214\u2013243","DOI":"10.1007\/978-3-662-53018-4_9"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09420-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-022-09420-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09420-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T18:07:39Z","timestamp":1650910059000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-022-09420-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,7]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["9420"],"URL":"https:\/\/doi.org\/10.1007\/s00145-022-09420-8","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,7]]},"assertion":[{"value":"8 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"9"}}