Authentication In Vehicular Ad Hoc Networks Research Articles

Efficient Lattice-Based Ring Signature for Message Authentication in VANETs

In this article, we propose an efficient lattice-based ring signature scheme for message authentication in vehicular ad-hoc networks (VANETs). It provides unconditional identity privacy preservation, message authentication, and location privacy for the sender vehicle. The authentication of messages is extremely vital as it gives motivation for vehicles to accept, act, and further transmit messages to other vehicles in the network as well as remain a member of the network. Any unauthorized vehicle cannot transmit fraud messages into the network if messages are authenticated. The public key cryptography-based methods are more relevant for message authentication because of their easy key management and local derivation of keys. However, they add complexity to the whole network and require significant storage and computational power. Also, the predictable mobility characteristics of vehicles moving on the road make them vulnerable to tracking. This requires an additional mechanism to preserve location privacy. The proposed scheme provides unconditional identity privacy and location privacy. It is more efficient than the existing ring signature schemes in case of signature generation and verification process. Theoretical analysis and experimental results show that the proposed scheme provides security and unconditional privacy to vehicles in VANETs.

Road Condition Monitoring with Source Authentication in VANET

In recent technologies, it has been said that, to improve the travel efficiency and safety of transportation systems, vehicular ad-hoc network (VANET) has been used as the promising technology where each vehicle is able to collect and communicate the information about current road or traffic condition at a particular location using an embedded on-board unit with the help of distributed roadside units. Examples are: While detection of some accident, congestion, jam, etc., vehicles broadcast warning signals to the nearby vehicles which would give a better awareness to every nearby vehicles about the driving environment and these nearby vehicles would change the driving plan if needed. The VANET technology has gained great attentions from both industry and academics in the recent days.

NERA: A new and efficient RSU based authentication scheme for VANETs

In vehicular ad-hoc networks (VANETs), the correctness of a message requires authentication of the origin vehicle. In this paper, we introduce a novel authentication scheme for VANETs which suggests a new solution for secure vehicle communications. The proposed scheme is an road side unit (RSU) based scheme in which the master key of the Trusted Authority (TA) is embedded in a tamper-proof device provided at the RSUs. Compared with the schemes that store the master key in the on-board units, our scheme is more practical because of a secure and high speed communication link between TA and RSUs. To the best of our knowledge, this solution has not yet been devised for secure authentication in VANETs and the same objective has been fulfilled in this paper. Moreover, we introduce a formal proof to prove the security of the proposed scheme. Finally, we present a simulation and comparison indicating the performance and efficiency of our scheme.

Conditional privacy preserving authentication in VANETs: a survey

The trade-off between authentication and privacy is a key security aspect in vehicular ad hoc networks (VANETs). While it is necessary to authenticate and identify each communicating vehicle, it remains mandatory to insure and maintain the privacy. To this end, conditional privacy preserving authentication has been proposed. This paper surveys the existing literature on authentication schemes that conditionally thrive to protect the privacy in vehicular networks. We firstly introduce the most relevant proposed privacy preservation techniques. Then, we examine and categorise several authentication protocols based on their adopted privacy technique, pseudonyms based protocols, group signature based protocols, ring signature based protocols, blind signature based protocols, group signcryption based protocols and hybrid protocols which integrate more than one privacy preservation technique. We finally present a comparative analysis of the surveyed protocols, and identify some possible future research directions.

Secure and distributed certification system architecture for safety message authentication in VANET

Vehicular Ad hoc NETworks (VANETs) are a burgeoning research focus, aimed at creating communication among vehicles to improve the road safety and enhance driving conditions. For such networks, security is one of the most challenging issues due to their nature of wireless transmission and high topology changing frequency. In this paper, we propose a secure and distributed certification system architecture for safety message authentication in VANET, which resists against false public-key certification. To increase the availability of the authentication service, our proposal is designed through a decentralized system, supervised by a root authority. The latter authority delegates to a set of regional certification authorities the privilege of issuing public-key certificates to the vehicles. Each regional certification authority cooperates with its subordinates RSUs to sign public-key certificates using threshold signature. The main purpose of our solution is to ensure the messages authentication while respecting the imposed constraints by the real-time aspect and the nodes mobility. We demonstrate through the practical analysis and simulation results the efficiency of our solution with comparison to other concurrent protocols.

