Abstract
The relevance of zero knowledge to cryptography has become apparent in the recent years. In this paper we advance this theory by showing that interaction in any zero-knowledge proof can be replaced by sharing a common, short, random string. This advance finds immediate application in the construction of the first public-key cryptosystem secure against chosen ciphertext attack.
Our solution, though not yet practical, is of theoretical significance, since the existence of cryptosystems secure against chosen ciphertext attack has been a famous long-standing open problem in the field.
Supported by NSF Grant # DCR85-13926
Supported by NSF grant # CCR-8719689
Chapter PDF
5 References
W. Alexi, B. Chor, O. Goldreich, and C. Schnorr RSA/Rabin Bits Are 1/2 + 1/poly(log N) Secure, To appear SIAM J. on Computing.
M. Blum, Coin Flipping by Telephone, IEEE COMPCON 1982, pp. 133–137.
M. Blum, unpublished manuscript
M. Blum, L. Blum and M. Shub, A simple and secure pseudo-randomnumber generator, SIAM Journal of Computing, 1986
Blum, De Santis, Feldman, Micali, and Persiano, Non-Interactive Zero Knowledge and Its Applications, in preparation.
M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, J. Kilian, S. Micali, and P. Rogaway, Everything Provable is Provable in Zero-Knowledge, These Proceedings
R. Boppana, J. Hastad and S. Zachos, Interactive Proofs Systems for CO-NP Imply Polynomial Time Hierarchy Collapse, In preperation.
M. Blum and S. Micali, How To Generate Sequences Of Cryptographically Strong Pseudo-Random Bits, SIAM J. on Computing, Vol. 13, Nov 1984, pp. 850–864
Diffie, W., and M.E. Hellman, New Directions in Cryptography, IEEE Trans. on Inform. Theory
De Sentis, Micali, and Persiano, Non Interactive Zero-Knowledge Proof Systems, Proc. Crypto 87.
L. Fortnow, The Complexity of Perfect Zero-Knowledge, Proc. 19th ann. Symp. on Theory of Computing, New York, 1987.
Feige, Fiat and A. Shamir, Zero-knowledge proofs of identity, Proceedings of the 19th Annual ACM Symp. on Theory of Computing, 1987, pp. 210–217
S. Goldwasser, and S. Micali, Probabilistic Encryption, JCSS Vol. 28, No. 2, April 1984.
S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, To appear SIAM J. on Computing (manuscript available from authors).
S. Goldwasser, S. Micali, and R. Rivest, A Digital Signature Scheme Secure Against Adaptive, Chosen Cyphertext Attack To appear in SIAM J. on Computing (available from authors)
S. Goldwasser, S. Micali, and P. Tong, Why and how to establish a perivate code in a public network, Proc. 23rd Symp. on Foundations of Computer Science, Chicago, Ill., 1982
O. Goldreich, S. Micali and A. Wigderson, Proofs that Yield Nothing but their Validity and a Methodology of Cryptographic Design, Proc. of FOCS 1986.
O. Goldreich, S. Micali and A. Wigderson, How to Play Any Mental Game, Proceedings of the 19th Annual ACM Symp. on Theory of Computing, 1987, pp. 218–229.
S. Goldwasser and M. Sipser, Private Coins versus Public Coins in Interactive Proof Systems, Proceedings of the 18th Annual ACM Sympl on Theory of Computing, 1986, pp. 59–68.
R. Impagliazzo, Personal Communication.
S. Micali and A. Shamir An improvement of the Fiat-Shamir Identification and Signature Scheme, These proceedings
M. Rabin, Digitalized signatures and public-key functions as intractable as factorization, MIT/LCS/TR-212, Technical report MIT, 1978
A. Yao, Theory and Application of Trapdoor Functions, Proc. of 23rd FOCS, IEEE, Nov., 1982, pp. 80–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blum, M., Feldman, P., Micali, S. (1990). Proving Security Against Chosen Ciphertext Attacks. In: Goldwasser, S. (eds) Advances in Cryptology — CRYPTO’ 88. CRYPTO 1988. Lecture Notes in Computer Science, vol 403. Springer, New York, NY. https://doi.org/10.1007/0-387-34799-2_20
Download citation
DOI: https://doi.org/10.1007/0-387-34799-2_20
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97196-4
Online ISBN: 978-0-387-34799-8
eBook Packages: Springer Book Archive