MétaCan
Menu
Back to cohort
Record W4210827399 · doi:10.1109/tits.2022.3147354

Efficient and Anonymous Authentication With Succinct Multi-Subscription Credential in SAGVN

2022· article· en· W4210827399 on OpenAlexafffund
Dongxiao Liu, Huaqing Wu, Jianbing Ni, Xuemin Shen

Bibliographic record

VenueIEEE Transactions on Intelligent Transportation Systems · 2022
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Authentication Protocols Security
Canadian institutionsQueen's UniversityMcMaster UniversityUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsCredentialComputer scienceAuthentication (law)Computer securityComputer networkAnonymityService (business)Key (lock)Message authentication codeCryptography

Abstract

fetched live from OpenAlex

In this paper, we propose an efficient and anonymous authentication protocol with a succinct multi-subscription credential (AnMsc) in Space-air-ground integrated vehicular networks (SAGVN). First, we adopt a subscription-based service model in SAGVN. Specifically, vehicular users (VEs) can subscribe to network services and conduct direct mutual authentication with subscribed access points (APs) to avoid message exchanges with VEs’ home network. Early application data can also be transmitted with authentication messages to improve communication efficiency. Second, we carefully tailor the design of the redactable signature and propose an efficient credential management mechanism in SAGVN. Multiple service subscriptions can be embedded into a succinct (constant-size) credential. With the credential, VEs can anonymously access any subscribed AP without revealing other subscription information. Thorough security analysis and comprehensive performance evaluation demonstrate that AnMsc can guarantee key-exchange security, VE anonymity, and service fairness while ensuring credential management and authentication efficiency.

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 imitation

Not 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.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.007
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.006
Open science0.0020.005
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0010.001

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.

Opus teacher head0.023
GPT teacher head0.260
Teacher spread0.237 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations15
Published2022
Admission routes2
Has abstractyes

Explore more

Same venueIEEE Transactions on Intelligent Transportation SystemsSame topicAdvanced Authentication Protocols SecurityFrench-language works237,207