MétaCan
Menu
Back to cohort
Record W1970324375 · doi:10.1109/iscc.2013.6754930

An improved authentication scheme for applying RFID in VANETs

2013· article· en· W1970324375 on OpenAlex
Qingwei Zhang, Mohammed Almulla, Azzedine Boukerche

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicUser Authentication and Security Systems
Canadian institutionsUniversity of Ottawa
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceAuthentication (law)Revocation listScheme (mathematics)Radio-frequency identificationComputer securityCertificateDigital signatureKey (lock)RevocationIdentification (biology)Public key certificateCluster analysisComputer networkPublic-key cryptographyHash functionEncryptionOverhead (engineering)

Abstract

fetched live from OpenAlex

This paper presents an improved authentication scheme for Radio-frequency identification (RFID) applied in VANETs. As often being considered as a precondition for the realization of IoT, RFID can be utilized in the vehicles, so as to make the vehicles identifiable and inventoriable by computers as long as they are fitted out with radio tags. One of the main concerns is to address the large number of security and privacy issues. A few light symmetric key management schemes have been proposed for RFID scenarios. We suggest EKA2 which is a new certificate revocation status validation scheme, and we use the concept of clustering from data mining to evaluate the trustiness of digital certificates.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.985
Threshold uncertainty score0.270

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.016
GPT teacher head0.267
Teacher spread0.251 · 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

Quick stats

Citations1
Published2013
Admission routes2
Has abstractyes

Explore more

Same topicUser Authentication and Security SystemsFrench-language works237,207