Efficient Certificateless Conditional Privacy-Preserving Authentication Scheme in VANETs

Vehicular ad hoc networks (VANETs) are an increasing important paradigm for greatly enhancing roadway system efficiency and traffic safety. To widely deploy VANETs in real life, it is critical to deal with the security and privacy issues in VANETs. In this paper, we propose a certificateless conditi...

Full description

Saved in:
Bibliographic Details
Published inMobile information systems Vol. 2019; no. 2019; pp. 1 - 19
Main Authors Ming, Yang, Cheng, Hongliang
Format Journal Article
LanguageEnglish
Published Cairo, Egypt Hindawi Publishing Corporation 01.01.2019
Hindawi
Hindawi Limited
Subjects
Authentication
Communication
Computer simulation
Cryptography
Curves
Delay
Digital signatures
Mobile ad hoc networks
Privacy
Program verification (computers)
Public Key Infrastructure
Roads
Security
Security services
Sensors
Traffic congestion
Traffic control
Traffic safety
Vehicle-to-infrastructure
Vehicles
Online AccessGet full text

Cover

More Information
Summary:Vehicular ad hoc networks (VANETs) are an increasing important paradigm for greatly enhancing roadway system efficiency and traffic safety. To widely deploy VANETs in real life, it is critical to deal with the security and privacy issues in VANETs. In this paper, we propose a certificateless conditional privacy preserving authentication (CCPPA) scheme based on certificateless cryptography and elliptic curve cryptography for secure vehicle-to-infrastructure communication in VANETs. In the proposed scheme, a roadside unit (RSU) can simultaneously verify plenty of received messages such that the total verification time may be sharply decreased. Furthermore, the security analysis indicates that the proposed scheme is provably secure in the random oracle model and fulfills all the requirements on security and privacy. To further improve efficiency, both map-to-point hash operation and bilinear pairing operation are not employed. Compared with previous CCPPA schemes, the proposed scheme prominently cuts down computation delay of message signing and verification by 66.9%–85.5% and 91.8%–93.4%, respectively, and reduces communication cost by 44.4%. Extensive simulations show that the proposed scheme is practicable and achieves prominent performances of very little average message delay and average message loss ratio and thus is appropriate for realistic applications.
ISSN:1574-017X
1875-905X
DOI:10.1155/2019/7593138