{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T17:34:54Z","timestamp":1784136894995,"version":"3.55.0"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2004,7,1]],"date-time":"2004-07-01T00:00:00Z","timestamp":1088640000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2004,7]]},"abstract":"<jats:p>\n            We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called \"cryptographic hash functions\".The main result of this article is a negative one: There exist signature and encryption schemes that are secure in the Random Oracle Model, but for which\n            <jats:italic>any implementation<\/jats:italic>\n            of the random oracle results in insecure schemes. In the process of devising the above schemes, we consider possible definitions for the notion of a \"good implementation\" of a random oracle, pointing out limitations and challenges.\n          <\/jats:p>","DOI":"10.1145\/1008731.1008734","type":"journal-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T16:39:33Z","timestamp":1090341573000},"page":"557-594","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":643,"title":["The random oracle methodology, revisited"],"prefix":"10.1145","volume":"51","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[{"name":"IBM T. J. Watson Research Center, Hawthorne, New York"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oded","family":"Goldreich","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research Center, Hawthorne, New York"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2004,7]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 42nd Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 106--115","author":"Barak B.","year":"2001"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 43rd Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 345--355","author":"Barak B.","year":"2002"},{"key":"e_1_2_1_3_1","volume-title":"Advances in Cryptology---CRYPTO '01","volume":"2139","author":"Barak B."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 1st Conference on Computer and Communications Security. ACM","author":"Bellare M."},{"key":"e_1_2_1_5_1","volume-title":"Lecture Notes in Computer Science","volume":"1070","author":"Bellare M."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213053"},{"key":"e_1_2_1_7_1","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology---CRYPTO'97","author":"Canetti R."},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 28th Annual Symposium on Theory of Computing. ACM","author":"Canetti R.","year":"1996"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 30th Annual ACM Symposium on the Theory of Computing. ACM","author":"Canetti R.","year":"1998"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 30th Annual ACM Symposium on the Theory of Computing. ACM","author":"Canetti R."},{"key":"e_1_2_1_11_1","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology---EUROCRYPT'87","author":"Damg\u00e5rd I. B."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/950620.950623"},{"key":"e_1_2_1_13_1","volume-title":"Lecture Notes in Computer Science","volume":"263","author":"Fiat A."},{"key":"e_1_2_1_14_1","volume-title":"Lecture Notes in Computer Science","volume":"1592","author":"Gennaro R."},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02620230","article-title":"A uniform complexity treatment of encryption and zero-knowledge","volume":"6","author":"Goldreich O.","year":"1993","journal-title":"J. Crypt."},{"key":"e_1_2_1_16_1","unstructured":"Goldreich O. 1999. Encryption schemes---Fragments of a chapter. Available from http:\/\/www.wisdom.weizmann.ac.il\/&sim;oded\/foc-vol2.html.]]  Goldreich O. 1999. Encryption schemes---Fragments of a chapter. Available from http:\/\/www.wisdom.weizmann.ac.il\/&sim;oded\/foc-vol2.html.]]"},{"key":"e_1_2_1_17_1","unstructured":"Goldreich O. 2002. The GGM construction does NOT yield correlation intractable function ensembles. ECCC TR02-047 http:\/\/www.eccc.uni-trier.de\/eccc\/.]]  Goldreich O. 2002. The GGM construction does NOT yield correlation intractable function ensembles. ECCC TR02-047 http:\/\/www.eccc.uni-trier.de\/eccc\/.]]"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791220688"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(84)90070-9","article-title":"Probabilistic encryption","volume":"28","author":"Goldwasser S.","year":"1984","journal-title":"J. Comput. Syst. Sci."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217017"},{"key":"e_1_2_1_22_1","volume-title":"Lecture Notes in Computer Science","volume":"330","author":"Guillou L."},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 2nd International Workshop on Practice and Theory in Public Key Cryptography (PKC'99)","volume":"1560","author":"Hada S."},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing. ACM","author":"Impagliazzo R."},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the 24th Annual ACM Symposium on the Theory of Computing. ACM","author":"Kilian J.","year":"1992"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_2_1_27_1","unstructured":"Naor M. and Nissim K. 1999. Computationally sound proofs: Reducing the number of random oracle calls. Manuscript.]]  Naor M. and Nissim K. 1999. Computationally sound proofs: Reducing the number of random oracle calls. Manuscript.]]"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing. ACM","author":"Naor M."},{"key":"e_1_2_1_29_1","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology---CRYPTO'02","author":"Nielsen J."},{"key":"e_1_2_1_30_1","unstructured":"Nissim K. 1999. Two results regarding correlation intractability. Manuscript.]]  Nissim K. 1999. Two results regarding correlation intractability. Manuscript.]]"},{"key":"e_1_2_1_31_1","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology---CRYPTO'92","author":"Okamoto T."},{"key":"e_1_2_1_32_1","volume-title":"Lecture Notes in Computer Science","volume":"1070","author":"Pointcheval D."},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. ACM","author":"Rompel J.","year":"1990"},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00196725","article-title":"Efficient signature generation by smart cards","volume":"4","author":"Schnorr C.","year":"1991","journal-title":"J. Cryptology"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 23rd Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 80--91","author":"Yao A.","year":"1982"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008731.1008734","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1008731.1008734","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:41:08Z","timestamp":1750282868000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008731.1008734"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,7]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,7]]}},"alternative-id":["10.1145\/1008731.1008734"],"URL":"https:\/\/doi.org\/10.1145\/1008731.1008734","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,7]]},"assertion":[{"value":"2004-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}