PA-CRT: Chinese Remainder Theorem Based Conditional Privacy-Preserving Authentication Scheme in Vehicular Ad-Hoc Networks

Abstract

Existing security and identity-based vehicular communication protocols used in Vehicular Ad-hoc Networks (VANETs) to achieve conditional privacy-preserving mostly rely on an ideal hardware device called tamper-proof device (TPD) equipped in vehicles. Achieving fast authentication during the message verification process is usually challenging in such strategies and further they suffer performance constraints from resulting overheads. To address such challenges, this paper proposes a novel Chinese remainder theorem (CRT)-based conditional privacy-preserving authentication scheme for securing vehicular authentication. The proposed protocol only requires realistic TPDs, and eliminates the need for pre-loading the master key onto the vehicle's TPDs. Chinese remainder theorem can dynamically assist the trusted authorities (TAs) whilst generating and broadcasting new group keys to the vehicles in the network. The proposed scheme solves the leakage problem during side channel attacks, and ensures higher level of security for the entire system. In addition, the proposed scheme avoids using the bilinear pairing operation and map-to-point hash operation during the authentication process, which helps achieving faster verification even under increasing number of signature. Moreover, the security analysis shows that our proposed scheme is secure under the random oracle model and the performance analysis shows that our proposed scheme is efficient in reducing computation and communication overheads.

LSWBVM: A Lightweight Security Without Using Batch Verification Method Scheme for a Vehicle Ad Hoc Network

“…Therefore, to hide the real identity of the vehicle, the vehicle could sign messages by using unrelated pseudonyms. In 2019, Zhang et al [27] designed a Chinese remainder theorem (CRT) for communication security in VANET, therefore, proposed a conditional privacy-preserving authentication scheme which only needs realistic TPDs, and removes the requirement for preloading the private key on to the vehicle's TPDs. In 2020, Ali et al [28] suggested an ID-based scheme using ECC and general one-way hash functions.…”

A weight-based conditional privacy-preserving authentication scheme in software-defined vehicular network

“…Cui et al [37] designed an authentication protocol for 5G-enabled vehicular networks in which TA is in charge of the reputation management to filter vehicles with a reputation score below a given threshold, which reduces the existence of untrusted messages in VANETs. Zhang et al [38] proposed a novel Chinese remainder theorem based conditional privacy-preserving authentication scheme to secure vehicular authentication. This scheme solved the leakage problem during side channel attacks and ensured security for the entire system.…”

An improved EAAP scheme for vehicular ad hoc networks

“…Through the contents of Table , we make a concrete analysis of each scheme . In TAA scheme, it takes 12 T exp ≈ 7.2 ms to sign a message, 10 T par +4 T exp ≈ 18.4 ms to authenticate a message, and ( n +6) T par +(9 n +1) T exp ≈ (7 n +10.2) ms to authenticate n messages.…”

“…Through the contents of Table 4, we make a concrete analysis of each scheme. 35,36 In TAA scheme, it takes 12T exp ≈ 7.2 ms to sign a message, 10T par +4T exp ≈ 18.4 ms to authenticate a message, and (n+6)T par +(9n+1)T exp ≈ (7n +10.2) ms to authenticate n messages. In SPRING scheme, it takes 4T exp ≈ 2.4 ms to sign a message, 3T par +9T exp ≈ 10.2 ms to authenticate a message, and (3n)T par +(9n)T exp ≈ (10.2n) ms to authenticate n messages.…”