Decentralized Edge Collaboration for Seamless Handover Authentication in Zero-Trust IoV
Bibliographic record
Abstract
Given the frequently changing and potentially unreliable environment, the seamless handover authentication is essential to achieve zero-trust Internet of Vehicles (IoV) network with dramatically enhanced communication and transportation safety. The traditional centralized handover authentication schemes may suffer from the excessive latency and situation agnostic limitation, leading to potential interruption of critical services for fast moving vehicles. To overcome the above challenges, this paper proposes a novel decentralized edge collaboration-based handover authentication scheme with the assistance of blockchain for providing continuous protections in zero-trust IoV. A distributed learning process is designed by involving multiple authentication cooperators (ACs) to collect device/location-related features of vehicles at network edge and then to verify their identities. During the movement of vehicles, the access point (AP) could select new ACs by transferring the security information from existing ACs to the new members for seamless handover authentication. A situation-aware AC selection and update algorithm is proposed for maximizing handover authentication accuracy. Moreover, a hierarchical blockchain-assisted security information transfer and reputation management mechanism is designed for reliable collaboration and efficient management in zero-trust IoV. Compared with the existing schemes, our results characterize the outperformance of the proposed scheme in authentication accuracy and time cost of handover.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.001 | 0.001 |
| 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".