An authenticated Diffie-Hellman key agreement protocol secure against active attacks
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.
KeywordsDiscrete Logarithm Discrete Logarithm Problem Random Oracle Model Attack Phase Passive Eavesdrop
Unable to display preview. Download preview PDF.
- 2.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.Google Scholar
- 4.Burmester, M. and Desmedt, Y., “A secure and efficient conference key distribution system,” Proc. EUROCRYPT'94, LNCS 950, pp. 275–286, 1995.Google Scholar
- 8.Günther, C. G., “An identity-based key exchange protocol,” Proc. EURO-CRYPT'89, LNCS 434, pp. 29–37, 1990.Google Scholar
- 11.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.Google Scholar
- 12.Okamoto, T. and Ohta, K., “How to utilize the randomness of zero-knowledge proofs,” Proc. CRYPTO'90, LNCS 537, pp. 456–475, 1991.Google Scholar