A secure authenticated key agreement protocol

Abstract

Authenticated key agreement protocols have an important role for building secure communications amongst two or more entities over the Internet. In this paper we propose an efficient and secure authenticated key agreement protocol based on Diffie-Hellman key agreement. Our protocol is more efficient than previous authenticated key agreement protocols because it requires only 1 integer multiplication. We show that our protocol meets the security attributes under the assumption that the elliptic curve discrete logarithm problem is secure.