Abstract
As an important part of smart cities, vehicle ad hoc networks (VANETs) have attracted much attention from both industry and academia. In a VANET, generating a secure session key to facilitate subsequent data-in-transit transfer between two or more vehicles is crucial, which can be achieved by using an authenticated key agreement protocol. However, most of the existing identity-based two-party authenticated key agreement protocols have significant computational requirements or are known to be insecure. Thus, in this paper, a secure and efficient identity-based two-party authenticated key agreement protocol is presented by us. This protocol does not involve complex bilinear pairing computations and can generate a valid session key in two rounds. The security of the proposed protocol is proved in the eCK model which has better capability to describe a protocol’s security than the famous CK model, and it has been widely used in the security proof of ID-based key agreement protocols currently. Additionally, we also evaluate its performance for potential utility in a VANET.
Highlights
As smart cities become a reality, vehicle ad hoc networks (VANETs) will become increasingly crucial. erefore, data communications in a VANET are no longer restricted to a small number of vehicles, as such communications can occur among a wide range of vehicles, roadside units, and other supporting infrastructure (e.g., IPbased CCTV). is allows the collection of tra c and other environmental information that can be analyzed to facilitate a smooth city operation
Before we analyze a forging attack in detail, we rstly review the Gap Diffie–Hellman (GDH) problem. is mathematical assumption is that the value (X xP, Y yP) is given, where x, y∈RZ∗p is unknown, the aim of challenger S is to get the result of G DH(X, Y) xyP by using a Decisional Diffie–Hellman (DDH) oracle. en, a challenger S plays the ID-eCK game with the adversary C who can break the protocol Π
As it shows in our security proof, it is forbidden that both a user’s long-term and temporary secret keys are known by an adversary
Summary
As smart cities become a reality, vehicle ad hoc networks (VANETs) will become increasingly crucial. erefore, data communications in a VANET are no longer restricted to a small number of vehicles, as such communications can occur among a wide range of vehicles (including driverless vehicles and unmanned aerial vehicles), roadside units (e.g., smart tra c lights), and other supporting infrastructure (e.g., IPbased CCTV). is allows the collection of tra c and other environmental information that can be analyzed to facilitate a smooth city operation. Shim [19] found that the protocol presented by Smart [4] had some security flaws and constructed another one ID-based 2PAKA protocol with stronger security, which had lesser quantity of bilinear pairings. After Cao et al.’s work, lots of ID-based 2PAKA protocols using no bilinear functions were proposed, but these protocols still could not deal with the efficiency problem and security issue effectively. After the Sun et al.’s work, Ni et al [24] designed other new ID-based 2PAKA protocol that only needed five scalar multiplications in 2016 It was proved secure in the eCK security model completely. This protocol was far more efficient than previously proposed protocols, the communication traffic was still very large.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
