Relaxing chosen-ciphertext security

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

Volumn 2729, Issue , 2003, Pages 565-582

  Canetti, Ran ^a   Krawczyk, Hugo ^a,b   Nielsen, Jesper B ^a,c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA; SEMANTICS;

CHOSEN CIPHERTEXT ATTACK; CHOSEN CIPHERTEXT SECURITY; ENCRYPTION SCHEMES; INDISTINGUISHABILITY; NON-MALLEABILITY; SEMANTIC SECURITY; STANDARD REQUIREMENTS; UNIVERSALLY COMPOSABLE SECURITY;

CRYPTOGRAPHY;

EID: 35248875326     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45146-4_33     Document Type: Article

References (27)

1. JH An, Y. Dodis, and T. Rabin, "On the Security of Joint Signature and Encryption", in Eurocrypt '02, pages 83-107, 2002. LNCS No. 2332.
2. M. Bellare, R. Canetti and H. Krawczyk, "A modular approach to the design and analysis of authentication and key-exchange protocols", 30th STOC, 1998.
3. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway, "Relations Among Notions of Security for Public-Key Encryption Schemes", Advances in Cryptology - CRYPTO'98 Proceedings, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk, ed., Springer-Verlag, 1998.
4. M. Bellare and C. Namprempre, "Authenticated encryption: Relations among notions and analysis of the generic composition paradigm", Advances in Cryptology - ASIACRYPT'00 Proceedings, Lecture Notes in Computer Science Vol. 1976, T. Okamoto, ed., Springer-Verlag, 2000.
5. Bellovin, S. M. and Merritt, M., "Encrypted key exchange: Password- based protocols secure against dictionary attacks", In Proceedings of the IEER Computer Society Symposium on Research in Security and Privacy 1992, pp. 72-84.
6. Bleichenbacher, D., "Chosen Ciphertext Attacks against Protocols Based on RSA Encryption Standard PKCS #1", Advances in Cryptology - CRYPTO'98 Proceedings, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk, ed., Springer-Verlag, 1998, pp. 1-12.
7. R. Canetti, "Universally Composable Security: A new paradigm for cryptographic protocols", http://eprint.iacr.org/2000/067. Extended Abstract appears in 42nd FOCS, 2001.
8. R. Canetti, H. Krawczyk and J. Nielsen, "Relaxing Chosen Ciphertext Security," available online at http://eprint.iacr.org, 2003.
9. R. Canetti and S. Goldwasser, "A practical threshold cryptosystem resilient against adaptive chosen ciphertext attacks", Eurocrypt'99, 1999.
10. Canetti, R., and Krawczyk, H., "Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels", Eurocrypt 01, 2001.
11. Full version in: Cryptology ePrint Archive (http://eprint.iacr.org/), Report 2001/040.
12. R. Cramer and V. Shoup, "A practical public-key cryptosystem provably secure against adaptive chosen ciphertext attack", Advances in Cryptology - CRYPTO'98 Proceedings, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk, ed., Springer-Verlag, 1998.
13. D. Dolev, C. Dwork and M. Naor, Non-malleable cryptography, SIAM. J. Computing, Vol. 30, No. 2, 2000, pp. 391-437.
14. Preliminary version in 23rd Symposium on Theory of Computing (STOC), ACM, 1991.
15. T. ElGamal, A Public-Key cryptosystem and a Signature Scheme based on Discrete Logarithms, IEEE Transactions, Vol. IT-31, No. 4, 1985, pp. 469-472.
16. O. Goldreich, "Foundations of Cryptography: Basic Tools", Cambridge Press, 2001.
17. O. Goldreich, S. Goldwasser and S. Micali, "How to construct random functions," Journal of the ACM, Vol. 33, No. 4, 210-217, (1986).
18. S. Goldwasser and S. Micali, Probabilistic encryption, JCSS, Vol. 28, No 2, 1984.
19. S. Halevi, and H. Krawczyk, "Public-Key Cryptography and Password Protocols", ACM Transactions on Information and System Security, Vol. 2, No. 3, August 1999, pp. 230-268.
20. Dennis Hofheinz and Joern Mueller-Quade and Rainer Steinwandt, "On Modeling IND-CCA Security in Cryptographic Protocols", http://eprint.iacr.org/2003/024. 2003.
21. H. Krawczyk, "The order of encryption and authentication for protecting communications (Or: how secure is SSL?)", Crypto 2001. http://eprint.iacr.org/2001/045
22. M. Krohn, "On the definitions of cryptographic security: Chosen-Ciphertext attack revisited," Senior Thesis, Harvard U., 1999.
23. M. Naor and M. Yung, "Public key cryptosystems provably secure against chosen ciphertext attacks". Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990.
24. Jesper B. Nielsen, " Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case", in M. Yung, editor, Advances in Cryptology - Crypto 2002, pages 111-126,Lecture Notes in Computer Science Volume 2442.
25. C. Rackoffand D. Simon, "Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack", CRYPTO '91, 1991.
26. V. Shoup, "A Proposal for an ISO Standard for Public Key Encryption", Crypto Eprint archive entry 2001:112, http://eprint.iacr.org, 2001.
27. A. Sahai, "Non malleable, non-interactive zero knowledge and adaptive chosen ciphertext security", FOCS 99.