Efficient and Secure Key Exchange Protocol Based on Elliptic Curve and Security Models

nowadays, the success of many online applications relays on keeping the data sent through the global network secure and far away from hackers. To carry out this task, the two communicating parties must exchange keys during their session. Some of the key exchange protocols are called key agreement protocols. The Elliptic Curve-Diffie Hellman (ECDH) is one of the most efficient algorithms for securing data. The ECDH is more efficient than other traditional techniques such as Rivest-Shamir-Adleman (RSA) in terms of key size, computation and network bandwidth. The Authenticated Key Agreement (AKA) protocol is used for establishing a common session key between the two communicating parties. The common session key is used for subsequent cryptography goals. Most of the key agreement protocols (e.g. Menezes-Qu-Vanstone(MQV) family) generate one key per session therefore increasing the opportunities for guessing the session key. In this paper, we focus on developing an enhanced multiple sessions key which is based on ECDH. We propose an efficient and secure AKA protocol which is based on the ideas of the hashed MQV (HMQV), the YAK protocol as a robust key agreement based on public key authentication and multiple session keys. The proposed protocol generates multiple common keys per a session, where the generated common key depends on the static and ephemeral keys. Furthermore, the proposed protocol overcomes the attacks on the HMQV and YAK protocols and provides desirable security properties as compared with the related works in this paper.