IBRS: An Efficient Identity-based Batch Verification Scheme for VANETs Based on Ring Signature

Feng Liu, Qi Wang

Abstract

Vehicular ad-hoc networks (VANETs) are one of the most important components in an Intelligent Transportation System (ITS), which aims to provide information communication between vehicles. A safety-critical vehicular communication requires security, privacy, auditability, and efficiency. To satisfy these requirements simultaneously, several conditional privacy-preserving authentication schemes are proposed by employing ring signature. However, these methods have been paid too little attention to the issues like how to choose the valid ring members or how to set up a ring. In this paper, we introduce an efficient conditional privacy-preserving scheme which provides an appropriate approach establishing the list of ring members. Moreover, our proposed scheme also supports batch verification to significantly reduce the computational cost. According to the analysis of security, our scheme is sufficiently resistant against several common attacks in VANETs. The performance results show that the proposed scheme is efficient and practical with both low computation and communication cost.

Introduction

Vehicular Ad-hoc Networks (VANETs) are foundational to Intelligent Transportation Systems (ITS), enabling real-time communication for traffic safety and efficiency. However, deploying VANETs at scale introduces a security trilemma: ensuring message authenticity, protecting driver privacy from eavesdropping, and maintaining auditability for law enforcement.

Traditional Public Key Infrastructure (PKI) and pseudonym schemes often struggle with high overhead or lack of true anonymity. Ring signatures offer a promising mechanism for conditional privacy by hiding a sender's identity within a group of public keys. However, existing implementations often suffer from "poisoned rings"—where malicious nodes inject invalid keys to disrupt verification—and high computational costs when verifying hundreds of messages per second in dense traffic.

The IBRS Scheme

The proposed Identity-based Batch Verification Scheme (IBRS) addresses these challenges through a coordinated architecture involving vehicles (OBUs), Road-Side Units (RSUs), a Transportation Regulation Center (TRC), and a Law Enforcement Authority (LEA).

System workflow of the IBRS scheme illustrating initialization, ring distribution, signing, and tracing.

Key architectural shifts in IBRS include:

  • RSU-Managed Ring Lists: To prevent malicious nodes from disrupting the network, vehicles request verified "ring lists" from local RSUs. The RSU filters these lists against a revocation list, ensuring all ring members are legitimate and eliminating the poisoned ring problem.
  • Identity-Based Cryptography (IBC): By deriving public keys directly from pseudonyms, IBRS eliminates the need for bulky certificate attachments, significantly reducing communication overhead.
  • Built-in Traceability: While providing anonymity to peers, the scheme allows the LEA to extract the true identity of a signer using a private tracing key in cases of malicious activity, ensuring auditability.

Verification and Performance

A critical bottleneck in VANETs is the On-Board Unit's ability to verify incoming messages in real-time. IBRS implements a batch verification mode using asymmetric bilinear pairings (Type 3 on the MNT159 curve). This mathematical choice allows for shorter group elements and enables the OBU to verify multiple signatures simultaneously, making the computational cost scale sub-linearly.

The mathematical algorithms for single and batch verification in the IBRS scheme.

Experimental results using a Raspberry Pi 3b+ simulation demonstrate the efficiency of IBRS. A single pseudonym requires only 30 bytes, and a signature requires 90 bytes—a significant reduction compared to competing schemes. For a ring size of 2, signing takes approximately 127ms. When batch verification is applied, the time required to verify multiple messages drops dramatically compared to sequential verification, proving the scheme can handle high-density traffic scenarios.

Conclusion and Future Work

IBRS provides a practical balance of privacy, security, and efficiency for modern VANETs. By centralizing ring member distribution at the RSU level and optimizing verification through batching, the scheme overcomes the primary hurdles of previous ring signature implementations. Future research will focus on improving the isolation of invalid signatures within a failed batch and exploring the implementation of Hardware Security Modules (HSMs) within real-world Trusted Execution Environments like ARM TrustZone.

Summary updated

Abstract

Vehicular ad-hoc networks (VANETs) are one of the most important components in an Intelligent Transportation System (ITS), which aims to provide information communication between vehicles. A safety-critical vehicular communication requires security, privacy, auditability, and efficiency. To satisfy these requirements simultaneously, several conditional privacy-preserving authentication schemes are proposed by employing ring signature. However, these methods have been paid too little attention to the issues like \textit{how to choose the valid ring members} or \textit{how to set up a ring}. In this paper, we introduce an efficient conditional privacy-preserving scheme which provides an appropriate approach establishing the list of ring members. Moreover, our proposed scheme also supports batch verification to significantly reduce the computational cost. According to the analysis of security, our scheme is sufficiently resistant against several common attacks in VANETs. The performance results show that the proposed scheme is efficient and practical with both low computation and communication cost.
BibTeX
@inproceedings{liu2019ibrs,
  author = {Feng Liu and Qi Wang},
  title = {{IBRS: An Efficient Identity-based Batch Verification Scheme for VANETs Based on Ring Signature}},
  booktitle = {VNC},
  year = {2019},
  url = {https://openreview.net/forum?id=th_bJwCHWo},
}
Figure