{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:49:00Z","timestamp":1764841740666},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,11,23]],"date-time":"2013-11-23T00:00:00Z","timestamp":1385164800000},"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":[[2015,4]]},"DOI":"10.1007\/s00145-013-9169-2","type":"journal-article","created":{"date-parts":[[2013,11,22]],"date-time":"2013-11-22T20:30:11Z","timestamp":1385152211000},"page":"297-311","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["From Non-adaptive to Adaptive Pseudorandom Functions"],"prefix":"10.1007","volume":"28","author":[{"given":"Itay","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iftach","family":"Haitner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,23]]},"reference":[{"key":"9169_CR1","doi-asserted-by":"publisher","unstructured":"M. Bellare, A note on negligible functions. J. Cryptol., 271\u2013284 (2002). doi:\n                    10.1007\/s00145-002-0116-x","DOI":"10.1007\/s00145-002-0116-x"},{"key":"9169_CR2","first-page":"357","volume-title":"Theory of Cryptography, 9th Theory of Cryptography Conference, TCC 2012","author":"I. Berman","year":"2012","unstructured":"I. Berman, I. Haitner, From non-adaptive to adaptive pseudorandom functions, in Theory of Cryptography, 9th Theory of Cryptography Conference, TCC 2012 (2012), pp.\u00a0357\u2013368"},{"key":"9169_CR3","first-page":"40","volume-title":"Theory of Cryptography, 10th Theory of Cryptography Conference, TCC 2013","author":"I. Berman","year":"2013","unstructured":"I. Berman, I. Haitner, I. Komargodski, M. Naor, Hardness preserving reductions via cuckoo hashing, in Theory of Cryptography, 10th Theory of Cryptography Conference, TCC 2013 (2013), pp.\u00a040\u201359"},{"key":"9169_CR4","doi-asserted-by":"publisher","unstructured":"L.J. Carter, M.N. Wegman, Universal classes of hash functions. J. Comput. Syst. Sci., 143\u2013154 (1979). doi:\n                    10.1145\/800105.803400","DOI":"10.1145\/800105.803400"},{"key":"9169_CR5","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-642-14623-7_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C. Cho","year":"2010","unstructured":"C. Cho, C.-K. Lee, R. Ostrovsky, Equivalence of uniform key agreement and composition insecurity, in Advances in Cryptology \u2013 CRYPTO 2010 (2010), pp.\u00a0447\u2013464"},{"key":"9169_CR6","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/3-540-45708-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"I. Damg\u00e5rd, J.B. Nielsen, Expanding pseudorandom functions; or: from known-plaintext security to chosen-plaintext security, in Advances in Cryptology \u2013 CRYPTO 2002 (2002), pp.\u00a0449\u2013464"},{"key":"9169_CR7","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-29011-4_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"Y. Dodis","year":"2012","unstructured":"Y. Dodis, E. Kiltz, K. Pietrzak, D. Wichs, Message authentication, revisited, in Advances in Cryptology \u2013 EUROCRYPT 2012 (2012), pp.\u00a0355\u2013374"},{"key":"9169_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"O. Goldreich, Foundations of Cryptography: Basic Tools (Cambridge University Press, Cambridge, 2001)"},{"key":"9169_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography \u2013 VOLUME 2: Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"O. Goldreich, Foundations of Cryptography \u2013 VOLUME 2: Basic Applications (Cambridge University Press, Cambridge, 2004)"},{"key":"9169_CR10","first-page":"276","volume-title":"Advances in Cryptology \u2013 CRYPTO \u201984","author":"O. Goldreich","year":"1984","unstructured":"O. Goldreich, S. Goldwasser, S. Micali, On the cryptographic applications of random functions, in Advances in Cryptology \u2013 CRYPTO \u201984 (1984), pp.\u00a0276\u2013288"},{"key":"9169_CR11","doi-asserted-by":"publisher","unstructured":"O. Goldreich, S. Goldwasser, S. Micali, How to construct random functions. J. ACM, 792\u2013807 (1986). doi:\n                    10.1445\/6490.6503","DOI":"10.1445\/6490.6503"},{"key":"9169_CR12","doi-asserted-by":"publisher","unstructured":"J. H\u00e5stad, R. Impagliazzo, L.A. Levin, M. Luby, A pseudorandom generator from any one-way function. SIAM J. Comput., 1364\u20131396 (1999). doi:\n                    10.1137\/s0097539793244708","DOI":"10.1137\/s0097539793244708"},{"key":"9169_CR13","series-title":"Princeton Computer Science Notes","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1515\/9780691206844","volume-title":"Pseudorandomness and Cryptographic Applications","author":"M. Luby","year":"1996","unstructured":"M. Luby, Pseudorandomness and Cryptographic Applications. Princeton Computer Science Notes. (Princeton University Press, Princeton, 1996). ISBN 978-0-691-02546-9","ISBN":"http:\/\/id.crossref.org\/isbn\/9780691025469"},{"key":"9169_CR14","first-page":"92","volume":"2013","author":"V. Lyubashevsky","year":"2013","unstructured":"V. Lyubashevsky, D. Masny, Man-in-the-middle secure authentication schemes from LPN and weak PRFS. IACR Cryptol. ePrint Arch.\n                  2013, 92 (2013)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9169_CR15","first-page":"410","volume-title":"Theory of Cryptography, First Theory of Cryptography Conference, TCC 2004","author":"U.M. Maurer","year":"2004","unstructured":"U.M. Maurer, K. Pietrzak, Composition of random systems: when two weak make one strong, in Theory of Cryptography, First Theory of Cryptography Conference, TCC 2004 (2004), pp.\u00a0410\u2013427"},{"key":"9169_CR16","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-540-72540-4_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2007","author":"U.M. Maurer","year":"2007","unstructured":"U.M. Maurer, J. Sj\u00f6din, A fast and key-efficient reduction of chosen-ciphertext to known-plaintext security, in Advances in Cryptology \u2013 EUROCRYPT 2007 (2007), pp.\u00a0498\u2013516"},{"key":"9169_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-89255-7_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2008","author":"U.M. Maurer","year":"2008","unstructured":"U.M. Maurer, S. Tessaro, Basing PRFS on constant-query weak PRFS: minimizing assumptions for efficient symmetric cryptography, in Advances in Cryptology \u2013 ASIACRYPT 2008 (2008), pp.\u00a0161\u2013178"},{"key":"9169_CR18","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-24676-3_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2004","author":"S. Myers","year":"2004","unstructured":"S. Myers, Black-box composition does not imply adaptive security, in Advances in Cryptology \u2013 EUROCRYPT 2004 (2004), pp.\u00a0189\u2013206"},{"key":"9169_CR19","doi-asserted-by":"publisher","unstructured":"M. Naor, O. Reingold, Synthesizers and their application to the parallel construction of pseudo-random functions. J. Comput. Syst. Sci., 336\u2013375 (1999). doi:\n                    10.1006\/jcss.1998.1618","DOI":"10.1006\/jcss.1998.1618"},{"key":"9169_CR20","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/11535218_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"K. Pietrzak","year":"2005","unstructured":"K. Pietrzak, Composition does not imply adaptive security, in Advances in Cryptology \u2013 CRYPTO 2005 (2005), pp.\u00a055\u201365"},{"key":"9169_CR21","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/11761679_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2006","author":"K. Pietrzak","year":"2006","unstructured":"K. Pietrzak, Composition implies adaptive security in minicrypt, in Advances in Cryptology \u2013 EUROCRYPT 2006 (2006), pp.\u00a0328\u2013338"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9169-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-013-9169-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9169-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9169-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:13:48Z","timestamp":1586333628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-013-9169-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,23]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9169"],"URL":"https:\/\/doi.org\/10.1007\/s00145-013-9169-2","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,23]]},"assertion":[{"value":"23 October 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2013","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"}]}}