{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T22:06:55Z","timestamp":1794348415439,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540741428","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74143-5_12","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T09:51:33Z","timestamp":1186653093000},"page":"205-223","source":"Crossref","is-referenced-by-count":77,"title":["Random Oracles and Auxiliary Input"],"prefix":"10.1007","author":[{"given":"Dominique","family":"Unruh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00145-002-0116-x","volume":"15","author":"M. Bellare","year":"2002","unstructured":"Bellare, M.: A note on negligible functions. Journal of Cryptology\u00a015(4), 271\u2013284 (2002)","journal-title":"Journal of Cryptology"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption\u2014how to encrypt with RSA. In: Proceedings of EUROCRYPT 1994, pp. 92\u2013111 (1994)","DOI":"10.1007\/BFb0053428"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Proceedings of CCS 1993, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Cachin, C., Cr\u00e9peau, C., Marcil, J.: Oblivious transfer with a memory-bounded receiver. In: Proceedings of STOC 2002, pp. 493\u2013502 (2002)","DOI":"10.1109\/SFCS.1998.743500"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0052243","volume-title":"Advances in Cryptology - CRYPTO 1997","author":"C. Cachin","year":"1997","unstructured":"Cachin, C., Maurer, U.: Unconditional security against memory-bounded adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 292\u2013306. Springer, Heidelberg (1997)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. In: Proceedings of STOC 1998, pp. 209\u2013218 (1998)","DOI":"10.1145\/276698.276741"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Maurer, U.: Tight security proofs for the bounded-storage model. In: Proceedings of STOC 2002, pp. 341\u2013350 (2002)","DOI":"10.1145\/509907.509960"},{"key":"12_CR8","unstructured":"Federal Information Processing Standards Publications. FIBS PUB 180-2: Secure Hash Standard (SHS) (August 2002)"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00145-002-0204-y","volume":"17","author":"E. Fujisaki","year":"2004","unstructured":"Fujisaki, E., Okamoto, T., Pointcheval, D., Stern, J.: RSA-OAEP is secure under the RSA assumption. Journal of Cryptology\u00a017(2), 81\u2013104 (2004)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/S0097539704443276","volume":"35","author":"R. Gennaro","year":"2005","unstructured":"Gennaro, R., Gertner, Y., Katz, J., Trevisan, L.: Bounds on the efficiency of generic cryptographic constructions. SIAM J Computing\u00a035(1), 217\u2013246 (2005)","journal-title":"SIAM J Computing"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF02620230","volume":"6","author":"O. Goldreich","year":"1993","unstructured":"Goldreich, O.: A uniform-complexity treatment of encryption and zero-knowledge. Journal of Cryptology\u00a06(1), 21\u201353 (1993)","journal-title":"Journal of Cryptology"},{"key":"12_CR12","unstructured":"Impagliazzo, R.: Very strong one-way functions and pseudo-random generators exist relative to a random oracle. Manuscript (1996)"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1109\/TIT.1967.1053968","volume":"13","author":"S. Kullback","year":"1967","unstructured":"Kullback, S.: A lower bound for discrimination information in terms of variation (corresp.). IEEE Transactions on Information Theory\u00a013(1), 126\u2013127 (1967)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"U. Maurer","year":"1992","unstructured":"Maurer, U.: Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology\u00a05(1), 53\u201366 (1992)","journal-title":"Journal of Cryptology"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/978-3-540-45146-4_19","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R. Pass","year":"2003","unstructured":"Pass, R.: On deniability in the common reference string and random oracle model. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 316\u2013337. Springer, Heidelberg (2003)"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/11958239_14","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"P. Rogaway","year":"2006","unstructured":"Rogaway, P.: Formalizing human ignorance: Collision-resistant hashing without the keys. In: Nguyen, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol.\u00a04341, pp. 221\u2013228. Springer, Heidelberg (2006)"},{"key":"12_CR17","unstructured":"RSA Laboratories. PKCS\u00a0#1: RSA Cryptography Standard, Version\u00a02.1 (2002)"},{"key":"12_CR18","unstructured":"Unruh, D.: Random oracles and auxiliary input. IACR ePrint, 2007\/168. Full version of this paper"},{"key":"12_CR19","unstructured":"Wee, H.: Zero knowledge in the random oracle model, revisited. Manuscript (2006)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74143-5_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T01:40:35Z","timestamp":1737337235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74143-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540741428"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74143-5_12","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-74143-5","asserted-by":"object"}]},"subject":[]}}