Random oracles and auxiliary input

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4622 LNCS, Issue , 2007, Pages 205-223

  Unruh, Dominique ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

Auxiliary input; Foundations; Proof techniques; Random oracles

Indexed keywords

INFORMATION ANALYSIS; MATHEMATICAL MODELS; RANDOM VARIABLES;

AUXILIARY INPUT; RANDOM ORACLES;

CRYPTOGRAPHY;

EID: 38049165160     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74143-5_12     Document Type: Conference Paper

References (19)

1. Bellare, M.: A note on negligible functions. Journal of Cryptology 15(4), 271-284 (2002)
2. Bellare, M., Rogaway, P.: Optimal asymmetric encryption-how to encrypt with RSA. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 92-111. Springer, Heidelberg (1995)
3. Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Proceedings of CCS 1993, pp. 62-73 (1993)
4. Cachin, C., Crépeau, C., Marcil, J.: Oblivious transfer with a memory-bounded receiver. In: Proceedings of STOC 2002, pp. 493-502.
5. Cachin, C., Maurer, U.: Unconditional security against memory-bounded adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 292-306. Springer, Heidelberg (1997)
6. Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. In: Proceedings of STOC 1998, pp. 209-218 (1998)
7. Dziembowski, S., Maurer, U.: Tight security proofs for the bounded-storage model. In: Proceedings of STOC 2002, pp. 341-350 (2002)
8. Federal Information Processing Standards Publications. FIBS PUB 180-2: Secure Hash Standard (SHS) (August 2002)
9. Fujisaki, E., Okamoto, T., Pointcheval, D., Stern, J.: RSA-OAEP is secure under the RSA assumption. Journal of Cryptology 17(2), 81-104 (2004)
10. Gennaro, R., Gertner, Y., Katz, J., Trevisan, L.: Bounds on the efficiency of generic cryptographic constructions. SIAM J Computing 35(1), 217-246 (2005)
11. Goldreich, O.: A uniform-complexity treatment of encryption and zero-knowledge. Journal of Cryptology 6(1), 21-53 (1993)
12. Impagliazzo, R.: Very strong one-way functions and pseudo-random generators exist relative to a random oracle. Manuscript (1996)
13. Kullback, S.: A lower bound for discrimination information in terms of variation (corresp.). IEEE Transactions on Information Theory 13(1), 126-127 (1967)
14. Maurer, U.: Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology 5(1), 53-66 (1992)
15. Pass, R.: On deniability in the common reference string and random oracle model. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 316-337. Springer, Heidelberg (2003)
16. Rogaway, P.: Formalizing human ignorance: Collision-resistant hashing without the keys. In: Nguyen, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol. 4341, pp. 221-228. Springer, Heidelberg (2006)
17. RSA Laboratories. PKCS #1: RSA Cryptography Standard, Version 2.1, 2002.
18. Unruh, D.: Random oracles and auxiliary input. IACR ePrint, 2007/168. Full version of this paper
19. Wee, H.: Zero knowledge in the random oracle model, revisited. Manuscript (2006)