Abstract
A two-party authenticated Diffie-Hellman key agreement protocol is proposed. The protocol is practical and provably secure against passive eavesdropping, impersonation, interference, active eavesdropping and pretense in the random oracle model on the assumptions that the Diffie-Hellman problem is intractable and that the secret pieces of information of users are selected at random and independently of each other. All of these attacks are assumed to be known-key attacks. The security against passive eavesdropping is proved on the assumption that the attacker knows the secret pieces of information of the participants. As an application of the proposed protocol, a star-based conference key distribution protocol is also designed.
Preview
Unable to display preview. Download preview PDF.
References
Bengio, S., Brassard, G., Desmedt, Y. G., Goutier, C. and Quisquater, J.-J., “Secure implementation of identification systems,” J. Cryptology, vol. 4, pp. 175–183, 1991.
Bellare, M. and Rogaway, P., “Random oracles are practical: A paradigm for designing efficient protocols,” Proc. the 1st ACM Conference on Computer and Communications Security, pp. 62–73, 1993.
Burmester, M., “On the risk of opening distributed keys,” Proc. CRYPTO'94, LNCS 839, pp. 308–317, 1994.
Burmester, M. and Desmedt, Y., “A secure and efficient conference key distribution system,” Proc. EUROCRYPT'94, LNCS 950, pp. 275–286, 1995.
Diffie, W. and Hellman, M. E., “New directions in cryptography,” IEEE Trans. Infor. Theory, vol. IT-22, pp. 644–654, 1976.
Diffie, W., van Oorschot, P. and Wiener, M. J., “Authentication and authenticated key exchanges,” Designs, Codes and Cryptography, vol. 2, pp. 107–125, 1992.
Fiat, A. and Shamir, A., “How to prove yourself: practical solutions to identification and signature problems,” Proc. CRYPTO'86, LNCS 263, pp. 186–194, 1987.
Günther, C. G., “An identity-based key exchange protocol,” Proc. EURO-CRYPT'89, LNCS 434, pp. 29–37, 1990.
Hirose, S. and Ikeda, K., “A conference key distribution system for the star configuration based on the discrete logarithm problem,” Information Processing Letters, vol. 62, no. 4, pp. 189–192, 1997.
Just, M. and Vaudenay, S., “Authenticated multi-party key agreement,” Proc. ASIACRYPT'96, LNCS 1163, pp. 36–49, 1996.
Matsumoto, T., Takashima, Y. and Imai, H., “On seeking smart public-key distribution systems,” Trans. of IECE of Japan, vol. E69, no. 2, pp. 99–106, 1986.
Okamoto, T. and Ohta, K., “How to utilize the randomness of zero-knowledge proofs,” Proc. CRYPTO'90, LNCS 537, pp. 456–475, 1991.
Schnorr, C. P., “Efficient identification and signatures for smart cards,” Proc. CRYPTO'89, LNCS 435, pp. 239–252, 1990.
Yacobi, Y., “A key distribution paradox,” Proc. CRYPTO'90, LNCS 537, pp. 268–273, 1991.
Yacobi, Y. and Shmuely, Z., “On key distribution systems,” Proc. CRYPTO'89, LNCS 435, pp. 344–355, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hirose, S., Yoshida, S. (1998). An authenticated Diffie-Hellman key agreement protocol secure against active attacks. In: Imai, H., Zheng, Y. (eds) Public Key Cryptography. PKC 1998. Lecture Notes in Computer Science, vol 1431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054020
Download citation
DOI: https://doi.org/10.1007/BFb0054020
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64693-8
Online ISBN: 978-3-540-69105-1
eBook Packages: Springer Book Archive