Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks (1995)
| Venue: | In Proc. of the 22nd STOC |
| Citations: | 212 - 13 self |
BibTeX
@INPROCEEDINGS{Naor95public-keycryptosystems,
author = {Moni Naor and Moti Yung},
title = {Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks},
booktitle = {In Proc. of the 22nd STOC},
year = {1995},
pages = {427--437},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We show how to construct a public-key cryptosystem (as originally defined by Diffie and Hellman) secure against chosen ciphertext attacks, given a public-key cryptosystem secure against passive eavesdropping and a non-interactive zero-knowledge proof system in the shared string model. No such secure cryptosystems were known before. Key words. cryptography, randomized algorithms AMS subject classifications. 68M10, 68Q20, 68Q22, 68R05, 68R10 A preliminary version of this paper appeared in the Proc. of the Twenty Second ACM Symposium of Theory of Computing. y Incumbent of the Morris and Rose Goldman Career Development Chair, Dept. of Applied Mathematics and Computer Science, Weizmann Institute of Science, Rehovot 76100, Israel. Work performed while at the IBM Almaden Research Center. Research supported by an Alon Fellowship and a grant from the Israel Science Foundation administered by the Israeli Academy of Sciences. E-mail: naor@wisdom.weizmann.ac.il. z IBM Research Division, T.J ...
