Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Privacy-Preserving and Simultaneous Authentication in High-Density V2X Networks

Morteza Azmoudeh Afshar, Nesrine Benchoubane, Busra Cayoren, Gunes Karabulut Kurt, Enver Ozdemir

TL;DR

This work tackles secure, scalable authentication in high-density V2X/IoV by introducing a decentralized batch+group authentication scheme that eliminates reliance on a central authority. It leverages a polynomial-based secret distribution $f(x)=ax+b$ over $\mathbb{F}_p$ and elliptic-curve operations to enable simultaneous mutual authentication among $k$ vehicles, yielding a shared secret $T=f(0)P$ for confidential communications and forward secrecy. The approach achieves low authentication and verification times (average $10.61\,\text{ms}$ and $1.78\,\text{ms}$ for a 100-vehicle cluster) and scales to at least 500 vehicles, outperforming RSA and CPPA baselines by significant margins. Its applicability to Cellular V2X (PC5 and Uu) with 3GPP-compatible latency demonstrates practical impact for V2X security, privacy, and efficiency, while future work will address misbehavior-aware extensions and dynamic rekeying to adapt to evolving mobility patterns.

Abstract

The rapid expansion of Vehicle-to-Everything (V2X) networks within the Internet of Vehicles (IoV) demands secure and efficient authentication to support high-speed, high-density and mobility-challenged environments. This paper presents a privacy-preserving authentication scheme that incorporates batch authentication, mutual authentication, and secure key establishment, enabling users to authenticate one another without a central authority. Our proposed scheme facilitates simultaneous multi-user authentication, significantly enhancing scalability, robustness and security in dynamic IoV networks. Results from realistic implementations show that our method achieves average authentication and verification times of 10.61 ms and 1.78 ms, respectively, for a fleet of 100 vehicles, outperforming existing methods. Scalability tests demonstrate efficient processing for larger groups of up to 500 vehicles, where average authentication times remain low, establishing our scheme as a robust solution for secure communication in IoV systems.

Privacy-Preserving and Simultaneous Authentication in High-Density V2X Networks

TL;DR

This work tackles secure, scalable authentication in high-density V2X/IoV by introducing a decentralized batch+group authentication scheme that eliminates reliance on a central authority. It leverages a polynomial-based secret distribution over and elliptic-curve operations to enable simultaneous mutual authentication among vehicles, yielding a shared secret for confidential communications and forward secrecy. The approach achieves low authentication and verification times (average and for a 100-vehicle cluster) and scales to at least 500 vehicles, outperforming RSA and CPPA baselines by significant margins. Its applicability to Cellular V2X (PC5 and Uu) with 3GPP-compatible latency demonstrates practical impact for V2X security, privacy, and efficiency, while future work will address misbehavior-aware extensions and dynamic rekeying to adapt to evolving mobility patterns.

Abstract

The rapid expansion of Vehicle-to-Everything (V2X) networks within the Internet of Vehicles (IoV) demands secure and efficient authentication to support high-speed, high-density and mobility-challenged environments. This paper presents a privacy-preserving authentication scheme that incorporates batch authentication, mutual authentication, and secure key establishment, enabling users to authenticate one another without a central authority. Our proposed scheme facilitates simultaneous multi-user authentication, significantly enhancing scalability, robustness and security in dynamic IoV networks. Results from realistic implementations show that our method achieves average authentication and verification times of 10.61 ms and 1.78 ms, respectively, for a fleet of 100 vehicles, outperforming existing methods. Scalability tests demonstrate efficient processing for larger groups of up to 500 vehicles, where average authentication times remain low, establishing our scheme as a robust solution for secure communication in IoV systems.
Paper Structure (15 sections, 4 theorems, 7 equations, 4 figures, 3 tables, 2 algorithms)

This paper contains 15 sections, 4 theorems, 7 equations, 4 figures, 3 tables, 2 algorithms.

Table of Contents

  1. Introduction
  2. Related Work
  3. Batch authentication
  4. Group authentication
  5. Comparison of Existing Schemes
  6. Proposed Authentication Scheme
  7. Setup Phase (Initial Registration)
  8. Mutual Authentication Phase
  9. Confidential Communication Phase
  10. Failure Handling
  11. Security Analysis
  12. Performance Analysis
  13. Applicability in Cellular V2X Communications
  14. Analytical evaluation using 3GPP metrics
  15. Conclusion and Future Work

Key Result

Proposition 1

If at least one participant sends an incorrect $C_i$, the authentication fails.

Figures (4)

  • Figure 1: Calculations of total computation, verification, and authentication times per vehicle group.
  • Figure 2: Calculations of average computation, verification, and authentication times per vehicle group.
  • Figure 3: Comparison of total mutual verification times.
  • Figure 4: Comparison of total authentication times.

Theorems & Definitions (11)

  • Proposition 1
  • proof
  • Remark 1
  • Proposition 2
  • proof
  • Proposition 3
  • proof
  • Proposition 4
  • proof
  • Remark 2
  • ...and 1 more