ArticleSensors (Basel, Switzerland)2026
A Lightweight Identity Authentication Protocol for Vehicle Ad Hoc Network Based on PUF-Obfuscation.
Article in Sensors (Basel, Switzerland), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
Abstract
The rapid growth of Intelligent Transportation Systems (ITSs) necessitates secure and efficient Vehicle-to-Everything (V2X) communication. However, existing Physical Unclonable Function (PUF)-based schemes often suffer from modeling vulnerabilities and high overheads. This paper proposes a decentralized, dynamic, anonymous authentication protocol tailored for Vehicular Ad Hoc Networks (VANETs). By integrating Elliptic Curve Cryptography (ECC) with highly reliable Self-Adaption Deviation Locking PUFs (SDL PUFs), we design a dynamic Challenge-Response Pair (CRP) obfuscation mechanism. This mechanism effectively mitigates modeling threats, reducing the prediction success rate of machine learning (ML) and deep learning (DL) attacks by approximately 35% compared to raw SDL PUFs. The protocol ensures identity untraceability and forward secrecy through anonymous identifiers and ephemeral session keys. Security is formally verified under the Real-or-Random (ROR) model and validated using the AVISPA tool. Simulations in SUMO and Omnetpp demonstrate that the protocol is highly efficient, achieving a low computational overhead of 6.77 ms per entity and a communication cost of 192 bytes. Compared to state-of-the-art approaches, our solution provides superior robustness against advanced modeling attacks and significantly reduces latency, making it suitable for resource-constrained V2X environments.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.