An Efficient Anonymous Authentication Scheme Using Registration List in VANETs

Abstract

Nowadays, Vehicular Ad hoc Networks (VANETs) are popularly known as they can reduce traffic and road accidents. These networks need several security requirements, such as anonymity, data authentication, confidentiality, traceability and cancellation of offending users, unlinkability, integrity, undeniability and access control. Authentication is one of the most important security requirements in these networks. So many authentication schemes have been proposed up to now. One of the well-known techniques to provide users authentication in these networks is the authentication based on the smartcard (ASC). In this paper, we propose an ASC scheme that not only provides necessary security requirements such as anonymity, traceability and unlinkability in the VANETs but also is more efficient than the other schemes in the literatures.

An Efficient and Physically Secure Privacy-Preserving Authentication Scheme for Vehicular Ad-hoc NETworks (VANETs)

“…This section provides a brief overview of the most important Conditional Privacy-Preserving Authentication (CPPA) schemes introduced in [4], [8]- [10], [14], [19]- [21], [24], and shows their vulnerability. Traditional TRD-aided CPPA schemes have been introduced in [8]- [10].…”

“…RSU-aided CPPA schemes [1], [4], [14], [19]- [22] are IDbased schemes that support V-2-V and V-2-R communications. These schemes have the same four entities involved and, in most cases, authenticate drivers using a smart card.…”

“…CPPA schemes Aghabagherloo et al have shown in [4] that the schemes of [19], [20] do not provide unlinkability of messages transmitted within the range of a single RSU since the verifier must use a parameter of the previous message to validate the new message. The scheme of [14] has solved this problem using a Bloom filter with the interposition of the RSU; however, it requires permanent communication between the OBU and the RSU in all V-2-V communications.…”

“…However, they do not provide public verification and irrefutability properties. Some examples of these schemes are [1]- [4], the first two of which have high communication costs because of the vehicle's continuous communication with RSUs.…”

“…However, it is well known that side-channel and fault injection attacks can extract secret key material from tamper-resistant devices [17], [18]. Although the researches in [4], [14], [19]- [23] tried to address this problem, their proposed schemes, which we call RSU-aided schemes, require continuous vehicle communications with RSUs and the TA. This imposes high communication costs on the network.…”