A Traceable Concurrent Data Anonymous Transmission Scheme for Heterogeneous VANETs

Jingwei Liu, Qin Hu, Chaoya Li, Rong Sun, Xiaojiang Du, Mohsen Guizani

Abstract

This paper presents a novel security protocol for Vehicular Ad Hoc Networks (VANETs) that balances data anonymity with traceability. By employing a pairing-free certificateless aggregate signcryption scheme based on multi-trapdoor hash functions, the proposed method significantly reduces computational overhead. Experimental results demonstrate that the scheme enables efficient real-time batch verification in dense traffic scenarios, outperforming existing cryptographic models in terms of verification and decryption latency.

Introduction

As smart cities evolve, Vehicular Ad Hoc Networks (VANETs) are becoming integral to traffic management and safety. However, two primary challenges hinder their widespread adoption: the conflict between user privacy and legal accountability, and the computational bottlenecks caused by high-density traffic. Drivers require anonymity to prevent unauthorized tracking, yet authorities must be able to identify malicious actors in the event of an accident or dispute. Furthermore, traditional cryptographic methods, particularly those involving bilinear pairings, impose significant latency on Roadside Units (RSUs) during real-time message verification.

Proposed Methodology

The authors propose a Traceable Concurrent Data Anonymous Transmission Scheme designed to address these challenges. The architecture, illustrated in Figure 1, involves several key entities: a Key Management Center (KMC), a Trace Authority (TRA), Roadside Units (RSUs), and Vehicles equipped with On-Board Units (OBUs).

Figure 1: Architecture of the proposed traceable anonymous transmission scheme showing interactions between the KMC, RSU, Vehicles, and Trace Authority.

The scheme leverages three core innovations:

  • Certificateless Aggregate Signcryption: This approach eliminates the overhead of certificate management while avoiding the "key escrow" problem inherent in identity-based cryptography.
  • Multi-trapdoor Hash Functions: By utilizing these functions, the protocol avoids computationally expensive bilinear pairings, relying instead on efficient elliptic curve scalar multiplications.
  • Conditional Anonymity: Vehicles utilize pseudo-identities (pseudo-IDs) for general communication. While these IDs ensure anonymity to the public, the TRA can map them back to real identities using specific trapdoor information when necessary.

Performance Evaluation

The protocol was evaluated through cryptographic simulations using the Java Pairing Based Cryptography (JPBC) library on an Intel G640 processor. Performance was benchmarked against established schemes by Kar, Eslami, Han, and Basudan.

A critical metric is the verification overhead at the RSU, especially in dense traffic. As shown in Figure 2, the proposed scheme's verification time remains nearly constant as the number of vehicles increases, significantly outperforming existing methods that exhibit steep linear growth in overhead.

Figure 2: Comparison of time overhead on verification as the number of vehicles increases, highlighting the efficiency of the proposed scheme.

Additionally, the signcryption time for individual vehicles is approximately 65ms, ensuring low latency for data transmission. By allowing RSUs to verify batches of messages simultaneously before decryption, the system effectively manages high-intensity traffic without compromising security.

Conclusion

The proposed scheme offers a robust solution for secure, anonymous, and traceable communication in VANETs. By removing the dependency on bilinear pairings, it achieves superior scalability for real-time batch verification. Future work will explore the protocol's performance in purely ad-hoc V2V environments and its resilience against fully malicious central authorities.

Summary updated

BibTeX
@inproceedings{liu2018traceable,
  author = {Jingwei Liu and Qin Hu and Chaoya Li and Rong Sun and Xiaojiang Du and Mohsen Guizani},
  title = {{A Traceable Concurrent Data Anonymous Transmission Scheme for Heterogeneous VANETs}},
  booktitle = {GLOBECOM},
  year = {2018},
  doi = {10.1109/glocom.2018.8647327},
}
Figure