Privacy-Preserving Authentication Using a Double Pseudonym for Internet of Vehicles

Lu Liu, Jie Cui, Wenyu Xu, Hong Zhong, Jing Zhang, Yan Xu, Lu Liu 0001Sensors 2018 · DOI

TL;DR

This paper introduces a novel privacy-preserving authentication scheme for the Internet of Vehicles (IoV) that uses a double pseudonym approach and dynamic updates to enhance security and reduce computational overhead. By avoiding bilinear pairing and implementing dynamic updates of sensitive information, the scheme offers improved efficiency and resistance to side-channel attacks, making it more practical for real-world IoV applications.

What Problem Does This Paper Address?

The Internet of Vehicles (IoV) aims to improve road safety and traffic management through inter-vehicle and vehicle-to-infrastructure communication. A critical challenge in IoV is ensuring the integrity and authenticity of messages while preserving the privacy of vehicle identities. Existing authentication schemes often suffer from high computational and communication overhead, and some are vulnerable to attacks like replay attacks, impersonation, and side-channel attacks that can compromise sensitive data stored in tamper-proof devices. This paper addresses the need for an efficient, secure, and privacy-preserving authentication mechanism that can effectively protect against these threats in the dynamic IoV environment.

Methods

The proposed scheme introduces a "double pseudonym" method to mask a vehicle's real identity. It also incorporates a dynamic update mechanism for sensitive information stored in the tamper-proof device (TPD), such as member secrets and authentication keys. This dynamic updating prevents attackers from exploiting side-channel information leaks over time. Key technical contributions include:

  • Double Pseudonym: Vehicles use two layers of pseudonyms to obscure their real identity, making it difficult for attackers to link messages to a specific vehicle.
  • Dynamic Information Update: Critical data within the TPD is periodically updated. This makes it harder for attackers to gather persistent side-channel information that could lead to identity compromise.
  • No Bilinear Pairing: The scheme avoids computationally expensive bilinear pairing operations, significantly reducing computation and communication overhead. This is a key factor in its improved performance.
  • Batch Verification: The scheme supports batch verification of multiple messages, further enhancing efficiency, especially in scenarios with high message traffic.

The scheme involves several phases: System Setup, RSU Setup, Vehicle Setup, Member Key Generation, Vehicle Signature, Message Verification, and IPID and Authentication Key Update.

Datasets

Not discussed in the paper.

Key Insights and Ideas

  • Dynamic Updates are Crucial for Side-Channel Resistance: The paper highlights that even with tamper-proof devices, static sensitive information is a vulnerability. Periodically updating this information is essential for robust side-channel attack resistance.
  • Bilinear Pairing is a Bottleneck: The avoidance of bilinear pairing is a significant design choice that directly leads to the scheme's improved performance, demonstrating that efficient IoV security doesn't always require the most complex cryptographic primitives.
  • Double Pseudonym Offers Enhanced Privacy: Using two layers of pseudonyms provides a stronger privacy guarantee compared to single pseudonym schemes, making traceability more challenging for adversaries.
  • Practicality through Efficiency: The scheme's reduced computational and communication overhead makes it more practical for deployment in resource-constrained IoV environments, where vehicles and roadside units need to process many messages quickly.

Key Results

The paper demonstrates that the proposed scheme achieves:

  • Message Integrity: Verified through cryptographic proofs.
  • Non-forgery: The scheme is secure against attackers forging signatures.
  • Traceability: A trusted authority (TA) can reveal a vehicle's real identity when necessary.
  • Non-repudiation: Attackers cannot deny sending messages.
  • Resistance to Side-Channel Attacks: Due to dynamic updates of sensitive information.

Performance analysis shows that the proposed scheme has significantly lower computation and communication overhead compared to existing schemes, particularly those relying on bilinear pairing. For instance, the communication overhead for sending a single message is reduced to 80 bytes, and the computation overhead for verifying multiple messages is also substantially lower, especially as the number of messages increases.

Limitations and Future Work

  • Denial of Service (DoS) Attacks: The authors acknowledge that addressing Denial of Service (DoS) attacks during message broadcasting, especially in the context of batch verification, is a significant challenge and an urgent area for future research.
  • ECDL Problem: The security proof relies on the difficulty of solving the Elliptic Curve Discrete Logarithm (ECDL) problem, which is a standard assumption in ECC-based cryptography.

Future work will focus on developing robust solutions to mitigate DoS attacks in the IoV environment.

Summary updated

BibTeX
@article{liu2018privacy,
  author = {Lu Liu and Jie Cui and Wenyu Xu and Hong Zhong and Jing Zhang and Yan Xu and Lu Liu},
  title = {{Privacy-Preserving Authentication Using a Double Pseudonym for Internet of Vehicles}},
  journal = {Sensors},
  year = {2018},
  doi = {10.3390/s18051453},
}
Figure