PUCA: A pseudonym scheme with strong privacy guarantees for vehicular ad-hoc networks

Pseudonym certificates are the state-of-the-art approach for secure and privacy-friendly message authentication in vehicular ad-hoc networks. However, most of the proposed pseudonym schemes focus on privacy among participants. Privacy towards backend providers is usually (if at all) only protected by separation of responsibilities. The protection can be overridden, when the entities collaborate, e.g. when revocation of long-term credentials is required. This approach puts the users’ privacy at risk, if the backend systems are not fully trusted.We propose PUCA – a scheme that provides full anonymity for honest users, even against colluding backend providers. The scheme uses anonymous credentials for authentication with the backend, while leaving the communication among vehicles and with road side units unchanged and in compliance with existing standards. For removal of misbehaving vehicles from the system, we leverage a privacy-friendly revocation mechanism, that does not require resolution of pseudonyms. With our scheme, we demonstrate that strong and verifiable privacy protection in vehicular networks can be achieved, while fulfilling common security requirements, such as sybil-resistance and revocation.

LESPP: lightweight and efficient strong privacy preserving authentication scheme for secure VANET communication

Authentication in vehicular ad-hoc network (VANET) is still a research challenge, as it requires not only secure and efficient authentication, but also privacy preservation. In this paper, we proposed a lightweight and efficient authentication scheme (LESPP) with strong privacy preservation for secure VANET communication. The proposed scheme utilizes self-generated pseudo identity to guarantee both privacy preservation and conditional traceability, and it only requires a lightweight symmetric encryption and message authentication code (MAC) generation for message signing and a fast MAC re-generation for verification. Compared with currently existing public key based schemes, the proposed scheme significantly reduces computation cost by $$10^2$$102---$$10^3$$103 times and decreases communication overhead by 41.33---77.60 %, thus achieving resilience to denial of service (DoS) attack. In LESPP, only key management center can expose a vehicle's real identity from its pseudo identity, therefore, LESPP provides strong privacy preservation so that the adversaries cannot trace any vehicles, even if all roadside units are compromised. Furthermore, vehicles in LESPP need not maintain certificate revocation list (CRL), so any CRL related overhead is avoided. Extensive simulations reveal that the novel scheme is feasible and has an outstanding performance of nearly 0 ms network delay and 0 % packet loss ratio, which are especially appropriate for realtime emergency event reporting applications.

Tree-Based Revocation for Certificateless Authentication in Vehicular Ad-Hoc Networks

This work proposes authentication based on identity as a way to increase the efficiency and security of communications in vehicular ad-hoc networks. When using identity-based cryptography to achieve certificateless authentication, membership revocation is not a trivial problem. Thus, in order to improve the performance of revocation in such networks, the use of a dynamic authenticated data structure based on perfect k-ary hash trees combined with a duplex version of the new standard SHA-3 is here presented. Efficient algorithms in the used revocation trees allow reaching a refresh rate of at most simple updates per inserted node. Consequently, the proposal is especially useful for situations with frequent revocations, which are foreseeable when vehicular ad- hoc networks are widely deployed.

A Cross-Layer Approach to Privacy-Preserving Authentication in WAVE-Enabled VANETs

We present an anonymous authentication and verification scheme for the IEEE Wireless Access in Vehicular Communications (WAVE)-based vehicular ad hoc networks (VANETs). Our contribution includes vehicular message authentication and an efficient prioritized verification strategy for periodic road safety messages. A variation of elliptic curve digital signature algorithm (ECDSA) is used in combination with the identity-based (ID-based) signature, where current position information on a vehicle is utilized as the ID of the corresponding vehicle. This waives the need for a third-party public key certificate for message authentication in VANETs. A high-density road traffic condition poses a challenge for authentication of vehicular messages since the required verification time is often much longer than the average interarrival time. To mitigate the issue, messages of each traffic class are verified following the VANET's medium access control (MAC) layer priorities and the application relevance of individual safety messages. Performance analysis and simulation results have shown that our approach is secure, privacy preserving, scalable, and resource efficient.

Authentication schemes for VANETs: a survey

