{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T23:06:42Z","timestamp":1782947202672,"version":"3.54.5"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T00:00:00Z","timestamp":1715644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T00:00:00Z","timestamp":1715644800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100007605","name":"Aarhus Universitet","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100007605","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We put forward two natural generalizations of predicate encryption (PE), dubbed <jats:italic>multi-key<\/jats:italic> and <jats:italic>multi-input<\/jats:italic> PE. More in details, our contributions are threefold.<jats:list list-type=\"bullet\">\n                <jats:list-item>\n                  <jats:p><jats:bold>Definitions.<\/jats:bold> We formalize security of multi-key PE and multi-input PE following the standard indistinguishability paradigm, and modeling security both against malicious senders (i.e., corruption of encryption keys) and malicious receivers (i.e., collusions).<\/jats:p>\n                <\/jats:list-item>\n                <jats:list-item>\n                  <jats:p><jats:bold>Constructions.<\/jats:bold> We construct adaptively secure multi-key and multi-input PE supporting the conjunction of poly-many arbitrary single-input predicates, assuming the sub-exponential hardness of the learning with errors (LWE) problem.<\/jats:p>\n                <\/jats:list-item>\n                <jats:list-item>\n                  <jats:p><jats:bold>Applications.<\/jats:bold> We show that multi-key and multi-input PE for expressive enough predicates suffices for interesting cryptographic applications, including non-interactive multi-party computation (NI-MPC) and matchmaking encryption (ME).<\/jats:p>\n                <\/jats:list-item>\n              <\/jats:list> In particular, plugging in our constructions of multi-key and multi-input PE, under the sub-exponential LWE assumption, we obtain the first ME supporting <jats:italic>arbitrary policies<\/jats:italic> with unbounded collusions, as well as robust (resp. non-robust) NI-MPC for so-called <jats:italic>all-or-nothing<\/jats:italic> functions satisfying a non-trivial notion of reusability and supporting a constant (resp. polynomial) number of parties. Prior to our work, both of these applications required much heavier tools such as indistinguishability obfuscation or compact functional encryption.<\/jats:p>","DOI":"10.1007\/s00145-024-09504-7","type":"journal-article","created":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T22:01:32Z","timestamp":1715724092000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors"],"prefix":"10.1007","volume":"37","author":[{"given":"Danilo","family":"Francati","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniele","family":"Friolo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giulio","family":"Malavolta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniele","family":"Venturi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,5,14]]},"reference":[{"key":"9504_CR1","doi-asserted-by":"crossref","unstructured":"M. Abdalla, F. Benhamouda, R. Gay, From single-input to multi-client inner-product functional encryption, in S.D. Galbraith, S. Moriai, editors, ASIACRYPT\u00a02019, Part\u00a0III. LNCS, vol. 11923 (Springer, Heidelberg, 2019), pp. 552\u2013582","DOI":"10.1007\/978-3-030-34618-8_19"},{"key":"9504_CR2","doi-asserted-by":"crossref","unstructured":"M. Abdalla, F. Benhamouda, M. Kohlweiss, H. Waldner, Decentralizing inner-product functional encryption, in D. Lin, K. Sako, editors, PKC\u00a02019, Part\u00a0II. LNSC, vol. 11443 (Springer, Heidelberg, 2019), pp. 128\u2013157","DOI":"10.1007\/978-3-030-17259-6_5"},{"key":"9504_CR3","doi-asserted-by":"crossref","unstructured":"M. Abdalla, D. Catalano, D. Fiore, R. Gay, B. Ursu, Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings, in H. Shacham, A. Boldyreva, editors, CRYPTO\u00a02018, Part\u00a0I. LNCS, vol. 10991 (Springer, Heidelberg, 2018), pp. 597\u2013627","DOI":"10.1007\/978-3-319-96884-1_20"},{"key":"9504_CR4","doi-asserted-by":"crossref","unstructured":"M. Abdalla, R. Gay, M. Raykova, H. Wee, Multi-input inner-product functional encryption from pairings, in J.-S. Coron, J.B. Nielsen, editors, EUROCRYPT\u00a02017, Part\u00a0I. LNCS, vol. 10210 (Springer, Heidelberg, 2017), pp. 601\u2013626","DOI":"10.1007\/978-3-319-56620-7_21"},{"key":"9504_CR5","doi-asserted-by":"crossref","unstructured":"S. Agrawal, D.M. Freeman, V. Vaikuntanathan, Functional encryption for inner product predicates from learning with errors, in D.H. Lee and X. Wang, editors, ASIACRYPT\u00a02011. LNCS, vol. 7073 (Springer, Heidelberg, 2011), pp. 21\u201340","DOI":"10.1007\/978-3-642-25385-0_2"},{"key":"9504_CR6","doi-asserted-by":"crossref","unstructured":"S. Agrawal, R. Goyal, J. Tomida, Multi-input quadratic functional encryption from pairings, in T. Malkin, C. Peikert, editors, CRYPTO\u00a02021, Part\u00a0IV. Virtual Event. LNCS, vol. 12828 (Springer, Heidelberg, 2021), pp. 208\u2013238","DOI":"10.1007\/978-3-030-84259-8_8"},{"key":"9504_CR7","doi-asserted-by":"crossref","unstructured":"S. Agrawal, R. Goyal, J. Tomida, Multi-input quadratic functional encryption: stronger security, broader functionality, in TCC 2022 (Springer, 2023), pp. 711\u2013740","DOI":"10.1007\/978-3-031-22318-1_25"},{"key":"9504_CR8","doi-asserted-by":"crossref","unstructured":"S. Agrawal, A. Yadav, S. Yamada, Multi-input attribute based encryption and predicate encryption, in CRYPTO 2022 (Springer, 2022), pp. 590\u2013621","DOI":"10.1007\/978-3-031-15802-5_21"},{"key":"9504_CR9","doi-asserted-by":"crossref","unstructured":"P. Ananth, A. Jain, Indistinguishability obfuscation from compact functional encryption, in R. Gennaro, M.J.B. Robshaw, editors, CRYPTO\u00a02015, Part\u00a0I. LNCS, vol. 9215 (Springer, Heidelberg, 2015), pp. 308\u2013326","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"9504_CR10","doi-asserted-by":"crossref","unstructured":"G. Ateniese, D. Francati, D. Nu\u00f1ez, D. Venturi, Match me if you can: Matchmaking encryption and its applications, in A. Boldyreva, D. Micciancio, editors, CRYPTO\u00a02019, Part\u00a0II. LNCS, vol. 11693 (Springer, Heidelberg, 2019), pp. 701\u2013731","DOI":"10.1007\/978-3-030-26951-7_24"},{"issue":"3","key":"9504_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-021-09381-4","volume":"34","author":"G Ateniese","year":"2021","unstructured":"G. Ateniese, D. Francati, D. Nu\u00f1ez, D. Venturi, Match me if you can: matchmaking encryption and its applications. J. Cryptol. 34(3), 1\u201350 (2021)","journal-title":"J. Cryptol."},{"key":"9504_CR12","doi-asserted-by":"crossref","unstructured":"N. Attrapadung, Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more, in P.Q. Nguyen, E. Oswald, editors, EUROCRYPT\u00a02014. LNCS, vol. 8441 (Springer, Heidelberg, 2014), pp. 557\u2013577","DOI":"10.1007\/978-3-642-55220-5_31"},{"key":"9504_CR13","doi-asserted-by":"crossref","unstructured":"B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S.P. Vadhan, K. Yang. On the (im)possibility of obfuscating programs, in J. Kilian, editor, CRYPTO\u00a02001. LNCS, vol. 2139 (Springer, Heidelberg, 2001), pp. 1\u201318","DOI":"10.1007\/3-540-44647-8_1"},{"key":"9504_CR14","doi-asserted-by":"crossref","unstructured":"A. Beimel, A. Gabizon, Y. Ishai, E. Kushilevitz, S. Meldgaard, A. Paskin-Cherniavsky, Non-interactive secure multiparty computation, in J.A. Garay, R. Gennaro, editors, CRYPTO\u00a02014, Part\u00a0II. LNCS, vol. 8617 (Springer, Heidelberg, 2014), pp. 387\u2013404","DOI":"10.1007\/978-3-662-44381-1_22"},{"key":"9504_CR15","doi-asserted-by":"crossref","unstructured":"N. Bitansky, V. Vaikuntanathan, Indistinguishability obfuscation from functional encryption, in V. Guruswami, editor, 56th FOCS (IEEE Computer Society Press, 2015), pp. 171\u2013190","DOI":"10.1109\/FOCS.2015.20"},{"key":"9504_CR16","doi-asserted-by":"crossref","unstructured":"D. Boneh, K. Lewi, M. Raykova, A. Sahai, M. Zhandry, J. Zimmerman, Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation, in E. Oswald, M. Fischlin, editors, EUROCRYPT\u00a02015, Part\u00a0II. LNCS, vol. 9057 (Springer, Heidelberg, 2015), pp. 563\u2013594","DOI":"10.1007\/978-3-662-46803-6_19"},{"key":"9504_CR17","doi-asserted-by":"crossref","unstructured":"D. Boneh, B. Waters, Conjunctive, subset, and range queries on encrypted data, in S.P. Vadhan, editor, TCC\u00a02007. LNCS, vol. 4392 (Springer, Heidelberg, 2007), pp. 535\u2013554","DOI":"10.1007\/978-3-540-70936-7_29"},{"key":"9504_CR18","unstructured":"Z. Brakerski, N. D\u00f6ttling, S. Garg, G. Malavolta, Factoring and pairings are not necessary for iO: circular-secure LWE suffices, in ICALP 2022 (Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 2022)"},{"key":"9504_CR19","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, A. Jain, I. Komargodski, A. Passel\u00e8gue, D. Wichs, Non-trivial witness encryption and null-iO from standard assumptions, in D. Catalano, R. De Prisco, editors, SCN 18. LNCS, vol. 11035 (Springer, Heidelberg, 2018), pp. 425\u2013441","DOI":"10.1007\/978-3-319-98113-0_23"},{"key":"9504_CR20","doi-asserted-by":"crossref","unstructured":"J. Chen, Y. Li, J. Wen, J. Weng, Identity-based matchmaking encryption from standard assumptions, in ASIACRYPT 2022 (Springer, 2022)","DOI":"10.1007\/978-3-031-22969-5_14"},{"key":"9504_CR21","doi-asserted-by":"crossref","unstructured":"J. Chotard, E.D. Sans, R. Gay, D.H. Phan, D. Pointcheval, Decentralized multi-client functional encryption for inner product, in T. Peyrin, S. Galbraith, editors, ASIACRYPT\u00a02018, Part\u00a0II. LNCS, vol. 11273 (Springer, Heidelberg, 2018), pp. 703\u2013732","DOI":"10.1007\/978-3-030-03329-3_24"},{"key":"9504_CR22","doi-asserted-by":"crossref","unstructured":"M. Ciampi, L. Siniscalchi, H. Waldner, Multi-client functional encryption for separable functions, in J. Garay, editor, PKC\u00a02021, Part\u00a0I. LNCS, vol. 12710 (Springer, Heidelberg, 2021), pp. 724\u2013753","DOI":"10.1007\/978-3-030-75245-3_26"},{"key":"9504_CR23","doi-asserted-by":"crossref","unstructured":"M. Clear, C. McGoldrick, Multi-identity and multi-key leveled FHE from learning with errors, in R. Gennaro, M.J.B. Robshaw, editors, CRYPTO\u00a02015, Part\u00a0II. LNCS, vol. 9216 (Springer, Heidelberg, 2015), pp. 630\u2013656","DOI":"10.1007\/978-3-662-48000-7_31"},{"key":"9504_CR24","doi-asserted-by":"crossref","unstructured":"P. Datta, T. Okamoto, J. Tomida, Full-hiding (unbounded) multi-input inner product functional encryption from the $$k$$-Linear assumption, in M. Abdalla, R. Dahab, editors, PKC\u00a02018, Part\u00a0II. LNCS, vol. 10770 (Springer, Heidelberg, 2018), pp. 245\u2013277","DOI":"10.1007\/978-3-319-76581-5_9"},{"key":"9504_CR25","doi-asserted-by":"crossref","unstructured":"D. Francati, D. Friolo, G. Malavolta, D. Venturi, Multi-key and multi-input predicate encryption from learning with errors, in Annual International Conference on the Theory and Applications of Cryptographic Techniques (Springer, 2023), pp. 573\u2013604","DOI":"10.1007\/978-3-031-30620-4_19"},{"key":"9504_CR26","doi-asserted-by":"crossref","unstructured":"D. Francati, A. Guidi, L. Russo, D. Venturi, Identity-based matchmaking encryption without random oracles, in INDOCRYPT 2021 (Springer, 2021), pp. 415\u2013435","DOI":"10.1007\/978-3-030-92518-5_19"},{"key":"9504_CR27","doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, A. Sahai, B. Waters, Witness encryption and its applications, in D. Boneh, T. Roughgarden, J. Feigenbaum, editors, 45th ACM STOC (ACM Press, 2013), pp. 467\u2013476","DOI":"10.1145\/2488608.2488667"},{"key":"9504_CR28","doi-asserted-by":"crossref","unstructured":"R. Gay, R. Pass, Indistinguishability obfuscation from circular security, in S. Khuller, V.V. Williams, editors, STOC \u201921: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21\u201325, 2021 (ACM, 2021), pp. 736\u2013749","DOI":"10.1145\/3406325.3451070"},{"key":"9504_CR29","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Dov Gordon, V. Goyal, A. Jain, J. Katz, F.-H. Liu, A. Sahai, E. Shi, H.-S. Zhou, Multi-input functional encryption, in P.Q. Nguyen, E. Oswald, editors, EUROCRYPT\u00a02014. LNCS, vol. 8441 (Springer, Heidelberg, 2014), pp. 578\u2013602","DOI":"10.1007\/978-3-642-55220-5_32"},{"key":"9504_CR30","doi-asserted-by":"crossref","unstructured":"S. Gorbunov, V. Vaikuntanathan, H. Wee, Predicate encryption for circuits from LWE, in R. Gennaro, M.J.B. Robshaw, editors, CRYPTO\u00a02015, Part\u00a0II. LNCS, vol. 9216 (Springer, Heidelberg, 2015), pp. 503\u2013523","DOI":"10.1007\/978-3-662-48000-7_25"},{"key":"9504_CR31","doi-asserted-by":"crossref","unstructured":"R. Goyal, V. Koppula, B. Waters, Lockable obfuscation, in C. Umans, editor, 58th FOCS (IEEE Computer Society Press, 2017), pp. 612\u2013621","DOI":"10.1109\/FOCS.2017.62"},{"key":"9504_CR32","doi-asserted-by":"crossref","unstructured":"S. Halevi, Y. Ishai, A. Jain, I. Komargodski, A. Sahai, E. Yogev, Non-interactive multiparty computation without correlated randomness, in T. Takagi, T. Peyrin, editors, ASIACRYPT\u00a02017, Part\u00a0III. LNCS, vol. 10626 (Springer, Heidelberg, 2017), pp. 181\u2013211","DOI":"10.1007\/978-3-319-70700-6_7"},{"key":"9504_CR33","doi-asserted-by":"crossref","unstructured":"S. Halevi, Y. Ishai, A. Jain, E. Kushilevitz, T. Rabin, Secure multiparty computation with general interaction patterns, in M. Sudan, editor, ITCS 2016 (ACM, 2016), pp. 157\u2013168","DOI":"10.1145\/2840728.2840760"},{"key":"9504_CR34","doi-asserted-by":"crossref","unstructured":"S. Halevi, Y. Lindell, B. Pinkas, Secure computation on the web: computing without simultaneous interaction, in P. Rogaway, editor, CRYPTO\u00a02011. LNCS, vol. 6841 (Springer, Heidelberg, 2011), pp. 132\u2013150","DOI":"10.1007\/978-3-642-22792-9_8"},{"key":"9504_CR35","doi-asserted-by":"crossref","unstructured":"A. Jain, H. Lin, A. Sahai, Indistinguishability obfuscation from well-founded assumptions, in S. Khuller, V.V. Williams, editors, STOC \u201921: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21\u201325, 2021 (ACM, 2021), pp. 60\u201373","DOI":"10.1145\/3406325.3451093"},{"key":"9504_CR36","doi-asserted-by":"crossref","unstructured":"A. Jain, H. Lin, A. Sahai, Indistinguishability obfuscation from LPN over $$\\mathbb{F}_p$$, DLIN, and PRGs in $${NC}^0$$, in O. Dunkelman, S. Dziembowski, editors, EUROCRYPT\u00a02022, Part\u00a0I. LNCS, vol. 13275 (Springer, Heidelberg, 2022), pp. 670\u2013699","DOI":"10.1007\/978-3-031-06944-4_23"},{"key":"9504_CR37","doi-asserted-by":"crossref","unstructured":"J. Katz, A. Sahai, B. Waters, Predicate encryption supporting disjunctions, polynomial equations, and inner products, in N.P. Smart, editor, EUROCRYPT\u00a02008. LNCS, vol. 4965 (Springer, Heidelberg, 2008), pp. 146\u2013162","DOI":"10.1007\/978-3-540-78967-3_9"},{"key":"9504_CR38","doi-asserted-by":"crossref","unstructured":"A.B. Lewko, T. Okamoto, A. Sahai, K. Takashima, B. Waters, Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption, in H. Gilbert, editor, EUROCRYPT\u00a02010. LNCS, vol. 6110 (Springer, Heidelberg, 2010), pp. 62\u201391","DOI":"10.1007\/978-3-642-13190-5_4"},{"key":"9504_CR39","doi-asserted-by":"crossref","unstructured":"B. Libert, R. Titiu, Multi-client functional encryption for linear functions in the standard model from LWE, in S.D. Galbraith, S. Moriai, editors, ASIACRYPT\u00a02019, Part\u00a0III. LNCS, vol. 11923 (Springer, Heidelberg, 2019), pp. 520\u2013551","DOI":"10.1007\/978-3-030-34618-8_18"},{"key":"9504_CR40","doi-asserted-by":"crossref","unstructured":"A. L\u00f3pez-Alt, E. Tromer, V. Vaikuntanathan, On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption, in H.J. Karloff, T. Pitassi, editors, 44th ACM STOC (ACM Press, 2012), pp. 1219\u20131234","DOI":"10.1145\/2213977.2214086"},{"key":"9504_CR41","doi-asserted-by":"crossref","unstructured":"P. Mukherjee, D. Wichs, Two round multiparty computation via multi-key FHE. In M. Fischlin, J.-S. Coron, editors, EUROCRYPT\u00a02016, Part\u00a0II. LNCS, vol. 9666 (Springer, Heidelberg, 2016), pp. 735\u2013763","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"9504_CR42","doi-asserted-by":"crossref","unstructured":"T. Okamoto, K. Takashima, Fully secure functional encryption with general relations from the decisional linear assumption, in T. Rabin, editor, CRYPTO\u00a02010. LNCS, vol. 6223 (Springer, Heidelberg, 2010), pp. 191\u2013208","DOI":"10.1007\/978-3-642-14623-7_11"},{"key":"9504_CR43","doi-asserted-by":"crossref","unstructured":"T. Okamoto, K. Takashima, Adaptively attribute-hiding (hierarchical) inner product encryption, in D. Pointcheval, T. Johansson, editors, EUROCRYPT\u00a02012. LNCS, vol. 7237 (Springer, Heidelberg, 2012), pp. 591\u2013608","DOI":"10.1007\/978-3-642-29011-4_35"},{"key":"9504_CR44","doi-asserted-by":"crossref","unstructured":"J. Tomida, Tightly secure inner product functional encryption: multi-input and function-hiding constructions, in S.D. Galbraith, S. Moriai, editors, ASIACRYPT\u00a02019, Part\u00a0III. LNCS, vol. 11923 (Springer, Heidelberg, 2019), pp. 459\u2013488","DOI":"10.1007\/978-3-030-34618-8_16"},{"key":"9504_CR45","doi-asserted-by":"crossref","unstructured":"B. Waters, Functional encryption for regular languages, in R. Safavi-Naini, R. Canetti, editors, CRYPTO\u00a02012. LNCS, vol. 7417 (Springer, Heidelberg, 2012), pp. 218\u2013235","DOI":"10.1007\/978-3-642-32009-5_14"},{"key":"9504_CR46","doi-asserted-by":"crossref","unstructured":"H. Wee, Dual system encryption via predicate encodings, in Y. Lindell, editor, TCC\u00a02014. LNCS, vol. 8349 (Springer, Heidelberg, 2014), pp. 616\u2013637","DOI":"10.1007\/978-3-642-54242-8_26"},{"key":"9504_CR47","doi-asserted-by":"crossref","unstructured":"H. Wee, D. Wichs, Candidate obfuscation via oblivious LWE sampling, in A. Canteaut, F.-X. Standaert, editors, EUROCRYPT\u00a02021, Part\u00a0III. LNCS, vol. 12698 (Springer, Heidelberg, 2021), pp. 127\u2013156","DOI":"10.1007\/978-3-030-77883-5_5"},{"key":"9504_CR48","doi-asserted-by":"crossref","unstructured":"D. Wichs, G. Zirdelis, Obfuscating compute-and-compare programs under LWE, in C. Umans, editor, 58th FOCS (IEEE Computer Society Press, 2017), pp. 600\u2013611","DOI":"10.1109\/FOCS.2017.61"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09504-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-024-09504-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09504-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T10:03:29Z","timestamp":1722333809000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-024-09504-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,14]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["9504"],"URL":"https:\/\/doi.org\/10.1007\/s00145-024-09504-7","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,14]]},"assertion":[{"value":"6 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"24"}}