On the security of OAEP

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

Volumn 4284 LNCS, Issue , 2006, Pages 210-225

  Boldyreva, Alexandra ^a   Fischlin, Marc ^b  

^a Georgia Institute of Technology   (United States)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHOSEN-PLAINTEXT ATTACK; CRYPTOGRAPHIC PRIMITIVES; ENCRYPTION SCHEMES; NON-MALLEABILITY; NON-TRIVIAL; PROVABLY SECURE; RANDOM ORACLE; RANDOM ORACLE MODEL; SSL/TLS; SUFFICIENT CONDITIONS; THE STANDARD MODEL;

CRYPTOGRAPHY;

NETWORK SECURITY;

EID: 55749085358     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11935230_14     Document Type: Conference Paper

References (22)

1. M. Bellare, A. Boldyreva and A. Palacio. An uninstantiable random-oracle-model scheme for a hybrid-encryption problem. In Eurocrypt 2004, Volume 3027 of LNCS, pp. 171-188. Springer-Verlag, 2004.
2. D. R. L. Brown. Unprovable Security of RSA-OAEP in the Standard Model. Cryptology ePrint Archive, Report 2006/223, 2006.
3. M. Bellare, A. Desai, D. Pointcheval and P. Rogaway. Relations Among Notions of Security for Public-Key Encryption Schemes. In CRYPTO '98, Volume 1462 of LNCS, pp. 26-45. Springer-Verlag, 1998.
4. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In CCS '93, pp. 62-73. ACM, 1993.
5. M. Bellare and P. Rogaway. Optimal asymmetric encryption - how to encrypt with RSA. In Eurocrypt '94, Volume 950 of of LNCS, pp. 92-111. Springer-Verlag, 1995.
6. E. Biham and R. Chen. Near-Collisions of SHA-0. In CRYPTO' 2004, Volume 3152 of LNCS, pp. 290-305. Springer-Verlag, 2004.
7. D. Bleichenbacher. Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1. In CRYPTO '98, Volume 1462 of LNCS, pp. 1-12. Springer-Verlag, 1998.
8. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudorandom bits. Journal on Computing, Volume 13, pp. 850-864, SIAM, 1984.
9. A. Boldyreva and M. Fischlin. Analysis of random-oracle instantiation scenarios for OAEP and other practical schemes. In CRYPTO 2005, Volume 3621 of LNCS, pp. 412-429. Springer-Verlag, 2005.
10. A. Boldyreva and M. Fischlin. On the Security of OAEP. Full version of this paper, available from the authors' homepages. 2006.
11. R. Canetti. Towards realizing random oracles: Hash functions that hide all partial information. In CRYPTO '97, Volume 1294 of LNCS. pp. 455-469. Springer-Verlag, 1997.
12. R. Canetti, O. Goldreich and S. Halevi. The random oracle methodology, revisited. In STOC '98, pp. 209-218. ACM, 1998.
13. R. Canetti, D. Micciancio and O. Reingold. Perfectly one-way probabilistic hash functions. In STOC '98, pp. 131-140. ACM, 1998.
14. Y. Dodis, R. Oliveira, and K. Pietrzak. On the generic insecurity of full-domain hash. In CRYPTO 2005, Volume 3621 of LNCS, pp. 449-466. Springer-Verlag, 2005.
15. D. Dolev, C. Dwork and M. Naor. Non-malleable cryptography. Journal on Computing, Vol. 30(2), pp. 391-437. SIAM, 2000.
16. E. Fujisaki, T. Okamoto, D. Pointcheval and J. Stern. RSA-OAEP is secure under the RSA assumption. In CRYPTO 2001, volume 2139 of LNCS, pp. 260-274. Springer-Verlag, 2001.
17. S. Goldwasser and Y. T. Kalai. On the (in)security of the Fiat-Shamir paradigm. In FOCS 2003. IEEE, 2003.
18. IETF-TLS Working Group. Transport Layer Security. http://www.ietf.org/ html.charters/tls-charter.html, November 2005.
19. U. Maurer, R. Renner and C. Holenstein. Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In TCC 2004, volume 2951 of LNCS, pp. 21-39. Springer-Verlag, 2004.
20. J. Nielsen. Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case. In CRYPTO 2002, volume 2442 of LNCS, pp. 111-126. Springer-Verlag, 2002.
21. P. Paillier and D. Vergnaud. Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log. In Asiacrypt 2005, volume 3788 of LNCS, pp. 1-20. Springer-Verlag, 2005.
22. A. Yao. Theory and applications of trapdoor functions. In FOCS '82, pp. 80-91. IEEE, 1982.