A Secure and Efficient Group Key Agreement Scheme for VANET

Abstract

A vehicular ad hoc network (VANET) is a special mobile ad hoc network that provides vehicle collaborative security applications using intervehicle communication technology. The method enables vehicles to exchange information (e.g., emergency brake). In VANET, there are many vehicle platoon driving scenes, where vehicles with identical attributes (location, organization, etc.) are organized as a group. However, this organization causes the issue of security threats (message confidentiality, identity privacy, etc.) because of an unsafe wireless communication channel. To protect the security and privacy of group communication, it is necessary to design an effective group key agreement scheme. By negotiating a dynamic session secret key using a fixed roadside unit (RSU), which has stronger computational ability than the on-board unit (OBU) equipped on the vehicle, the designed scheme can help to provide more stable communication performance and speed up the encryption and decryption processes. To effectively implement the anonymous authentication mechanism and authentication efficiency, we use a batch authentication scheme and a shared secret key mechanism among the vehicles, RSUs and trusted authority (TA). We design an efficient group secret key agreement scheme, which satisfies the above communication and security requirements, protects the privacy of vehicles, and traces the real identity of the vehicle at a time when it is necessary. Computational analysis shows that the proposed scheme is secure and more efficient than existing schemes.

A group key agreement protocol for intelligent internet of things system

“…To avoid the security threat of vehicle-to-vehicle communication in the vehicle ad hoc network, an effective GKA scheme is proposed in Liu et al 6 In the scheme, a fixed roadside unit method of negotiating a dynamic session key is adopted, which not only improves the communication performance, but also increases the communication speed. In addition, a batch authentication scheme is also proposed, which effectively implements an anonymous identity verification mechanism and improves the efficiency of identity verification.…”

Efficient Short Group Signatures for Conditional Privacy in Vehicular Ad Hoc Networks via ID Caching and Timed Revocation

“…This results in a system that is highly vulnerable to the injection of bad data, without a reliable way to trace and remove the offending vehicles even in the case such data is detected. For example, among recently proposed group key schemes, schemes by Cui et al [13], Islam et al [14], Liu et al [15], and Paliwal & Chandrakar [16] assign traceable pseudo-IDs to vehicles, but the identities are only authenticated when the vehicle joins (and for some schemes when it leaves) a group. When the vehicles are within the system, they are free to create mayhem.…”

“…Some schemes propose to preserve forward and backward secrecy perfectly by updating the group secret for every vehicle that leaves and, in many current schemes, also for joining members [2], [11], [12], [13], [15], [16], [18], [24], [26]. In order to investigate the required update frequency for such a strategy under some common traffic conditions, publicly available traffic count data for three US cities: Houston [41], Seattle [42], and New York [43] were analyzed.…”

A Scalable and Secure Group Key Management Method for Secure V2V Communication

“…The communication cost is defined as the delay taken to broadcast a certain amount of information from GM to provide V2V group members with an updated group key. Table 6 shows the computation time and storage overhead of various key management approaches, namely, a secure and efficient group key agreement (SEGKA) [14], fast-Chinese remainder group key (FCRGK) [11], key-tree Chinese remainder theorem (KCRT) [12], number theory research unit (NTRU) [37], Elgamal group key management (EGKM) [37], VANET group key management (VGKM) [13], and our scalable and secure group key management (2SGKM) method. The notations used for the comparison are defined as: O represents the computation cost in the order of magnitude of the operations, n is the number of group members, τ is the maximum number of children of each node in the tree, and EEA indicates the time taken to find the inverse element of a multiplicative group using the extended Euclidean algorithm.…”