Abstract
Security and privacy must be taken into account for vehicular ad-hoc
networks (VANETs) due to the fact that broadcasting occurs through an open
communication channel. This work offers a Lightweight Verification with
Privacy-Preserving Authentication (LV2PA) approach for vehicular
communications to overcome these challenges. To satisfy security and privacy
requirements, the proposed LV2PA approach employs not only the
cryptographic hash function, but also a Bloom filter and the Chinese
remainder theorem. During the mutual authentication of the LV2PA scheme, only the first roadside unit (RSU) and on-board unit are required to
communicate with a trusted authority (TA) due to the changeover use, however the other RSUs in vehicular communications do not require TA
communication. Consequently, bottleneck problems for the TA are avoided. In addition, the RSU updates the shared group key whenever a vehicle joins or
departs the group; hence, the proposed LV2PA provides complete forward
secrecy and backward secrecy for vehicular communications. The formal
(Burrows–Abadi–Needham (BAN) logic) and informal security analyses
demonstrate that the proposed LV2PA scheme is legitimate and meets the
security and privacy requirements, respectively. In terms of computing and
communication expenses, the performance evaluation of the proposed LV2PA
scheme has advantageously low overhead and low latency compared to state- of-the-art schemes
networks (VANETs) due to the fact that broadcasting occurs through an open
communication channel. This work offers a Lightweight Verification with
Privacy-Preserving Authentication (LV2PA) approach for vehicular
communications to overcome these challenges. To satisfy security and privacy
requirements, the proposed LV2PA approach employs not only the
cryptographic hash function, but also a Bloom filter and the Chinese
remainder theorem. During the mutual authentication of the LV2PA scheme, only the first roadside unit (RSU) and on-board unit are required to
communicate with a trusted authority (TA) due to the changeover use, however the other RSUs in vehicular communications do not require TA
communication. Consequently, bottleneck problems for the TA are avoided. In addition, the RSU updates the shared group key whenever a vehicle joins or
departs the group; hence, the proposed LV2PA provides complete forward
secrecy and backward secrecy for vehicular communications. The formal
(Burrows–Abadi–Needham (BAN) logic) and informal security analyses
demonstrate that the proposed LV2PA scheme is legitimate and meets the
security and privacy requirements, respectively. In terms of computing and
communication expenses, the performance evaluation of the proposed LV2PA
scheme has advantageously low overhead and low latency compared to state- of-the-art schemes
Keywords
Bloom Filter
Chinese remainder theorem (CRT)
mutual Authentication
Vehicular adhoc network (VANET)