MétaCan
Menu
Back to cohort
Record W1972304416 · doi:10.1109/ccece.2014.6901143

Authentication mechanism for mobile RFID based Smart grid network

2014· article· en· W1972304416 on OpenAlex

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.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRFID technology advancements
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceAuthentication protocolAuthentication (law)Computer networkMutual authenticationHash functionRadio-frequency identificationElliptic curve cryptographyCryptographyEmbedded systemComputer securityPublic-key cryptographyEncryption

Abstract

fetched live from OpenAlex

Smart grid networks include various communication technologies, among which, RFID (Radio Frequency Identification) is considered as an enabling technology for realizing the ubiquitous environment by providing identity to an essential object. We have proposed a comprehensive mutual authentication protocol for a mobile RFID based Smart grid network, which is lightweight and efficient. In the proposed mechanism, only simple cryptographic operations (i.e. one-way hash function, XOR operation) are used in RFID tag, while other techniques including elliptic curve cryptography (ECC) and zero knowledge protocol are used in mobile reader and backend server. We have deployed a conjoined verification technique to minimize authentication cost in such a network. We illustrate that the proposed mechanism can better performance than the existing representative schemes.

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: Methods · Consensus signal: none
Teacher disagreement score0.903
Threshold uncertainty score0.361

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.000
Open science0.0000.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.005
GPT teacher head0.206
Teacher spread0.201 · 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

Citations9
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicRFID technology advancementsFrench-language works237,207