An Effective Authentication Scheme for Vanet

Abstract

During recent years, the auto industry has improved vehicle performance and security compared to other industries. Vehicular Ad-hoc Network (VANET) is a subset of Mobile Ad hoc Networks (MANET) which supports Vehicle-to-Vehicle (V2V), Vehicle-to-Infrastructure (V2I), and Vehicle-to-Roadside Unit (V2R) communications. VANET is a public network, due to which the transmission of messages poses the most critical and complex security issues. An essential part of the security of a VANET is the ability to authenticate users and ensure that their data is protected from unauthorized access, disclosure, or modification. This thesis includes a brief overview of VANET components, nodes, and taxonomy of existing authentication schemes and their mechanisms, advantages, disadvantages, and performance. This thesis also includes the challenges and issues faced in a VANET environment. The main objective of this thesis is to improve an existing signature-based authentication scheme that implements Identity Based Signature (IBS) technique and Identity-Based Offline Online Signature (IBOOS) to provide efficient results with low computation overhead and workload. The improved AA-identity-based authentication scheme also uses the Chinese Remainder Theorem (CRT-RSA) algorithm for emergency communication without Road Side Unit (RSU) for V2V communication. CRT-RSA algorithm is an enhanced version of the RSA algorithm to lower the computation delay. The scheme involves edge servers connected with RTA. The central server is connected to those edge servers to provide services to the vehicles on demand. This signature-based approach is helpful to authenticate and notify vehicles about unauthorized messages and malicious vehicles. The experiment results show that the improved scheme performs better than the existing IBS and IBOOS based scheme in the registration phase, where overhead is significantly reduced by 81.7%. The results of emergency communication are also improved because of the CRT-RSA algorithm, where overhead is reduced by 31.7% compared to the existing scheme sresulting in low computational delay