A New Two-Party Identity-Based Authenticated Key Agreement

Joux [17] presented the first major Memorandum of Understanding on Matings in 2000. Then Boneh and Franklin used bilineare mating to build the first ID-based encryption scheme in 2001 [18]. After boneh and Franklin, many key agreement protocols authenticated with ID-based pairs were presented. According to this ID-based encryption scheme, the first ID-based 2PAKA protocol with Smart [4] couplings was introduced. Unfortunately, Shim [19] found that the protocol presented by Smart [4] had some security flaws and built another ID-based 2PAKA protocol, with greater security, with fewer bileheat pairs. In Shim`s minutes [19], the session key calculation used only one weil mating and a scalar multiplication. Meanwhile, Shim said his protocol could withstand general attacks. However, Shim`s protocol [20] has been shown to suffer a man attack in the middle, in the Hsieh journal [19]. The main features of our proposed protocol are summarized as follows: (1) Mutual authentication of both parties and negotiation of the session key can be achieved by our AKA protocol based on ID. (2) We show that our protocol, unlike most other existing protocols, can benefit from high security in the eCK model. (3) The proposed protocol is bi-round and coupleless.

Therefore, it is superior to other competing protocols in terms of performance. Many key bipartisan agreements (ID-2PAKA) with elliptical curve cryptography (ECC) have recently been proposed, but these protocols do not provide sufficient security and their computational cost is also relatively high due to bileographic coupling and map-to-point function. In addition, they require many communication cycles to create the session key, which increases communication latency, making them unsuitable for real-world applications. This document therefore aims to propose a non-mating protocol of ID-2PAKA based on the ECC, which will eliminate the security flaws of previous protocols. The proposed protocol helps two users set up a common meeting key between them via an open network. Formal security analysis with BAN logic and comparisons with other protocols are given that have shown that our protocol is formally safe and therefore suitable for safe and effective peer-to-peer communication. This letter proposes an identity-based protocol for the agreement of certified keys. Unlike what happens, the new protocol performs implicit authentication without bilineares pairs, making it more efficient. The security of the proposed protocol can be reduced to the Standard-Computational Diffie-Hellman problem. Two variants of the protocol are also indicated, one reaching the compromise on safety and efficiency and the other providing a key authenticated agreement between users in different areas. Therefore, a basic design function is to create a fast and secure communication channel between different entities in a VANET, such as the use .B 2PAKA (Two-Party Authenticate Key Agreement) protocols or key agreement protocols within the group.

Especially in VANETs, a reliable 2PAKA protocol can help two communications services achieve mutual authentication and obtain a valid session key. It is not surprising that a large number of 2PAKA protocols have been proposed to facilitate the secure exchange of messages in VANETs.