Efficient Pairing-Free Certificateless Authentication Scheme With Batch Verification for Vehicular Ad-Hoc Networks

Abstract

The continuous progress of the wireless communication technology provides an intelligent and efficient transportation system through vehicular ad-hoc networks (VANETS) to mitigate traffic jams and road fatalities, which improves safety of passengers and traffic flow. Many researchers, vehicle manufacturers, and telecommunication industries are working on VANETS to construct the next generation transport system. In VANETS, vehicles, equipped with wireless devices, exchange the traffic-related information with other vehicles and the fixed road side units (RSUs). The information shared between vehicles and RSUs in VANETS must be secure. For secure communications in VANETS, many cryptographic schemes were proposed in different settings, and most of the schemes are using bilinear pairings over elliptic curves. But the computation of a bilinear pairing is very expensive. Also the verification of signatures/messages sent by vehicles increases the computational workload on RSUs. In order to improve computational efficiency and transmission overhead, in this paper, we present an efficient pairing-free certificateless authentication scheme with batch verification for VANETS. We designed the scheme in pairing-free environment which improves the communication and computational efficiency. The proposed scheme supports batch verification, which significantly reduces the computational workload on RSUs in VANETS. The proposed scheme is proven secure in the random oracle model and meets the security requirements, such as authenticity, integrity, traceability, anonymity, and revocation. We compared our scheme with well-known existing schemes, and the efficiency analysis shows that the proposed scheme is more efficient.