{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T16:41:58Z","timestamp":1778258518333,"version":"3.51.4"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,10,22]],"date-time":"2015-10-22T00:00:00Z","timestamp":1445472000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00145-015-9220-6","type":"journal-article","created":{"date-parts":[[2015,10,22]],"date-time":"2015-10-22T20:38:21Z","timestamp":1445546301000},"page":"242-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":79,"title":["An Algebraic Framework for Diffie\u2013Hellman Assumptions"],"prefix":"10.1007","volume":"30","author":[{"given":"Alex","family":"Escala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gottfried","family":"Herold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eike","family":"Kiltz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carla","family":"R\u00e0fols","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Villar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,22]]},"reference":[{"key":"9220_CR1","doi-asserted-by":"crossref","unstructured":"O.\u00a0Blazy, D.\u00a0Pointcheval, and D.\u00a0Vergnaud, Round-optimal privacy-preserving protocols with smooth projective hash functions. In R.\u00a0Cramer, editor, TCC\u00a02012, vol. 7194 of LNCS, pp. 94\u2013111, Taormina, Sicily, Italy, March\u00a019\u201321, 2012. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-28914-9_6"},{"key":"9220_CR2","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, X.\u00a0Boyen, and E.-J. Goh, Hierarchical identity based encryption with constant size ciphertext. In R.\u00a0Cramer, editor, EUROCRYPT\u00a02005, vol. 3494 of LNCS, pp. 440\u2013456, Aarhus, Denmark, May\u00a022\u201326, 2005. Springer, Berlin, Germany","DOI":"10.1007\/11426639_26"},{"key":"9220_CR3","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, X.\u00a0Boyen, and H.\u00a0Shacham, Short group signatures. In M.\u00a0Franklin, editor, CRYPTO\u00a02004, vol. 3152 of LNCS, pp. 41\u201355, Santa Barbara, CA, USA, Aug.\u00a015\u201319, 2004. Springer, Berlin, Germany","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"9220_CR4","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh and M.\u00a0K. Franklin, Identity-based encryption from the Weil pairing. In J.\u00a0Kilian, editor, CRYPTO\u00a02001, vol. 2139 of LNCS, pp. 213\u2013229, Santa Barbara, CA, USA, Aug.\u00a019\u201323, 2001. Springer, Berlin, Germany","DOI":"10.1007\/3-540-44647-8_13"},{"key":"9220_CR5","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, S.\u00a0Halevi, M.\u00a0Hamburg, and R.\u00a0Ostrovsky, Circular-secure encryption from decision Diffie\u2013Hellman. In D.\u00a0Wagner, editor, CRYPTO 2008, vol. 5157 of LNCS, pp. 108\u2013125, Santa Barbara, CA, USA, Aug.\u00a017\u201321, 2008. Springer, Berlin, Germany","DOI":"10.1007\/978-3-540-85174-5_7"},{"key":"9220_CR6","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, H.\u00a0W. Montgomery, and A.\u00a0Raghunathan, Algebraic pseudorandom functions with improved efficiency from the augmented cascade. In E.\u00a0Al-Shaer, A.\u00a0D. Keromytis, and V.\u00a0Shmatikov, editors, ACM CCS 10, pp. 131\u2013140, Chicago, Illinois, USA, Oct.\u00a04\u20138, 2010. ACM Press","DOI":"10.1145\/1866307.1866323"},{"key":"9220_CR7","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, A.\u00a0Sahai, and B.\u00a0Waters, Fully collusion resistant traitor tracing with short ciphertexts and private keys. In S.\u00a0Vaudenay, editor, EUROCRYPT\u00a02006, vol. 4004 of LNCS, pp. 573\u2013592, St. Petersburg, Russia, May\u00a028\u2013June\u00a01, 2006. Springer, Berlin, Germany","DOI":"10.1007\/11761679_34"},{"key":"9220_CR8","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh and A.\u00a0Silverberg, Applications of multilinear forms to cryptography. Contemporary Mathematics, 324:71\u201390, 2003","DOI":"10.1090\/conm\/324\/05731"},{"key":"9220_CR9","doi-asserted-by":"crossref","unstructured":"X.\u00a0Boyen, The uber-assumption family (invited talk). In S.\u00a0D. Galbraith and K.\u00a0G. Paterson, editors, PAIRING 2008, vol. 5209 of LNCS, pp. 39\u201356, Egham, UK, Sept.\u00a01\u20133, 2008. Springer, Berlin, Germany","DOI":"10.1007\/978-3-540-85538-5_3"},{"key":"9220_CR10","doi-asserted-by":"crossref","unstructured":"J.\u00a0Camenisch, N.\u00a0Chandran, and V.\u00a0Shoup, A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks. In A.\u00a0Joux, editor, EUROCRYPT\u00a02009, vol. 5479 of LNCS, pp. 351\u2013368, Cologne, Germany, April\u00a026\u201330, 2009. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-01001-9_20"},{"key":"9220_CR11","unstructured":"D. Cox, J. Little, and D. O\u2019Shea, Ideal, Varieties and Algorithms. Springer, second edition, 1996"},{"key":"9220_CR12","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cramer and V.\u00a0Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In H.\u00a0Krawczyk, editor, CRYPTO\u201998, vol. 1462 of LNCS, pp. 13\u201325, Santa Barbara, CA, USA, Aug.\u00a023\u201327, 1998. Springer, Berlin, Germany","DOI":"10.1007\/BFb0055717"},{"key":"9220_CR13","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cramer and V.\u00a0Shoup, Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In L.\u00a0R. Knudsen, editor, EUROCRYPT\u00a02002, vol. 2332 of LNCS, pp. 45\u201364, Amsterdam, The Netherlands, April\u00a028\u2013May\u00a02, 2002. Springer, Berlin, Germany","DOI":"10.1007\/3-540-46035-7_4"},{"key":"9220_CR14","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cramer and V.\u00a0Shoup, Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal on Computing, 33(1):167\u2013226, 2003","DOI":"10.1137\/S0097539702403773"},{"key":"9220_CR15","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Dodis, K.\u00a0Haralambiev, A.\u00a0L\u00f3pez-Alt, and D.\u00a0Wichs, Cryptography against continuous memory attacks. In 51st FOCS, pp. 511\u2013520, Las Vegas, Nevada, USA, Oct.\u00a023\u201326, 2010. IEEE Computer Society Press","DOI":"10.1109\/FOCS.2010.56"},{"key":"9220_CR16","doi-asserted-by":"crossref","unstructured":"A.\u00a0Escala, G.\u00a0Herold, E.\u00a0Kiltz, C.\u00a0R\u00e0fols, and J.\u00a0Villar, An algebraic framework for Diffie-Hellman assumptions. In R.\u00a0Canetti and J.\u00a0A. Garay, editors, CRYPTO\u00a02013, Part II, vol. 8043 of LNCS, pp. 129\u2013147, Santa Barbara, CA, USA, Aug.\u00a018\u201322, 2013. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-40084-1_8"},{"key":"9220_CR17","doi-asserted-by":"crossref","unstructured":"M.\u00a0Fischlin, B.\u00a0Libert, and M.\u00a0Manulis, Non-interactive and re-usable universally composable string commitments with adaptive security. In D.\u00a0H. Lee and X.\u00a0Wang, editors, ASIACRYPT\u00a02011, vol. 7073 of LNCS, pp. 468\u2013485, Seoul, South Korea, Dec.\u00a04\u20138, 2011. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-25385-0_25"},{"key":"9220_CR18","doi-asserted-by":"crossref","unstructured":"D.\u00a0M. Freeman, Converting pairing-based cryptosystems from composite-order groups to prime-order groups. In H.\u00a0Gilbert, editor, EUROCRYPT\u00a02010, vol. 6110 of LNCS, pp. 44\u201361, French Riviera, May\u00a030\u2013June\u00a03, 2010. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-13190-5_3"},{"key":"9220_CR19","doi-asserted-by":"crossref","unstructured":"D.\u00a0Galindo, J.\u00a0Herranz, and J.\u00a0L. Villar, Identity-based encryption with master key-dependent message security and leakage-resilience. In S.\u00a0Foresti, M.\u00a0Yung, and F.\u00a0Martinelli, editors, ESORICS\u00a02012, vol. 7459 of LNCS, pp. 627\u2013642, Pisa, Italy, Sept.\u00a010\u201312, 2012. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-33167-1_36"},{"key":"9220_CR20","doi-asserted-by":"crossref","unstructured":"R.\u00a0Gennaro and Y.\u00a0Lindell, A framework for password-based authenticated key exchange. In E.\u00a0Biham, editor, EUROCRYPT\u00a02003, vol. 2656 of LNCS, pp. 524\u2013543, Warsaw, Poland, May\u00a04\u20138, 2003. Springer, Berlin, Germany. http:\/\/eprint.iacr.org\/2003\/032.ps.gz","DOI":"10.1007\/3-540-39200-9_33"},{"key":"9220_CR21","doi-asserted-by":"crossref","unstructured":"J.\u00a0Groth and A.\u00a0Sahai, Efficient noninteractive proof systems for bilinear groups. SIAM J. Comput., 41(5):1193\u20131232, 2012","DOI":"10.1137\/080725386"},{"key":"9220_CR22","doi-asserted-by":"crossref","unstructured":"D.\u00a0Hofheinz and T.\u00a0Jager, Tightly secure signatures and public-key encryption. In R.\u00a0Safavi-Naini and R.\u00a0Canetti, editors, CRYPTO\u00a02012, vol. 7417 of LNCS, pp. 590\u2013607, Santa Barbara, CA, USA, Aug.\u00a019\u201323, 2012. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-32009-5_35"},{"key":"9220_CR23","doi-asserted-by":"crossref","unstructured":"D.\u00a0Hofheinz and E.\u00a0Kiltz, Secure hybrid encryption from weakened key encapsulation. In A.\u00a0Menezes, editor, CRYPTO\u00a02007, vol. 4622 of LNCS, pp. 553\u2013571, Santa Barbara, CA, USA, Aug.\u00a019\u201323, 2007. Springer, Berlin, Germany","DOI":"10.1007\/978-3-540-74143-5_31"},{"key":"9220_CR24","doi-asserted-by":"crossref","unstructured":"A.\u00a0Joux, A one round protocol for tripartite Diffie\u2013Hellman. Journal of Cryptology, 17(4):263\u2013276, Sept. 2004","DOI":"10.1007\/s00145-004-0312-y"},{"key":"9220_CR25","doi-asserted-by":"crossref","unstructured":"C.\u00a0S. Jutla and A.\u00a0Roy, Shorter quasi-adaptive NIZK proofs for linear subspaces. In K.\u00a0Sako and P.\u00a0Sarkar, editors, ASIACRYPT\u00a02013, Part I, vol. 8269 of LNCS, pp. 1\u201320, Bangalore, India, Dec.\u00a01\u20135, 2013. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-42033-7_1"},{"key":"9220_CR26","doi-asserted-by":"crossref","unstructured":"C.\u00a0S. Jutla and A.\u00a0Roy, Switching lemma for bilinear tests and constant-size NIZK proofs for linear subspaces. In J.\u00a0A. Garay and R.\u00a0Gennaro, editors, CRYPTO\u00a02014, Part II, vol. 8617 of LNCS, pp. 295\u2013312, Santa Barbara, CA, USA, Aug.\u00a017\u201321, 2014. Springer, Berlin, Germany","DOI":"10.1007\/978-3-662-44381-1_17"},{"key":"9220_CR27","doi-asserted-by":"crossref","unstructured":"J.\u00a0Katz and V.\u00a0Vaikuntanathan, Round-optimal password-based authenticated key exchange. In Y.\u00a0Ishai, editor, TCC\u00a02011, vol. 6597 of LNCS, pp. 293\u2013310, Providence, RI, USA, March\u00a028\u201330, 2011. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-19571-6_18"},{"key":"9220_CR28","doi-asserted-by":"crossref","unstructured":"E.\u00a0Kiltz, A tool box of cryptographic functions related to the Diffie-Hellman function. In C.\u00a0P. Rangan and C.\u00a0Ding, editors, INDOCRYPT\u00a02001, vol. 2247 of LNCS, pp. 339\u2013350, Chennai, India, Dec.\u00a016\u201320, 2001. Springer, Berlin, Germany","DOI":"10.1007\/3-540-45311-3_32"},{"key":"9220_CR29","doi-asserted-by":"crossref","unstructured":"E.\u00a0Kiltz, Chosen-ciphertext security from tag-based encryption. In S.\u00a0Halevi and T.\u00a0Rabin, editors, TCC\u00a02006, vol. 3876 of LNCS, pp. 581\u2013600, New York, NY, USA, March\u00a04\u20137, 2006. Springer, Berlin, Germany","DOI":"10.1007\/11681878_30"},{"key":"9220_CR30","doi-asserted-by":"crossref","unstructured":"E.\u00a0Kiltz, K.\u00a0Pietrzak, M.\u00a0Stam, and M.\u00a0Yung, A new randomness extraction paradigm for hybrid encryption. In A.\u00a0Joux, editor, EUROCRYPT\u00a02009, vol. 5479 of LNCS, pp. 590\u2013609, Cologne, Germany, April\u00a026\u201330, 2009. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-01001-9_34"},{"key":"9220_CR31","doi-asserted-by":"crossref","unstructured":"E.\u00a0Kiltz and H.\u00a0Wee, Quasi-adaptive NIZK for linear subspaces revisited. In E.\u00a0Oswald and M.\u00a0Fischlin, editors, EUROCRYPT\u00a02015, Part II, vol. 9057 of LNCS, pp. 101\u2013128, Sofia, Bulgaria, April\u00a026\u201330, 2015. Springer, Berlin, Germany","DOI":"10.1007\/978-3-662-46803-6_4"},{"key":"9220_CR32","doi-asserted-by":"crossref","unstructured":"A.\u00a0B. Lewko, T.\u00a0Okamoto, A.\u00a0Sahai, K.\u00a0Takashima, and B.\u00a0Waters, Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption. In H.\u00a0Gilbert, editor, EUROCRYPT\u00a02010, vol. 6110 of LNCS, pp. 62\u201391, French Riviera, May\u00a030\u2013June\u00a03, 2010. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-13190-5_4"},{"key":"9220_CR33","doi-asserted-by":"crossref","unstructured":"A.\u00a0B. Lewko and B.\u00a0Waters, Efficient pseudorandom functions from the decisional linear assumption and weaker variants. In E.\u00a0Al-Shaer, S.\u00a0Jha, and A.\u00a0D. Keromytis, editors, ACM CCS 09, pp. 112\u2013120, Chicago, Illinois, USA, Nov.\u00a09\u201313, 2009. ACM Press","DOI":"10.1145\/1653662.1653677"},{"key":"9220_CR34","doi-asserted-by":"crossref","unstructured":"B.\u00a0Libert, T.\u00a0Peters, M.\u00a0Joye, and M.\u00a0Yung, Non-malleability from malleability: Simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures. In P.\u00a0Q. Nguyen and E.\u00a0Oswald, editors, EUROCRYPT\u00a02014, vol. 8441 of LNCS, pp. 514\u2013532, Copenhagen, Denmark, May\u00a011\u201315, 2014. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-55220-5_29"},{"key":"9220_CR35","doi-asserted-by":"crossref","unstructured":"B.\u00a0Libert and M.\u00a0Yung, Non-interactive CCA-secure threshold cryptosystems with adaptive security: New framework and constructions. In R.\u00a0Cramer, editor, TCC\u00a02012, vol. 7194 of LNCS, pp. 75\u201393, Taormina, Sicily, Italy, March\u00a019\u201321, 2012. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-28914-9_5"},{"key":"9220_CR36","doi-asserted-by":"crossref","unstructured":"S.\u00a0Meiklejohn, H.\u00a0Shacham, and D.\u00a0M. Freeman, Limitations on transformations from composite-order to prime-order groups: The case of round-optimal blind signatures. In M.\u00a0Abe, editor, ASIACRYPT\u00a02010, vol. 6477 of LNCS, pp. 519\u2013538, Singapore, Dec.\u00a05\u20139, 2010. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-17373-8_30"},{"key":"9220_CR37","doi-asserted-by":"crossref","unstructured":"M.\u00a0Naor and O.\u00a0Reingold, Number-theoretic constructions of efficient pseudo-random functions. In 38th FOCS, pp. 458\u2013467, Miami Beach, Florida, Oct.\u00a019\u201322, 1997. IEEE Computer Society Press","DOI":"10.1109\/SFCS.1997.646134"},{"key":"9220_CR38","doi-asserted-by":"crossref","unstructured":"M.\u00a0Naor and G.\u00a0Segev, Public-key cryptosystems resilient to key leakage. In S.\u00a0Halevi, editor, CRYPTO\u00a02009, vol. 5677 of LNCS, pp. 18\u201335, Santa Barbara, CA, USA, Aug.\u00a016\u201320, 2009. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-03356-8_2"},{"key":"9220_CR39","doi-asserted-by":"crossref","unstructured":"M.\u00a0Naor and M.\u00a0Yung, Public-key cryptosystems provably secure against chosen ciphertext attacks. In 22nd ACM STOC, pp. 427\u2013437, Baltimore, Maryland, USA, May\u00a014\u201316, 1990. ACM Press","DOI":"10.1145\/100216.100273"},{"key":"9220_CR40","doi-asserted-by":"crossref","unstructured":"T.\u00a0Okamoto and K.\u00a0Takashima, Fully secure functional encryption with general relations from the decisional linear assumption. In T.\u00a0Rabin, editor, CRYPTO\u00a02010, vol. 6223 of LNCS, pp. 191\u2013208, Santa Barbara, CA, USA, Aug.\u00a015\u201319, 2010. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-14623-7_11"},{"key":"9220_CR41","doi-asserted-by":"crossref","unstructured":"T.\u00a0Okamoto and K.\u00a0Takashima, Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption. In D.\u00a0Lin, G.\u00a0Tsudik, and X.\u00a0Wang, editors, CANS 11, vol. 7092 of LNCS, pp. 138\u2013159, Sanya, China, Dec.\u00a010\u201312, 2011. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-25513-7_11"},{"key":"9220_CR42","doi-asserted-by":"crossref","unstructured":"T.\u00a0Okamoto and K.\u00a0Takashima, Fully secure unbounded inner-product and attribute-based encryption. In X.\u00a0Wang and K.\u00a0Sako, editors, ASIACRYPT\u00a02012, vol. 7658 of LNCS, pp. 349\u2013366, Beijing, China, Dec.\u00a02\u20136, 2012. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-34961-4_22"},{"key":"9220_CR43","doi-asserted-by":"crossref","unstructured":"J.\u00a0H. Seo, On the (im)possibility of projecting property in prime-order setting. In X.\u00a0Wang and K.\u00a0Sako, editors, ASIACRYPT\u00a02012, vol. 7658 of LNCS, pp. 61\u201379, Beijing, China, Dec.\u00a02\u20136, 2012. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-34961-4_6"},{"key":"9220_CR44","doi-asserted-by":"crossref","unstructured":"J.\u00a0H. Seo and J.\u00a0H, Cheon, Beyond the limitation of prime-order bilinear groups, and round optimal blind signatures. In R.\u00a0Cramer, editor, TCC\u00a02012, vol. 7194 of LNCS, pp. 133\u2013150, Taormina, Sicily, Italy, March\u00a019\u201321, 2012. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-28914-9_8"},{"key":"9220_CR45","unstructured":"H.\u00a0Shacham, A cramer-shoup encryption scheme from the linear assumption and from progressively weaker linear variants. Cryptology ePrint Archive, Report 2007\/074, 2007. http:\/\/eprint.iacr.org\/"},{"key":"9220_CR46","doi-asserted-by":"crossref","unstructured":"J.\u00a0L. Villar, Optimal reductions of some decisional problems to the rank problem. In X.\u00a0Wang and K.\u00a0Sako, editors, ASIACRYPT\u00a02012, vol. 7658 of LNCS, pp. 80\u201397, Beijing, China, Dec.\u00a02\u20136, 2012. Springer, Berlin, Germany","DOI":"10.1007\/978-3-642-34961-4_7"},{"key":"9220_CR47","unstructured":"S.\u00a0Wolf, Information-Theoretically and Computionally Secure Key Agreement in Cryptography. Ph.D. thesis, ETH Zuerich, 1999"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9220-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-015-9220-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9220-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9220-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T03:16:31Z","timestamp":1748661391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-015-9220-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,22]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9220"],"URL":"https:\/\/doi.org\/10.1007\/s00145-015-9220-6","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,22]]},"assertion":[{"value":"5 August 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2015","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}