{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T12:59:59Z","timestamp":1767963599233,"version":"3.49.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,3,22]],"date-time":"2018-03-22T00:00:00Z","timestamp":1521676800000},"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":[[2019,7]]},"DOI":"10.1007\/s00145-018-9289-9","type":"journal-article","created":{"date-parts":[[2018,3,22]],"date-time":"2018-03-22T16:10:17Z","timestamp":1521735017000},"page":"825-866","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The Magic of ELFs"],"prefix":"10.1007","volume":"32","author":[{"given":"Mark","family":"Zhandry","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,22]]},"reference":[{"key":"9289_CR1","unstructured":"P. Ananth, D. Boneh, S. Garg, A. Sahai, M. Zhandry, Differing-inputs obfuscation and applications. Cryptology ePrint Archive, Report 2013\/689, 2013. http:\/\/eprint.iacr.org\/2013\/689"},{"key":"9289_CR2","doi-asserted-by":"crossref","unstructured":"A. Akavia, S. Goldwasser, V. Vaikuntanathan, Simultaneous hardcore bits and cryptography against memory attacks, in O. Reingold, editor, TCC\u00a02009: 6th Theory of Cryptography Conference, volume 5444 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, March\u00a015\u201317, 2009), pp. 474\u2013495","DOI":"10.1007\/978-3-642-00457-5_28"},{"key":"9289_CR3","unstructured":"D. Apon, Y. Huang, J. Katz, A.J. Malozemoff, Implementing cryptographic program obfuscation. Cryptology ePrint Archive, Report 2014\/779, 2014. http:\/\/eprint.iacr.org\/2014\/779"},{"key":"9289_CR4","unstructured":"E. Boyle, K.-M. Chung, R. Pass. On extractability obfuscation, in Y. Lindell, editor, TCC\u00a02014: 11th Theory of Cryptography Conference, volume 8349 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, San Diego, CA, USA, February\u00a024\u201326, 2014), pp. 52\u201373"},{"key":"9289_CR5","doi-asserted-by":"crossref","unstructured":"N. Bitansky, R. Canetti, O. Paneth, A. Rosen, On the existence of extractable one-way functions, in D.B. Shmoys, editor, 46th Annual ACM Symposium on Theory of Computing (ACM Press, New York, NY, USA, May\u00a031\u2013June\u00a03, 2014), pp. 505\u2013514","DOI":"10.1145\/2591796.2591859"},{"key":"9289_CR6","doi-asserted-by":"crossref","unstructured":"C. Brzuska, P. Farshim, A. Mittelbach, Indistinguishability obfuscation and UCEs: the case of computationally unpredictable sources, in J.A. Garay, R. Gennaro, editors, Advances in Cryptology\u2014CRYPTO\u00a02014, Part I, volume 8616 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, August\u00a017\u201321, 2014), pp. 188\u2013205","DOI":"10.1007\/978-3-662-44371-2_11"},{"key":"9289_CR7","doi-asserted-by":"crossref","unstructured":"I. Berman, I. Haitner, From non-adaptive to adaptive pseudorandom functions, in R. Cramer, editor, TCC\u00a02012: 9th Theory of Cryptography Conference, volume 7194 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Taormina, Sicily, Italy, March\u00a019\u201321, 2012), pp. 357\u2013368","DOI":"10.1007\/978-3-642-28914-9_20"},{"key":"9289_CR8","doi-asserted-by":"crossref","unstructured":"F. B\u00f6hl, D. Hofheinz, T. Jager, J. Koch, J.H. Seo, C. Striecks, Practical signatures from standard assumptions, in T. Johansson, P.Q. Nguyen, editors, Advances in Cryptology\u2014EUROCRYPT\u00a02013, volume 7881 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Athens, Greece, May\u00a026\u201330, 2013), pp. 461\u2013485","DOI":"10.1007\/978-3-642-38348-9_28"},{"key":"9289_CR9","doi-asserted-by":"crossref","unstructured":"M. Bellare, V.T. Hoang, S. Keelveedhi, Instantiating random oracles via UCEs, in R. Canetti, J.A. Garay, editors, Advances in Cryptology\u2014CRYPTO\u00a02013, Part II, volume 8043 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, August\u00a018\u201322, 2013), pp. 398\u2013415","DOI":"10.1007\/978-3-642-40084-1_23"},{"key":"9289_CR10","doi-asserted-by":"crossref","unstructured":"N. Bitansky, O. Paneth, Point obfuscation and 3-round zero-knowledge, in R. Cramer, editor, TCC\u00a02012: 9th Theory of Cryptography Conference, volume 7194 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Taormina, Sicily, Italy, March\u00a019\u201321, 2012), pp. 190\u2013208","DOI":"10.1007\/978-3-642-28914-9_11"},{"key":"9289_CR11","unstructured":"M. Bellare, P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, in V.\u00a0Ashby, editor, ACM CCS 93: 1st Conference on Computer and Communications Security (ACM Press, Fairfax, Virginia, USA, November\u00a03\u20135, 1993), pp. 62\u201373"},{"key":"9289_CR12","doi-asserted-by":"crossref","unstructured":"M. Bellare, I. Stepanovs, S. Tessaro, Poly-many hardcore bits for any one-way function and a framework for differing-inputs obfuscation, in P. Sarkar, T. Iwata, editors, Advances in Cryptology\u2014ASIACRYPT\u00a02014, Part II, volume 8874 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Kaoshiung, Taiwan, R.O.C., December\u00a07\u201311, 2014), pp. 102\u2013121","DOI":"10.1007\/978-3-662-45608-8_6"},{"key":"9289_CR13","unstructured":"M. Bellare, I. Stepanovs, S. Tessaro, Contention in cryptoland: obfuscation, leakage and UCE, in E. Kushilevitz, T. Malkin, editors, TCC\u00a02016-A: 13th Theory of Cryptography Conference, Part II, volume 9563 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Tel Aviv, Israel, January\u00a010\u201313, 2016), pp. 542\u2013564"},{"key":"9289_CR14","doi-asserted-by":"crossref","unstructured":"D. Boneh, M. Zhandry, Secure signatures and chosen ciphertext security in a quantum computing world, in R. Canetti, J.A. Garay, editors, Advances in Cryptology\u2014CRYPTO\u00a02013, Part II, volume 8043 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, August\u00a018\u201322, 2013), pp. 361\u2013379","DOI":"10.1007\/978-3-642-40084-1_21"},{"key":"9289_CR15","doi-asserted-by":"crossref","unstructured":"R. Canetti, Towards realizing random oracles: hash functions that hide all partial information, in B.S. Kaliski Jr., editor, Advances in Cryptology\u2014CRYPTO\u201997, volume 1294 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, August\u00a017\u201321, 1997), pp. 455\u2013469","DOI":"10.1007\/BFb0052255"},{"key":"9289_CR16","doi-asserted-by":"crossref","unstructured":"R. Canetti, Y. Chen, L. Reyzin, On the correlation intractability of obfuscated pseudorandom functions, in E. Kushilevitz, T. Malkin, editors, TCC\u00a02016-A: 13th Theory of Cryptography Conference, Part I, volume 9562 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Tel Aviv, Israel, January\u00a010\u201313, 2016), pp. 389\u2013415","DOI":"10.1007\/978-3-662-49096-9_17"},{"key":"9289_CR17","doi-asserted-by":"crossref","unstructured":"R. Canetti, O. Goldreich, S. Halevi. The random oracle methodology, revisited (preliminary version), in 30th Annual ACM Symposium on Theory of Computing (ACM Press, Dallas, Texas, USA, May\u00a023\u201326, 1998), pp. 209\u2013218","DOI":"10.1145\/276698.276741"},{"key":"9289_CR18","doi-asserted-by":"crossref","unstructured":"R. Canetti, D. Micciancio, O. Reingold, Perfectly one-way probabilistic hash functions (preliminary version), in 30th Annual ACM Symposium on Theory of Computing (ACM Press, Dallas, Texas, USA, May\u00a023\u201326, 1998), pp. 131\u2013140","DOI":"10.1145\/276698.276721"},{"key":"9289_CR19","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, K. Pietrzak, Leakage-resilient cryptography, in 49th Annual Symposium on Foundations of Computer Science (IEEE Computer Society Press, Philadelphia, Pennsylvania, USA, October\u00a025\u201328, 2008), pp. 293\u2013302","DOI":"10.1109\/FOCS.2008.56"},{"key":"9289_CR20","doi-asserted-by":"crossref","unstructured":"Y. Dodis, A. Smith, Correcting errors without leaking partial information, in H.N. Gabow, R. Fagin, editors, 37th Annual ACM Symposium on Theory of Computing (ACM Press, Baltimore, Maryland, USA, May\u00a022\u201324, 2005), pp. 654\u2013663","DOI":"10.1145\/1060590.1060688"},{"key":"9289_CR21","doi-asserted-by":"crossref","unstructured":"N. D\u00f6ttling, D. Schr\u00f6der, Efficient pseudorandom functions via on-the-fly adaptation, in R. Gennaro, M.J.B. Robshaw, editors, Advances in Cryptology\u2014CRYPTO\u00a02015, Part I, volume 9215 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, August\u00a016\u201320, 2015), pp. 329\u2013350","DOI":"10.1007\/978-3-662-47989-6_16"},{"key":"9289_CR22","doi-asserted-by":"crossref","unstructured":"D.M. Freeman, O. Goldreich, E. Kiltz, A. Rosen, G. Segev, More constructions of lossy and correlation-secure trapdoor functions, in P.Q. Nguyen, D. Pointcheval, editors, PKC\u00a02010: 13th International Conference on Theory and Practice of Public Key Cryptography, volume 6056 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Paris, France, May\u00a026\u201328, 2010), pp. 279\u2013295","DOI":"10.1007\/978-3-642-13013-7_17"},{"key":"9289_CR23","doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, B. Waters. Candidate indistinguishability obfuscation and functional encryption for all circuits, in 54th Annual Symposium on Foundations of Computer Science (IEEE Computer Society Press, Berkeley, CA, USA, October\u00a026\u201329, 2013), pp. 40\u201349","DOI":"10.1109\/FOCS.2013.13"},{"key":"9289_CR24","doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, S. Halevi, D. Wichs, On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input, in J.A. Garay, R. Gennaro, editors, Advances in Cryptology\u2014CRYPTO\u00a02014, Part I, volume 8616 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, August\u00a017\u201321, 2014), pp. 518\u2013535","DOI":"10.1007\/978-3-662-44371-2_29"},{"key":"9289_CR25","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 Annual ACM Symposium on Theory of Computing (ACM Press, Palo Alto, CA, USA, June\u00a01\u20134, 2013), pp. 467\u2013476","DOI":"10.1145\/2488608.2488667"},{"key":"9289_CR26","unstructured":"S. Goldwasser, Y.T. Kalai, Cryptographic assumptions: a position paper, in E. Kushilevitz, T. Malkin, editors, TCC\u00a02016-A: 13th Theory of Cryptography Conference, Part I, volume 9562 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Tel Aviv, Israel, January\u00a010\u201313, 2016), pp. 505\u2013522"},{"key":"9289_CR27","doi-asserted-by":"crossref","unstructured":"O. Goldreich, L.A. Levin, A hard-core predicate for all one-way functions, in 21st Annual ACM Symposium on Theory of Computing (ACM Press, Seattle, Washington, USA, May\u00a015\u201317, 1989), pp. 25\u201332","DOI":"10.1145\/73007.73010"},{"key":"9289_CR28","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, vol. 1 (Cambridge University Press, Cambridge, UK, 2001)"},{"key":"9289_CR29","doi-asserted-by":"crossref","unstructured":"C. Gentry, D. Wichs, Separating succinct non-interactive arguments from all falsifiable assumptions, in L. Fortnow, S.P. Vadhan, editors, 43rd Annual ACM Symposium on Theory of Computing (ACM Press, San Jose, California, USA, June\u00a06\u20138, 2011), pp. 99\u2013108","DOI":"10.1145\/1993636.1993651"},{"key":"9289_CR30","unstructured":"D. Hofheinz, T. Jager, D. Khurana, A. Sahai, B. Waters, M. Zhandry, How to generate and use universal samplers. Cryptology ePrint Archive, Report 2014\/507, 2014. http:\/\/eprint.iacr.org\/2014\/507 ."},{"key":"9289_CR31","doi-asserted-by":"crossref","unstructured":"S. Hohenberger, A. Sahai, B. Waters, Replacing a random oracle: Full domain hash from indistinguishability obfuscation, in P.Q. Nguyen, E. Oswald, editors, Advances in Cryptology\u2014-EUROCRYPT\u00a02014, volume 8441 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Copenhagen, Denmark, May\u00a011\u201315, 2014), pp. 201\u2013220","DOI":"10.1007\/978-3-642-55220-5_12"},{"key":"9289_CR32","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L.A. Levin, M. Luby, Pseudo-random generation from one-way functions (extended abstracts), in 21st Annual ACM Symposium on Theory of Computing (ACM Press, Seattle, Washington, USA, May\u00a015\u201317, 1989), pp. 12\u201324","DOI":"10.1145\/73007.73009"},{"key":"9289_CR33","unstructured":"H. Krawczyk, T. Rabin, C. signatures, in ISOC Network and Distributed System Security Symposium\u2014NDSS\u00a02000 (The Internet Society, San Diego, California, USA, February\u00a02\u20134, 2000)"},{"key":"9289_CR34","doi-asserted-by":"crossref","unstructured":"M. Naor, On cryptographic assumptions and challenges (invited talk), in D. Boneh, editor, Advances in Cryptology\u2014CRYPTO\u00a02003, volume 2729 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, August\u00a017\u201321, 2003), pp. 96\u2013109","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"9289_CR35","doi-asserted-by":"crossref","unstructured":"M. Naor, G. Segev, Public-key cryptosystems resilient to key leakage, in S. Halevi, editor, Advances in Cryptology\u2014CRYPTO\u00a02009, volume 5677 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, August\u00a016\u201320, 2009), pp. 18\u201335","DOI":"10.1007\/978-3-642-03356-8_2"},{"key":"9289_CR36","doi-asserted-by":"crossref","unstructured":"K. Pietrzak, A. Rosen, G. Segev, Lossy functions do not amplify well, in R. Cramer, editor, TCC\u00a02012: 9th Theory of Cryptography Conference, volume 7194 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Taormina, Sicily, Italy, March\u00a019\u201321, 2012), pp. 458\u2013475","DOI":"10.1007\/978-3-642-28914-9_26"},{"key":"9289_CR37","doi-asserted-by":"crossref","unstructured":"S. Patel, G.S. Sundaram, An efficient discrete log pseudo random generator, in H. Krawczyk, editor, Advances in Cryptology\u2014CRYPTO\u201998, volume 1462 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Santa Barbara, CA, USA, August\u00a023\u201327, 1998), pp. 304\u2013317","DOI":"10.1007\/BFb0055737"},{"key":"9289_CR38","doi-asserted-by":"crossref","unstructured":"C. Peikert, B. Waters, Lossy trapdoor functions and their applications, in R.E. Ladner, C. Dwork, editors, 40th Annual ACM Symposium on Theory of Computing (ACM Press, Victoria, British Columbia, Canada, May\u00a017\u201320, 2008), pp. 187\u2013196","DOI":"10.1145\/1374376.1374406"},{"key":"9289_CR39","unstructured":"V. Rao, Adaptive multiparty non-interactive key exchange without setup in the standard model. Cryptology ePrint Archive, Report 2014\/910, 2014. http:\/\/eprint.iacr.org\/2014\/910"},{"key":"9289_CR40","doi-asserted-by":"crossref","unstructured":"A. Rosen, G. Segev, Chosen-ciphertext security via correlated products, in O. Reingold, editor, TCC\u00a02009: 6th Theory of Cryptography Conference, volume 5444 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, March\u00a015\u201317, 2009), pp. 419\u2013436","DOI":"10.1007\/978-3-642-00457-5_25"},{"key":"9289_CR41","doi-asserted-by":"crossref","unstructured":"D.R. Simon, Finding collisions on a one-way street: can secure hash functions be based on general assumptions? in K. Nyberg, editor, Advances in Cryptology\u2014-EUROCRYPT\u201998, volume 1403 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Espoo, Finland, May\u00a031\u00a0\u2013\u00a0June\u00a04, 1998), pp. 334\u2013345","DOI":"10.1007\/BFb0054137"},{"key":"9289_CR42","doi-asserted-by":"crossref","unstructured":"A.W. Schrift, A. Shamir, The discrete log is very discreet, in 22nd Annual ACM Symposium on Theory of Computing (ACM Press, Baltimore, Maryland, USA, May\u00a014\u201316, 1990), pp. 405\u2013415","DOI":"10.1145\/100216.100271"},{"key":"9289_CR43","doi-asserted-by":"crossref","unstructured":"A. Sahai, B. Waters, How to use indistinguishability obfuscation: deniable encryption, and more, in D.B. Shmoys, editor, 46th Annual ACM Symposium on Theory of Computing (ACM Press, New York, NY, USA, May\u00a031\u2013June\u00a03, 2014), pp. 475\u2013484","DOI":"10.1145\/2591796.2591825"},{"key":"9289_CR44","doi-asserted-by":"crossref","unstructured":"J.L. Villar, Optimal reductions of some decisional problems to the rank problem, in X. Wang, K. Sako, editors, Advances in Cryptology\u2014ASIACRYPT\u00a02012, volume 7658 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Beijing, China, December\u00a02\u20136, 2012), pp. 80\u201397","DOI":"10.1007\/978-3-642-34961-4_7"},{"key":"9289_CR45","doi-asserted-by":"crossref","unstructured":"H. Wee, On obfuscating point functions, in H.N. Gabow, R. Fagin, editors, 37th Annual ACM Symposium on Theory of Computing (ACM Press, Baltimore, Maryland, USA, May\u00a022\u201324, 2005), pp. 523\u2013532","DOI":"10.1145\/1060590.1060669"},{"key":"9289_CR46","doi-asserted-by":"crossref","unstructured":"A. Young, M. Yung, Kleptography: using cryptography against cryptography, in W. Fumy, editor, Advances in Cryptology\u2014EUROCRYPT\u201997, volume 1233 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Konstanz, Germany, May\u00a011\u201315, 1997), pp. 62\u201374","DOI":"10.1007\/3-540-69053-0_6"},{"key":"9289_CR47","doi-asserted-by":"crossref","unstructured":"M. Zhandry, How to construct quantum random functions, in 53rd Annual Symposium on Foundations of Computer Science (IEEE Computer Society Press, New Brunswick, NJ, USA, October\u00a020\u201323, 2012), pp. 679\u2013687","DOI":"10.1109\/FOCS.2012.37"},{"key":"9289_CR48","doi-asserted-by":"crossref","unstructured":"M. Zhandry, How to avoid obfuscation using witness PRFs, in E. Kushilevitz, T. Malkin, editors, TCC\u00a02016-A: 13th Theory of Cryptography Conference, Part II, volume 9563 of Lecture Notes in Computer Science (Springer, Heidelberg, Germany, Tel Aviv, Israel, January\u00a010\u201313, 2016), pp. 421\u2013448","DOI":"10.1007\/978-3-662-49099-0_16"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-018-9289-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-018-9289-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-018-9289-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T18:56:26Z","timestamp":1693594586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-018-9289-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,22]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["9289"],"URL":"https:\/\/doi.org\/10.1007\/s00145-018-9289-9","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,22]]},"assertion":[{"value":"6 December 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2018","order":3,"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"}]}}