Abstract
We propose interactive probabilistic public-key encryption schemes so that:
-
(1)
the sender and the receiver of a message, as well as the message itself, can be authenticated;
-
(2)
the scheme is secure against any feasible attack by a participant, including chosen-ciphertext attack.
Our suggested protocols can use any one-way trapdoor functions. In order to formulate and prove the properties of our procedures, we propose several new complexity-theoretic definitions of different levels of cryptographic security for systems which allow interaction. Chosen-ciphertext security is achieved using the techniques of minimum-knowledge interactive proofs, and requires only a constant number of message exchanges at the system’s initiation stage.
Chapter PDF
Similar content being viewed by others
References
M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comp., 13(4):850–864, Nov. 1984.
G. Brassard. Modern Cryptology: A Tutorial, volume 325 of Lecture Notes in Computer Science. Springer-Verlag, 1988.
W. Diffie and M.E. Hellman. New directions in cryptography. IEEE Trans. on Inform. Theory, IT-22:644–654, November 1976.
D. Dolev and A.C. Yao. On the security of public-key protocols. IEEE Trans. on Inform. Theory, IT-29:198–208, 1983.
S. Even and O. Goldreich. On the security of multi-party ping-pong protocols. In Proc. 24th FOCS, pages 34–39, 1983.
U. Feige, A. Fiat, and A. Shamir. Zero knowledge proofs of identity. J. of Cryptology, 1(2):77–94, 1988.
Z. Galil, S. Haber, and M. Yung. Symmetric public-key encryption. In Crypto’ 85. Springer-Verlag, 1986.
Z. Galil, S. Haber, and M. Yung. Minimum-knowledge interactive proofs for decision problems. SIAM J. Comput., 18(4):711–739, 1989.
Z. Galil, S. Haber, and M. Yung. Symmetric public-key cryptosystems. Submitted for publication, 1989.
S. Goldwasser and S. Micali. Probabilistic encryption. JCSS, 28:270–299, April 1984.
S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. Comput., 18(1):186–208, 1989.
R. Impagliazzo, L.A. Levin, and M. Luby. Pseudo-random generation from one-way functions. In Proc. 21st STOC, pages 12–24. ACM, 1989.
S. Micali, C. Rackoff, and B. Sloan. The notion of security for probabilistic cryptosystems. SIAM J. Comput., 17(2):412–426, 1988.
R.M. Needham and M.D. Schroeder. Using encryption for authentication in large networks of computers. Communications of the ACM, 21(12):993–999, 1978.
G.J. Simmons. A survey of information authentication. Proceedings of the IEEE, 76(5):603–620, May 1988.
M. Tompa and H. Woll. Random self-reducibility and zero knowledge interactive proofs of possession of information. In Proc. 28th FOCS, pages 472–482. IEEE, 1987.
A.C. Yao. Theory and applications of trapdoor functions. In Proc. 23rd FOCS, pages 80–91. IEEE, 1982.
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
Galil, Z., Haber, S., Yung, M. (1990). A Secure Public-Key Authentication Scheme. In: Quisquater, JJ., Vandewalle, J. (eds) Advances in Cryptology — EUROCRYPT ’89. EUROCRYPT 1989. Lecture Notes in Computer Science, vol 434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46885-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-46885-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53433-4
Online ISBN: 978-3-540-46885-1
eBook Packages: Springer Book Archive