{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:05:11Z","timestamp":1765112711790,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281146"},{"type":"electronic","value":"9783540318705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11535218_27","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T18:20:34Z","timestamp":1292869234000},"page":"449-466","source":"Crossref","is-referenced-by-count":72,"title":["On the Generic Insecurity of the Full Domain Hash"],"prefix":"10.1007","author":[{"given":"Yevgeniy","family":"Dodis","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Oliveira","sequence":"additional","affiliation":[]},{"given":"Krzysztof","family":"Pietrzak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"PKCS #1 v2.1, RSA Cryptography Standard (draft), document available at http:\/\/www.rsa.security.com\/rsalabs\/pkcs"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-24676-3_11","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M. Bellare","year":"2004","unstructured":"Bellare, M., Boldyreva, A., Palacio, A.: An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 171\u2013188. Springer, Heidelberg (2004)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In: ACM CCS 1993, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00145-002-0120-1","volume":"16","author":"M. Bellare","year":"2003","unstructured":"Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The One-More-RSA-Inversion Problems and the Security of Chaum\u2019s Blind Signature Scheme. J. of Cryptology\u00a016(3), 185\u2013215 (2003)","journal-title":"J. of Cryptology"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1007\/11535218_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"A. Boldyreva","year":"2005","unstructured":"Boldyreva, A., Fischlin, M.: Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 412\u2013429. Springer, Heidelberg (2005)"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively Secure Multi-Party Computation. In: STOC 1996, pp. 22\u201324 (1996)","DOI":"10.1145\/237814.238015"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The Random Oracle Methodology, Revisited. In: STOC 1998, pp. 209\u2013218 (1998)","DOI":"10.1145\/276698.276741"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-24638-1_3","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: On the Random Oracle Methodology as Applied to Length-Restricted Signature Schemes. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 40\u201357. Springer, Heidelberg (2004)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R., Micciancio, D., Reingold, O.: Perfectly One-Way Probabilistic Hash Functions. In: STOC 1998, pp. 131\u2013140 (1998)","DOI":"10.1145\/276698.276721"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-44598-6_14","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"J.-S. Coron","year":"2000","unstructured":"Coron, J.-S.: On the Exact Security of Full Domain Hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 229\u2013235. Springer, Heidelberg (2000)"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-46035-7_18","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"J.-S. Coron","year":"2002","unstructured":"Coron, J.-S.: Optimal Security Proofs for PSS and other Signature Schemes. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 272\u2013287. Springer, Heidelberg (2002)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-39118-5_19","volume-title":"Advances in Cryptology - EUROCRYPT \u201987","author":"I.B. Damg\u00e5rd","year":"1988","unstructured":"Damg\u00e5rd, I.B.: Collision-Free Hash Functions and Public-Key Signature Schemes. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol.\u00a0304, pp. 203\u2013216. Springer, Heidelberg (1988)"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022, 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-36413-7_5","volume-title":"Security in Communication Networks","author":"Y. Dodis","year":"2003","unstructured":"Dodis, Y., Reyzin, L.: On the Power of Claw-Free Permutations. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol.\u00a02576, pp. 55\u201373. Springer, Heidelberg (2003)"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gertner, Y., Katz, J.: Lower Bounds on the Efficiency of Encryption and Digital Signature Schemes. In: STOC 2003, pp. 417\u2013425 (2003)","DOI":"10.1145\/780542.780604"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Trevisan, L.: Lower Bounds on the Efficiency of Generic Cryptographic Constructions. In: FOCS 2000, pp. 305\u2013313 (2000)","DOI":"10.1109\/SFCS.2000.892119"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Malkin, T., Reingold, O.: On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates. In: FOCS 2001, pp. 126\u2013135 (2001)","DOI":"10.1109\/SFCS.2001.959887"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The Relationship Between Public-Key Encryption and Oblivious Transfer. In: FOCS 2000, pp. 325\u2013335 (2000)","DOI":"10.1109\/SFCS.2000.892121"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Tauman, Y.: On the (In)security of the Fiat-Shamir Paradigm. In: FOCS 2003, pp. 102\u2013114 (2003)","DOI":"10.1109\/SFCS.2003.1238185"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/978-3-540-28628-8_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"C.-Y. Hsiao","year":"2004","unstructured":"Hsiao, C.-Y., Reyzin, L.: Finding Collisions on a Public Road, or do Secure Hash Functions Need Secret Coins? In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 92\u2013105. Springer, Heidelberg (2004)"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the Provable Consequences of One-Way Permutations. In: STOC 1989, pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"key":"27_CR23","unstructured":"Kim, J.H., Simon, D.R., Tetali, P.: Limits on the Efficiency of One-Way Permutation-Based Hash Functions. In: FOCS 1999, pp. 535\u2013542 (1999)"},{"key":"27_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-24676-3_2","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"B. Lynn","year":"2004","unstructured":"Lynn, B., Prabhakaran, M., Sahai, A.: Positive Results and Techniques for Obfuscation. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 20\u201339. Springer, Heidelberg (2004)"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M., Vadhan, S.: Verifiable Random Functions. In: FOCS 1999, pp. 120\u2013130 (1999)","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"27_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45708-9_8","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J.B. Nielsen","year":"2002","unstructured":"Nielsen, J.B.: Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-Committing Encryption Case. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 111\u2013126. Springer, Heidelberg (2002)"},{"key":"27_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D. Simon","year":"1998","unstructured":"Simon, D.: Finding Collisions on a One-Way Street: Can Secure Hash Functions be Based on General Assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 334\u2013345. Springer, Heidelberg (1998)"},{"key":"27_CR28","doi-asserted-by":"crossref","unstructured":"Wee, H.: On Obfuscating Point Functions. In: STOC 2005, pp. 523\u2013532 (2005)","DOI":"10.1145\/1060590.1060669"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11535218_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T23:59:44Z","timestamp":1740787184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11535218_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281146","9783540318705"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11535218_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}