{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:09:54Z","timestamp":1775326194709,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T00:00:00Z","timestamp":1615248000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T00:00:00Z","timestamp":1615248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100012325","name":"Bergische Universit\u00e4t Wuppertal","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100012325","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2021,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Forward secrecy is considered an essential design goal of modern key establishment (KE) protocols, such as TLS\u00a01.3, for example. Furthermore, efficiency considerations such as zero round-trip time (0-RTT), where a client is able to send cryptographically protected payload data along with the very first KE message, are motivated by the practical demand for secure low-latency communication. For a long time, it was unclear whether protocols that simultaneously achieve 0-RTT and full forward secrecy exist. Only recently, the first forward-secret 0-RTT protocol was described by G\u00fcnther et al. (<jats:sc>Eurocrypt<\/jats:sc>, 2017). It is based on puncturable encryption. Forward secrecy is achieved by \u201cpuncturing\u201d the secret key after each decryption operation, such that a given ciphertext can only be decrypted once (cf. also Green and Miers, S&amp;P 2015). Unfortunately, their scheme is completely impractical, since one puncturing operation takes between 30 s and several minutes for reasonable security and deployment parameters, such that this solution is only a first feasibility result, but not efficient enough to be deployed in practice. In this paper, we introduce a new primitive that we term Bloom filter encryption (BFE), which is derived from the probabilistic Bloom filter data structure. We describe different constructions of BFE schemes and show how these yield new puncturable encryption mechanisms with extremely efficient puncturing. Most importantly, a puncturing operation only involves a small number of very efficient computations, plus the deletion of certain parts of the secret key, which outperforms previous constructions by orders of magnitude. This gives rise to the first forward-secret 0-RTT protocols that are efficient enough to be deployed in practice. We believe that BFE will find applications beyond forward-secret 0-RTT protocols.<\/jats:p>","DOI":"10.1007\/s00145-021-09374-3","type":"journal-article","created":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T19:03:18Z","timestamp":1615316598000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange"],"prefix":"10.1007","volume":"34","author":[{"given":"David","family":"Derler","sequence":"first","affiliation":[]},{"given":"Kai","family":"Gellert","sequence":"additional","affiliation":[]},{"given":"Tibor","family":"Jager","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Slamanig","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Striecks","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,9]]},"reference":[{"key":"9374_CR1","doi-asserted-by":"crossref","unstructured":"S. Agrawal, D. Boneh, X. Boyen, Efficient lattice (H)IBE in the standard model, in: H. Gilbert (ed.) EUROCRYPT 2010. LNCS, vol. 6110 (Springer, Heidelberg, Germany, French Riviera, May 30\u2013June 3, 2010), pp. 553\u2013572","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"9374_CR2","doi-asserted-by":"crossref","unstructured":"N. Attrapadung, G. Hanaoka, S. Yamada, Conversions among several classes of predicate encryption and applications to ABE with various compactness tradeoffs, in T. Iwata, J.H. Cheon (eds.) ASIACRYPT 2015, Part I. LNCS, vol. 9452 (Springer, Heidelberg, Germany, Auckland, New Zealand, Nov 30\u2013Dec 3, 2015), pp. 575\u2013601","DOI":"10.1007\/978-3-662-48797-6_24"},{"key":"9374_CR3","doi-asserted-by":"crossref","unstructured":"N. Aviram, K. Gellert, T. Jager, Session resumption protocols and efficient forward security for TLS 1.3 0-RTT, in Y. Ishai, V. Rijmen (eds.) EUROCRYPT 2019, Part II. LNCS, vol. 11477 (Springer, Heidelberg, Germany, Darmstadt, Germany, May 19\u201323, 2019), pp. 117\u2013150","DOI":"10.1007\/978-3-030-17656-3_5"},{"issue":"4","key":"9374_CR4","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1007\/s00145-018-9280-5","volume":"32","author":"R Barbulescu","year":"2019","unstructured":"R. Barbulescu, S. Duquesne, Updating key size estimations for pairings. Journal of Cryptology 32(4), 1298\u20131336 (2019)","journal-title":"J. Cryptol."},{"key":"9374_CR5","doi-asserted-by":"crossref","unstructured":"P.S.L.M. Barreto, B. Lynn, M. Scott, Constructing elliptic curves with prescribed embedding degrees, in S. Cimato, C. Galdi, G. Persiano (eds.) SCN 02. LNCS, vol. 2576 (Springer, Heidelberg, Germany, Amalfi, Italy, Sep 12\u201313, 2003), pp. 257\u2013267","DOI":"10.1007\/3-540-36413-7_19"},{"key":"9374_CR6","doi-asserted-by":"crossref","unstructured":"P.S.L.M. Barreto, M. Naehrig, Pairing-friendly elliptic curves of prime order, in B. Preneel, S. Tavares (eds.) SAC 2005. LNCS, vol. 3897 (Springer, Heidelberg, Germany, Kingston, Ontario, Canada, Aug 11\u201312, 2006), pp. 319\u2013331","DOI":"10.1007\/11693383_22"},{"key":"9374_CR7","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 (eds.) ACM CCS 93. (ACM Press, Fairfax, Virginia, USA, Nov 3\u20135, 1993), pp. 62\u201373","DOI":"10.1145\/168588.168596"},{"key":"9374_CR8","doi-asserted-by":"crossref","unstructured":"J. Bethencourt, A. Sahai, B. Waters, Ciphertext-policy attribute-based encryption, in 2007 IEEE Symposium on Security and Privacy. (IEEE Computer Society Press, Oakland, CA, USA, May 20\u201323, 2007), pp. 321\u2013334","DOI":"10.1109\/SP.2007.11"},{"key":"9374_CR9","doi-asserted-by":"crossref","unstructured":"O. Blazy, E. Kiltz, J. Pan, (Hierarchical) identity-based encryption from affine message authentication, in J.A. Garay, R. Gennaro (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, Aug 17\u201321, 2014), pp. 408\u2013425","DOI":"10.1007\/978-3-662-44371-2_23"},{"issue":"7","key":"9374_CR10","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"B.H. Bloom, Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"9374_CR11","doi-asserted-by":"crossref","unstructured":"D. Boneh, X. Boyen, E.J. Goh, Hierarchical identity based encryption with constant size ciphertext, in R. Cramer (ed.) EUROCRYPT 2005. LNCS, vol. 3494 (Springer, Heidelberg, Germany, Aarhus, Denmark, May 22\u201326, 2005), pp. 440\u2013456","DOI":"10.1007\/11426639_26"},{"key":"9374_CR12","doi-asserted-by":"crossref","unstructured":"D. Boneh, M.K. Franklin, Identity-based encryption from the Weil pairing, in J. Kilian (ed.) CRYPTO 2001. LNCS, vol. 2139 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, Aug 19\u201323, 2001), pp. 213\u2013229","DOI":"10.1007\/3-540-44647-8_13"},{"key":"9374_CR13","doi-asserted-by":"crossref","unstructured":"D. Boneh, B. Lynn, H. Shacham, Short signatures from the Weil pairing, in: C. Boyd (ed.) ASIACRYPT 2001. LNCS, vol. 2248 (Springer, Heidelberg, Germany, Gold Coast, Australia, Dec 9\u201313, 2001), pp. 514\u2013532","DOI":"10.1007\/3-540-45682-1_30"},{"key":"9374_CR14","doi-asserted-by":"crossref","unstructured":"C. Boyd, K. Gellert, A modern view on forward security. Comput. J. (2020), to appear","DOI":"10.1093\/comjnl\/bxaa104"},{"key":"9374_CR15","doi-asserted-by":"crossref","unstructured":"R. Canetti, S. Halevi, J. Katz, A forward-secure public-key encryption scheme, in E. Biham (ed.) EUROCRYPT 2003. LNCS, vol. 2656 (Springer, Heidelberg, Germany, Warsaw, Poland, May 4\u20138, 2003), pp. 255\u2013271","DOI":"10.1007\/3-540-39200-9_16"},{"key":"9374_CR16","doi-asserted-by":"crossref","unstructured":"R. Canetti, S. Halevi, J. Katz, Chosen-ciphertext security from identity-based encryption, in C. Cachin, J. Camenisch (eds.) EUROCRYPT 2004. LNCS, vol. 3027 (Springer, Heidelberg, Germany, Interlaken, Switzerland, May 2\u20136, 2004), pp. 207\u2013222","DOI":"10.1007\/978-3-540-24676-3_13"},{"key":"9374_CR17","unstructured":"R. Canetti, S. Raghuraman, S. Richelson, V. Vaikuntanathan, Chosen-ciphertext secure fully homomorphic encryption, in Public-Key Cryptography\u2014PKC 2017 (2017), pp. 213\u2013240"},{"key":"9374_CR18","doi-asserted-by":"crossref","unstructured":"C. Chen, J. Chen, H.W. Lim, Z. Zhang, D. Feng, S. Ling, H. Wang, Fully secure attribute-based systems with short ciphertexts\/signatures and threshold access structures, in E. Dawson (ed.) CT-RSA 2013. LNCS, vol. 7779 (Springer, Heidelberg, Germany, San Francisco, CA, USA, Feb 25\u2013Mar 1, 2013), pp. 50\u201367","DOI":"10.1007\/978-3-642-36095-4_4"},{"key":"9374_CR19","doi-asserted-by":"crossref","unstructured":"J. Chen, H. Wee, Fully, (almost) tightly secure IBE and dual system groups, in: R. Canetti, J.A. Garay (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, Aug 18\u201322, 2013), pp. 435\u2013460","DOI":"10.1007\/978-3-642-40084-1_25"},{"key":"9374_CR20","doi-asserted-by":"crossref","unstructured":"A. Cohen, J. Holmgren, R. Nishimaki, V. Vaikuntanathan, D. Wichs, Watermarking cryptographic capabilities, in D. Wichs, Y. Mansour (eds.) 48th ACM STOC. (ACM Press, Cambridge, MA, USA, Jun 18\u201321, 2016), pp. 1115\u20131127","DOI":"10.1145\/2897518.2897651"},{"key":"9374_CR21","unstructured":"F. Dallmeier, J.P. Drees, K. Gellert, T. Handirk, T. Jager, J. Klauke, S. Nachtigall, T. Renzelmann, R. Wolf, Forward-secure 0-RTT goes live: implementation and performance analysis in QUIC. Cryptology ePrint Archive, Report 2020\/824 (2020), https:\/\/eprint.iacr.org\/2020\/824"},{"key":"9374_CR22","doi-asserted-by":"crossref","unstructured":"C. Delerabl\u00e9e, Identity-based broadcast encryption with constant size ciphertexts and private keys, in K. Kurosawa (ed.) ASIACRYPT 2007. LNCS, vol. 4833 (Springer, Heidelberg, Germany, Kuching, Malaysia, Dec 2\u20136, 2007), pp. 200\u2013215","DOI":"10.1007\/978-3-540-76900-2_12"},{"key":"9374_CR23","doi-asserted-by":"crossref","unstructured":"D. Derler, T. Jager, D. Slamanig, C. Striecks, Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange, in J.B. Nielsen, V. Rijmen (eds.) EUROCRYPT 2018, Part III. LNCS, vol. 10822 (Springer, Heidelberg, Germany, Tel Aviv, Israel, Apr 29\u2013May 3, 2018), pp. 425\u2013455","DOI":"10.1007\/978-3-319-78372-7_14"},{"key":"9374_CR24","doi-asserted-by":"crossref","unstructured":"D. Derler, S. Krenn, T. Lor\u00fcnser, S. Ramacher, D. Slamanig, C. Striecks, Revisiting proxy re-encryption: forward secrecy, improved security, and applications, in M. Abdalla (ed.) PKC 2018. LNCS, Springer (2018)","DOI":"10.1007\/978-3-319-76578-5_8"},{"key":"9374_CR25","doi-asserted-by":"crossref","unstructured":"E. Fujisaki, T. Okamoto, Secure integration of asymmetric and symmetric encryption schemes, in M.J. Wiener (ed.) CRYPTO\u201999. LNCS, vol. 1666 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, Aug 15\u201319, 1999), pp. 537\u2013554","DOI":"10.1007\/3-540-48405-1_34"},{"key":"9374_CR26","unstructured":"K. Gellert, Construction and security analysis of 0-RTT protocols. PhD thesis (2020)"},{"key":"9374_CR27","doi-asserted-by":"crossref","unstructured":"C. Gentry, A. Silverberg, Hierarchical ID-based cryptography, in Y. Zheng (ed.) ASIACRYPT 2002. LNCS, vol. 2501 (Springer, Heidelberg, Germany, Queenstown, New Zealand, Dec 1\u20135, 2002), pp. 548\u2013566","DOI":"10.1007\/3-540-36178-2_34"},{"key":"9374_CR28","unstructured":"D. Giampaolo, Practical File System Design with the Be File System. Morgan Kaufmann Publishers Inc., 1st edn (1998)"},{"key":"9374_CR29","doi-asserted-by":"publisher","unstructured":"A. Goel, P. Gupta, Small subset queries and bloom filters using ternary associative memories, with applications, in V. Misra, P. Barford, M.S. Squillante (eds.) SIGMETRICS 2010, Proceedings of the 2010 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, New York, New York, USA, 14\u201318 June 2010 (ACM, 2010), pp. 143\u2013154. https:\/\/doi.org\/10.1145\/1811039.1811056","DOI":"10.1145\/1811039.1811056"},{"key":"9374_CR30","unstructured":"V. Goyal, O. Pandey, A. Sahai, B. Waters, Attribute-based encryption for fine-grained access control of encrypted data, in A. Juels, R.N. Wright, S. De Capitani di Vimercati (eds.) ACM CCS 2006 (ACM Press, Alexandria, Virginia, USA, Oct 30\u2013Nov 3, 2006), pp. 89\u201398, available as Cryptology ePrint Archive Report 2006\/309"},{"key":"9374_CR31","doi-asserted-by":"crossref","unstructured":"M.D. Green, I. Miers, Forward secure asynchronous messaging from puncturable encryption, in 2015 IEEE Symposium on Security and Privacy (IEEE Computer Society Press, San Jose, CA, USA, May 17\u201321, 2015), pp. 305\u2013320","DOI":"10.1109\/SP.2015.26"},{"key":"9374_CR32","doi-asserted-by":"crossref","unstructured":"J. Groth, Simulation-sound NIZK proofs for a practical language and constant size group signatures, in X. Lai, K. Chen (eds.) ASIACRYPT 2006. LNCS, vol. 4284 (Springer, Heidelberg, Germany, Shanghai, China, Dec 3\u20137, 2006), pp. 444\u2013459","DOI":"10.1007\/11935230_29"},{"key":"9374_CR33","doi-asserted-by":"crossref","unstructured":"F. G\u00fcnther, B. Hale, T. Jager, S. Lauer, 0-RTT key exchange with full forward secrecy, in: J. Coron, J.B. Nielsen (eds.) EUROCRYPT 2017, Part III. LNCS, vol. 10212 (Springer, Heidelberg, Germany, Paris, France, Apr 30\u2013May 4, 2017), pp. 519\u2013548","DOI":"10.1007\/978-3-319-56617-7_18"},{"key":"9374_CR34","unstructured":"F. G\u00fcnther, B. Hale, T. Jager, S. Lauer, 0-RTT key exchange with full forward secrecy. Cryptology ePrint Archive, Report 2017\/223 (2017), http:\/\/eprint.iacr.org\/2017\/223"},{"key":"9374_CR35","doi-asserted-by":"crossref","unstructured":"B. Hale, T. Jager, S. Lauer, J. Schwenk, Simple security definitions for and constructions of 0-RTT key exchange, in D. Gollmann, A. Miyaji, H. Kikuchi (eds.) ACNS 17. LNCS, vol. 10355 (Springer, Heidelberg, Germany, Kanazawa, Japan, Jul 10\u201312, 2017), pp. 20\u201338","DOI":"10.1007\/978-3-319-61204-1_2"},{"key":"9374_CR36","doi-asserted-by":"crossref","unstructured":"S. Halevi, H. Krawczyk, One-pass HMQV and asymmetric key-wrapping, in D. Catalano, N. Fazio, R. Gennaro, A. Nicolosi (eds.) PKC 2011. LNCS, vol. 6571 (Springer, Heidelberg, Germany, Taormina, Italy, Mar 6\u20139, 2011), pp. 317\u2013334","DOI":"10.1007\/978-3-642-19379-8_20"},{"key":"9374_CR37","doi-asserted-by":"crossref","unstructured":"D. Hofheinz, K. H\u00f6velmanns, E. Kiltz, A modular analysis of the Fujisaki-Okamoto transformation. In: Y. Kalai, L. Reyzin (eds.) TCC 2017, Part I. LNCS, vol. 10677 (Springer, Heidelberg, Germany, Baltimore, MD, USA, Nov 12\u201315, 2017), pp. 341\u2013371","DOI":"10.1007\/978-3-319-70500-2_12"},{"key":"9374_CR38","unstructured":"D. Hofheinz, K. H\u00f6velmanns, E. Kiltz, A modular analysis of the fujisaki-okamoto transformation. Cryptology ePrint Archive, Report 2017\/604 (2017), http:\/\/eprint.iacr.org\/2017\/604"},{"key":"9374_CR39","doi-asserted-by":"crossref","unstructured":"T. Kim, R. Barbulescu, Extended tower number field sieve: A new complexity for the medium prime case, in M. Robshaw, J. Katz (eds.) CRYPTO 2016, Part I. LNCS, vol. 9814 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, Aug 14\u201318, 2016), pp. 543\u2013571","DOI":"10.1007\/978-3-662-53018-4_20"},{"key":"9374_CR40","unstructured":"S. Lauer, K. Gellert, R. Merget, T. Handirk, J. Schwenk, T0RTT: non-interactive immediate forward-secret single-pass circuit construction, in Proceedings on Privacy Enhancing Technologies, vol. 2020, no. 2 (2020), pp. 336\u2013357"},{"issue":"6","key":"9374_CR41","doi-asserted-by":"publisher","first-page":"2182","DOI":"10.1137\/120867044","volume":"42","author":"S Lovett","year":"2013","unstructured":"S. Lovett, E. Porat, A space lower bound for dynamic approximate membership data structures. SIAM J. Comput. 42(6), 2182\u20132196 (2013)","journal-title":"SIAM J. Comput."},{"key":"9374_CR42","unstructured":"A. Menezes, P. Sarkar, S. Singh, Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography. IACR Cryptology ePrint Archive 2016, 1102 (2016), http:\/\/eprint.iacr.org\/2016\/1102"},{"key":"9374_CR43","doi-asserted-by":"crossref","unstructured":"M. Naor, E. Yogev, Bloom filters in adversarial environments, in R. Gennaro, M.J.B. Robshaw (eds.) CRYPTO 2015, Part II. LNCS, vol. 9216 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, Aug 16\u201320, 2015), pp. 565\u2013584","DOI":"10.1007\/978-3-662-48000-7_28"},{"key":"9374_CR44","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky, A. Sahai, B. Waters, Attribute-based encryption with non-monotonic access structures, in P. Ning, S. De Capitani di Vimercati, P.F. Syverson (eds.) ACM CCS 2007. (ACM Press, Alexandria, Virginia, USA, Oct 28\u201331, 2007), pp. 195\u2013203","DOI":"10.1145\/1315245.1315270"},{"key":"9374_CR45","doi-asserted-by":"crossref","unstructured":"E. Rescorla, The Transport Layer Security (TLS) Protocol Version 1.3. RFC 8446 (2018), https:\/\/rfc-editor.org\/rfc\/rfc8446.txt","DOI":"10.17487\/RFC8446"},{"key":"9374_CR46","doi-asserted-by":"crossref","unstructured":"S.F. Sun, A. Sakzad, R. Steinfeld, J.K. Liu, D. Gu, Public-key puncturable encryption: Modular and compact constructions, in A. Kiayias, M. Kohlweiss, P. Wallden, V. Zikas (eds.) Public-Key Cryptography\u2014PKC 2020 (Springer International Publishing, Cham, 2020), pp. 309\u2013338","DOI":"10.1007\/978-3-030-45374-9_11"},{"key":"9374_CR47","unstructured":"M. Thomson, J. Iyengar, QUIC: a UDP-based multiplexed and secure transport. Internet-Draft draft-ietf-quic-transport-02, Internet Engineering Task Force (Mar 2017), https:\/\/datatracker.ietf.org\/doc\/html\/draft-ietf-quic-transport-02, work in Progress"},{"key":"9374_CR48","doi-asserted-by":"crossref","unstructured":"B. Waters, Dual system encryption: realizing fully secure IBE and HIBE under simple assumptions, in S. Halevi (ed.) CRYPTO 2009. LNCS, vol. 5677 (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, Aug 16\u201320, 2009), pp. 619\u2013636","DOI":"10.1007\/978-3-642-03356-8_36"},{"key":"9374_CR49","doi-asserted-by":"crossref","unstructured":"D.J. Wu, A. Taly, A.D. Shankar, Boneh, Privacy, discovery, and authentication for the internet of things, in I.G. Askoxylakis, S. Ioannidis, S.K. Katsikas, C.A. Meadows (eds.) ESORICS 2016, Part II. LNCS, vol. 9879 (Springer, Heidelberg, Germany, Heraklion, Greece, Sep 26\u201330, 2016), pp. 301\u2013319","DOI":"10.1007\/978-3-319-45741-3_16"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09374-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-021-09374-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09374-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T20:07:19Z","timestamp":1698005239000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-021-09374-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,9]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["9374"],"URL":"https:\/\/doi.org\/10.1007\/s00145-021-09374-3","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,9]]},"assertion":[{"value":"27 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"13"}}