A two-party authenticated Diffie-Hellman key agreement protocol is proposed. The protocol is practical and provably secure against passive eavesdropping, interference and unknown-key share in the random oracle model. The results hold even if the above attacks are known key attacks. This protocol also provides forward secrecy.
PostScript File (470K)
Zipped Postscript File (212K)
Adobe Acrobat (.pdf) File (93K)
An Efficient and Secure Key Agreement
Chang-Hyi Lee, Jong-In Lim and Jeong-Soo Kim, June 1999.
In this paper we propose a new and efficient protocol for authenticated key agreement based on Diffie-Hellman key agreement, which works in an arbitrary finite group. Our AK (Key Agreement) protocol saves some of computational cost, since it requires only two dominant computation factors (e.g., modulo exponentiation in RSA type system or integer multiplication with a point in elliptic curve cryptosystem) for each entity. Our protocol is not also efficient for two passing AK but also for three passing authenticated AK protocol with key confirmation (AKC).
PostScript File (286K)
Zipped PostScript File (64K)
Adobe Acrobat (.pdf) File (228K)
|IEEE Home Page||IEEE Standards||P1363 Home Page|