Equivalence between semantic security and indistinguishability against chosen ciphertext attacks

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

Volumn 2567, Issue , 2003, Pages 71-84

  Watanabe, Yodai ^a   Shikata, Junji ^b   Imai, Hideki ^c  

^a RIKEN BRAIN SCIENCE INSTITUTE   (Japan)

^b YOKOHAMA NATIONAL UNIVERSITY   (Japan)

^c INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA; SEMANTICS;

ATTACK MODEL; CHOSEN CIPHERTEXT ATTACK; INDISTINGUISHABILITY; SECURITY NOTION; SEMANTIC SECURITY;

CRYPTOGRAPHY;

EID: 35248875140     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36288-6_6     Document Type: Article

References (17)

1. J. H. An, Y. Dodis and T. Rabin, On the security of joint signature and encryption, In Proceedings of Advances in Cryptology - Eurocrypt 2002, Lecture Notes in Computer Science Vol. 2332, L. Knudsen ed., pp. 83-107, Springer-Verlag, 2002.
2. M. Bellare, A. Desai, D. Pointcheval and P. Rogaway, Relations among notions of security for public-key encryption schemes. In Proceedings of Advances in Cryptology - Crypto '98, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed., pp. 26-45, Springer-Verlag, 1998. The latest version is available from http://www-cse.ucsd.edu/users/mihir/
3. M. Bellare and P. Rogaway, Optimal asymmetric encryption. In Proceedings of Advances in Cryptology - Eurocrypt'94, Lecture Notes in Computer Science Vol. 950, A. De Santis ed., pp. 92-111, Springer-Verlag, 1994.
4. M. Bellare and A. Sahai, Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization. In Proceedings of Advances in Cryptology - Crypto'99, Lecture Notes in Computer Science Vol. 1666, M. Wiener ed., pp. 519-536, Springer-Verlag, 1999.
5. R. Cramer and V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Proceedings of Advances in Cryptology - Crypto'98, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk, ed., pp. 13-25, Springer-Verlag 1998.
6. D. Dolev, D. Dwork and M. Naor, Non-malleable cryptography, In Proceedings of the 23rd Annual AGM Symposium on Theory of Computing, pp. 542-552, 1991;
7. D. Dolev, D. Dwork and M. Naor, Non-malleable cryptography, SIAM Journal on Computing 30, pp. 391-437, 2000.
8. ∼oded/PSBookFrag/enc2.ps
9. ∼oded/PSBookFrag/enc.ps
10. O. Goldreich, A uniform complexity treatment of encryption and zero-knowledge, Journal of Cryptology, Vol. 6, pp. 21-53, 1993.
11. S. Goldwasser and S. Micali, Probabilistic encryption. Journal of Computer and System Sciences 28, pp. 270-299, 1984.
12. S. Micali, C. Rackoff and R. Sloan, The notion of security for probabilistic cryptosystems, SIAM Journal on Computing 17, pp. 412-426, 1988.
13. 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, pp. 427-437, 1990.
14. C. Rackoff and D. Simon, Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack, In Proceedings of Advances in Cryptology - Crypto '91, Lecture Notes in Computer Science Vol. 576, J. Feigenbaum ed., pp. 433-444, Springer-Verlag, 1991.
15. C. E. Shannon, Communication theory of secrecy systems, Bell System Technical Journal 28, pp. 656-715, 1949.
16. V. Shoup, OAEP Reconsidered, In Proceedings of Advances in Cryptology - Crypto 2001, Lecture Notes in Computer Science Vol. 2139, J. Kilian ed., pp. 239-259, Springer-Verlag, 2001.
17. A. Yao, Theory and applications of trapdoor functions, In Proceedings of the 23rd Symposium on Foundations of Computer Science, pp. 80-91, IEEE, 1982.