In this paper, we make a survey of the known schemes for V2V (vehicle to vehicle) and V2I (vehicle to infrastructure) authentication in VANETs (vehicular ad hoc networks). We consider a variety of safety applications in VANETs, identify authentication as one of the security requirements and discuss the security challenges for these applications. Existing authentication schemes based on digital signatures are discussed along with schemes based on hash chains and hash trees. It has also been shown how the level of security of these schemes is increased by the involvement of a trusted Certification Authority. We also focus on issues pertaining to anonymity, unlinkability, traceability and computation and communication overhead. Finally, we summarise the limitations of the existing authentication schemes in real-life applications and conclude that further research is essential in this area.

An efficient distributed key management scheme for group‐signature based anonymous authentication in VANET

ABSTRACTGroup signature is one of the well‐known cryptographic primitives for anonymous authentication which is the fundamental requirement for securing vehicular ad hoc networks (VANETs), but it is prone to cause huge revocation overhead in VANETs with millions of nodes and serious security risk. To solve this problem, we develop an efficient distributed key management scheme (DKM) where the whole domain of VANET is divided into several sub‐regions, and any vehicle has to update its group secret key periodically from the regional group manager who manages the region where the vehicle stays. Unlike the previously reported works, DKM prevents vehicles from leaking the value of the updated group secret key to the regional group manager during the group key updating process. Subsequently, it is capable of identifying either the compromised regional authorities or the malicious vehicles. Moreover, performance analysis demonstrates that DKM can reduce the revocation cost significantly while the communication cost for key updating is small. Copyright © 2011 John Wiley & Sons, Ltd.

A Distributed Key Management Framework with Cooperative Message Authentication in VANETs

In this paper, we propose a distributed key management framework based on group signature to provision privacy in vehicular ad hoc networks (VANETs). Distributed key management is expected to facilitate the revocation of malicious vehicles, maintenance of the system, and heterogeneous security policies, compared with the centralized key management assumed by the existing group signature schemes. In our framework, each road side unit (RSU) acts as the key distributor for the group, where a new issue incurred is that the semi-trust RSUs may be compromised. Thus, we develop security protocols for the scheme which are able to detect compromised RSUs and their colluding malicious vehicles. Moreover, we address the issue of large computation overhead due to the group signature implementation. A practical cooperative message authentication protocol is thus proposed to alleviate the verification burden, where each vehicle just needs to verify a small amount of messages. Details of possible attacks and the corresponding solutions are discussed. We further develop a medium access control (MAC) layer analytical model and carry out NS2 simulations to examine the key distribution delay and missed detection ratio of malicious messages, with the proposed key management framework being implemented over 802.11 based VANETs.

Flexible, extensible, and efficient VANET authentication

Although much research has been conducted in the area of authentication in wireless networks, vehicular ad-hoc networks (VANETs) pose unique challenges, such as real-time constraints, processing limitations, memory constraints, frequently changing senders, requirements for interoperability with existing standards, extensibility and flexibility for future requirements, etc. No currently proposed technique addresses all of the requirements for message and entity authentication in VANETs. After analyzing the requirements for viable VANET message authentication, we propose a modified version of TESLA, TESLA++, which provides the same computationally efficient broadcast authentication as TESLA with reduced memory requirements. To address the range of needs within VANETs we propose a new hybrid authentication mechanism, VANET authentication using signatures and TESLA++ (VAST), that combines the advantages of ECDSA signatures and TESLA++. Elliptic curve digital signature algorithm (ECDSA) signatures provide fast authentication and non-repudiation, but are computationally expensive. TESLA++ prevents memory and computation-based denial of service attacks. We analyze the security of our mechanism and simulate VAST in realistic highway conditions under varying network and vehicular traffic scenarios. Simulation results show that VAST outperforms either signatures or TESLA on its own. Even under heavy loads VAST is able to authenticate 100% of the received messages within 107ms. VANETs use certificates to achieve entity authentication (i.e., validate senders). To reduce certificate bandwidth usage, we use Hu et al.'s strategy of broadcasting certificates at fixed intervals, independent of the arrival of new entities. We propose a new certificate verification strategy that prevents denial of service attacks while requiring zero additional sender overhead. Our analysis shows that these solutions introduce a small delay, but still allow drivers in a worst case scenario over 3 seconds to respond to a dangerous situation.