DocumentCode :
1388638
Title :
Flexible, extensible, and efficient VANET authentication
Author :
Studer, Ahren ; Bai, Fan ; Bellur, Bhargav ; Perrig, Adrian
Author_Institution :
Carnegie Mellon University, USA
Volume :
11
Issue :
6
fYear :
2009
Firstpage :
574
Lastpage :
588
Abstract :
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 d- lay, but still allow drivers in a worst case scenario over 3 seconds to respond to a dangerous situation.
Keywords :
Authentication; Computer crime; Cryptography; Indexes; Receivers; Broadcasting; computer network security; road vehicles;
fLanguage :
English
Journal_Title :
Communications and Networks, Journal of
Publisher :
ieee
ISSN :
1229-2370
Type :
jour
DOI :
10.1109/JCN.2009.6388411
Filename :
6388411
Link To Document :
بازگشت