Anonymous Authentication and Key Agreement Scheme Combining the Group Key for Vehicular Ad Hoc Networks

Abstract

Vehicular ad hoc network (VANET) is a multihop mobile wireless communication network that can realize many vehicle-related applications through multitop communication. In the open wireless communication environment, security and privacy protection are important contents of VANET research. The most basic method of VANET privacy protection is anonymous authentication. Even through, there are many existing schemes to provide anonymous authentication for VANETs. Many existing schemes suffer from high computational cost by using bilinear pairing operation or need the assistance of the trust authorities (TAs) during the authentication process or rely on an ideal tamper-proof device (TPD), which requires very strong security assumption. In this study, an anonymous authentication and key negotiation scheme by using private key and group key is proposed, which is based on pseudonym using the nonsingular elliptic curve. In this scheme, there is no third party trust center to participate in the authentication, there is no need to query the database, and there is no need of the local database to save the identity information of many vehicles, which reduce the storage space and the authentication time compared with other schemes. The proposed scheme only needs realistic TPDs. In the proposed scheme, TPDs do not need to preinstall the system key as many other schemes do; hence, the failure of a single TPD does not affect the security of the entire system. The security of the scheme is proved under the random oracle model. Compared with the related schemes using bilinear pairings, the computational cost and communication cost of the proposed scheme are reduced by 82% and 50%, respectively.

A Novel Framed Slotted Aloha Medium Access Control Protocol Based on Capture Effect in Vehicular Ad Hoc Networks

“…The number of vehicles that have not successfully established a connection can be expressed as N 2 = N 1 − N 1 p 1 , while the remaining slots can be represented by L 2 = N 1 − N 1 p 1 . According to Equation ( 9) or (13), the probability of the second successful vehicle gaining access is denoted by p 2 . The number of vehicles successfully accessing slots after the second random access is ⌊N 2 p 2 ⌋, and they occupy ⌊N 2 p 2 ⌋ time slots.…”

“…In recent years, the research on FSA protocol has garnered significant attention [10,11]. The utilization of FSA has been widespread in various domains including wireless sensor networks [12], vehicular ad hoc networks [13,14], and radio frequency identification networks [15]. Meanwhile, an increasing number of end-users are adopting the FSA protocol for communication, leading to intensified competition for access time slots.…”

Privacy Preservation Authentication: Group Secret Handshake with Multiple Groups

“…Lee et al [36] proposed an anonymous authenticated key exchange protocol based on PUF to achieve efficient user join and exit. Sun et al [37] constructed an efficient scheme based on realistic tamper-proof devices to achieve key exchange for VANETs. Guo et al [38] proposed an authenticated key exchange method which holds anonymity for wearable computing environments.…”

Development of a Secure Authentication System Using 5G for Smart Transportation System and Road Safety

“…Moreover, the protocol relies on the costly ECDH technique. In [15], Mei et al suggests an authentication and key agreement scheme that ensures anonymity, the scheme is built upon pseudonyms, utilizing a nonsingular elliptic curve. In [16], Azees et al suggests a signature based AKA protocol for vehicular ad-hoc networks.…”