OAEP Reconsidered

Journal of Cryptology

Volumn 15, Issue 4, 2002, Pages 223-249

  Shoup, Victor ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

Chosen ciphertext security; Public key encryption; Random oracle model

Indexed keywords

COMPUTER CRIME; LINEAR ALGEBRA; MATHEMATICAL MODELS; RANDOM PROCESSES; SECURITY SYSTEMS;

CHOSEN CIPHERTEXT SECURITY; RANDOM ORACLE MODELS; TRAPDOOR PERMUTATION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 1642489925     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-002-0133-9     Document Type: Article

References (19)

1. [ASW] N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications, 18(4):593-610, 2000.
2. Extended abstract in Advances in Cryptology - Eurocrypt '98.
3. [BCK] M. Bellare, R. Canetti, and H. Krawczyk. A modular approach to the design and analysis of authentication and key exchange protocols. In Proceedings of the 30th Animal ACM Symposium on Theory of Computing, pages 419-428, 1998.
4. [BDPR] M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among notions of security for public-key encryption schemes. In Advances in Cryptology - Crypto '98, pages 26-45, 1998.
5. [Bo] D. Boneh. Simplified OAEP for the RSA and Rabin functions. In Advances in Cryptology - Crypto 2001, pages 275-291, 2001.
6. [BRI] M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proceedings of the First ACM Conference on Computer and Communications Security, pages 62-73, 1993.
7. [BR2] M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Advances in Cryptology - Eurocrypt '94, pages 92-111, 1994.
8. [CGH] R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 209-218, 1998.
9. [Co] D. Coppersmith. Finding a small root of a univariate modular equation. In Advances in Cryptology-Eurocrypt '96, pages 155-165, 1996.
10. [DDN1] D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pages 542-552, 1991.
11. [DDN2] D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. SIAM Journal on Computing, 30(2):391-437, 2000.
12. [FOPS] E. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stem. RSA-OAEP is secure under the RSA assumption. In Advances in Cryptology - Crypto 2001, pages 260-274, 2001. An earlier version appeared as Cryptology ePrint Archive, Report 2000/061, http://eprint.iacr.org.
13. [GM] S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270-299, 1984.
14. [MvOV] A. Menesez, P. van Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, Boca Raton, FL, 1997.
15. [NY] M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 427-437, 1990.
16. [RS] C. Rackoff and D. Simon. Noninteractive zero-knowledge proof of knowledge and chosen ciphertext attack. In Advances in Cryptology - Crypto '91, pages 433-444, 1991.
17. [RSA] R. L. Rivest, A. Shamir, and L. M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2): 120-126, 1978.
18. [Sh 1 ] V. Shoup. Lower bounds for discrete logarithms and related problems. In Advances in Cryptology-Eurocrypt '97, pages 256-266, 1997.
19. [Sh2] V. Shoup. On formal models for secure key exchange. Cryptology ePrint Archive, Report 1999/012, 1999. http://eprint.iacr.org.