Efficient Conditional Privacy Preservation With Mutual Authentication in Vehicular Ad Hoc Networks

被引:28
作者
Al-Shareeda, Mahmood A. [1 ]
Anbar, Mohammed [1 ]
Hasbullah, Iznan Husainy [1 ]
Manickam, Selvakumar [1 ]
Hanshi, Sabri M. [2 ]
机构
[1] Univ Sains Malaysia USM, Natl Adv IPv6 Ctr NAv6, Gelugor 11800, Malaysia
[2] Seiyun Community Coll, Comp Informat Syst, Seiyun, Yemen
关键词
Privacy; Authentication; Vehicular ad hoc networks; Public key; Road accidents; Elliptic curves; Vehicular ad-hoc network (VANET); privacy-preserving; elliptic curve; random oracle model; identity-based cryptography; domain public key; VANETS; SCHEME; ANONYMITY; SECURE;
D O I
10.1109/ACCESS.2020.3014678
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Vehicle Ad hoc Networks (VANETs) are an emergent wireless communication technology that has the potential to reduce the risk of accidents caused by drivers and provide a wide range of entertainment facilities. Because of the nature of VANETs' open-access environment, security attacks can affect the messages broadcast by a vehicle. VANET is therefore vulnerable to security and privacy issues. Recently, many schemes for addressing these problems of VANET have been proposed. However, most of them are affected by massive computation overhead and security issues. In this paper, we propose a scheme named efficient conditional privacy preservation with mutual authentication to address the problems mentioned above in VANET. This scheme depends on the division of geographical areas into a number domains and their distribution, where each domain stores the Certificate Revocation List (CRL) in all Road-side Units (RSUs) located inside the domain. During the mutual authentication phase, the vehicle should authenticate with the TA. After the vehicle obtains a pool of pseudo-identities and the corresponding secret keys from RSU, it is allowed to transmit a message to the other components in the VANET. Because our scheme does not use the bilinear pairing, the performance evaluation shows that our scheme has a lower system cost in terms of computation and communication than other existing methods. Meanwhile, the proposed scheme reduces the computation costs of signing the message and verifying the message by 99.85% and 99.93%, respectively. While the proposed scheme reduces the communication costs of the message size by 13.3%.
引用
收藏
页码:144957 / 144968
页数:12
相关论文
共 27 条
[1]  
Al Shareeda M, 2019, INT ARAB J INF TECHN, V16, P540
[2]   Efficient Conditional Anonymity With Message Integrity and Authentication in a Vehicular Ad-Hoc Network [J].
Alazzawi, Murtadha A. ;
Lu, Hongwei ;
Yassin, Ali A. ;
Chen, Kai .
IEEE ACCESS, 2019, 7 :71424-71435
[3]   Authentication and privacy schemes for vehicular ad hoc networks (VANETs): A survey [J].
Ali, Ikram ;
Hassan, Alzubair ;
Li, Fagen .
VEHICULAR COMMUNICATIONS, 2019, 16 :45-61
[4]  
[Anonymous], 2018, DECIBEL
[5]  
[Anonymous], 2018, INT ARAB CONF INF TE
[6]  
[Anonymous], 2009, MOB P 7 ACM INT C
[7]   NERA: A new and efficient RSU based authentication scheme for VANETs [J].
Bayat, Majid ;
Pournaghi, Morteza ;
Rahimi, Majid ;
Barmshoory, Mostafa .
WIRELESS NETWORKS, 2020, 26 (05) :3083-3098
[8]   A secure authentication scheme for VANETs with batch verification [J].
Bayat, Majid ;
Barmshoory, Mostafa ;
Rahimi, Majid ;
Aref, Mohammd Reza .
WIRELESS NETWORKS, 2015, 21 (05) :1733-1743
[9]  
Biswas S, 2010, AD HOC SENS WIREL NE, V10, P177
[10]   Edge Computing in VANETs-An Efficient and Privacy-Preserving Cooperative Downloading Scheme [J].
Cui, Jie ;
Wei, Lu ;
Zhong, Hong ;
Zhang, Jing ;
Xu, Yan ;
Liu, Lu .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2020, 38 (06) :1191-1204