Towards Synchronized Privacy-Preserving Authentication for MDTEN-Driven VANETs
Bibliographic record
Abstract
Digital Twin (DT) technology, by performing simulation, analysis, and prediction over the data mapped to digital space, can create a digital replica of the physical object. It can be combined with edge computing or cloud computing to provide broad vehicle-to-everything applications and improve the service quality of vehicular ad-hoc networks (VANETs). In this article, DT technology and mobile edge computing are integrated into VANETs to introduce a framework of mobile digital twin edge network-driven VANETs (MDTEN-Driven VANETs). Moreover, facing the security and privacy challenges in the framework, we propose a synchronized privacy-preserving authentication (SPPA) scheme. In SPPA, we first design a synchronized anonymous certificateless aggregate signature (SA-CLAS) to achieve the authentication with time state synchronization and the privacy preservation of the real identity. Furthermore, to deal with malicious vehicles, we adopt blockchain technology and devise a smart contract algorithm to manage the public information of vehicles. The security analysis demonstrates that SA-CLAS is existentially unforgeable under adaptive chosen message attacks, and SPPA can satisfy the necessary security requirements. The performance evaluation shows the efficiency and practicality of SA-CLAS and SPPA. Besides, the designed smart contract is implemented in an Ethereum test network, which presents an acceptable blockchain consumption.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.001 | 0.005 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".