MétaCan
Menu
Back to cohort
Record W4225654141 · doi:10.1109/tii.2022.3158663

LAS-SG: An Elliptic Curve-Based Lightweight Authentication Scheme for Smart Grid Environments

2022· article· en· W4225654141 on OpenAlexaff
Shehzad Ashraf Chaudhry, Khalid Yahya, Sahil Garg, Georges Kaddoum, Mohammad Mehedi Hassan, Yousaf Bin Zikria

Bibliographic record

VenueIEEE Transactions on Industrial Informatics · 2022
Typearticle
Languageen
FieldComputer Science
TopicCryptographic Implementations and Security
Canadian institutionsÉcole de Technologie Supérieure
FundersKing Saud University
KeywordsAuthentication (law)CryptographySmart gridElliptic curve cryptographyComputer scienceScheme (mathematics)Elliptic curvePublic-key cryptographyTraceabilityComputer securityComputer networkMathematicsEngineeringEncryptionElectrical engineeringPure mathematics

Abstract

fetched live from OpenAlex

The communication among smart meters (SMs) and neighborhood area network (NAN) gateways is a fundamental requisite for managing the energy consumption at the consumer site. The bidirectional communication among SMs and NANs over the insecure public channel is vulnerable to impersonation, SM traceability, and SM physical capturing attacks. Many existing schemes’ insecurities and/or inefficiencies call for an efficient and secure authentication scheme for smart grid infrastructure. In this article, we present a privacy preserving and lightweight authentication scheme for smart grid (LAS-SG) using elliptic curve cryptography. The proposedLAS-SGis proved as secure under the standard model. Moreover, the efficiency of the LAS-SG is extracted through a real-time experiment, which attests that proposedLAS-SGcompletes a round of authentication in 20.331 ms by exchanging only two messages and 192 B. Due to the adequate efficiency and ample security, the proposedLAS-SGis more appropriate for SG environments.

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.001
metaresearch head score (Gemma)0.001
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: Methods · Consensus signal: Methods
Teacher disagreement score0.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

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

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.059
GPT teacher head0.278
Teacher spread0.219 · 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
GenreMethods

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

Citations91
Published2022
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Industrial InformaticsSame topicCryptographic Implementations and SecurityFrench-language works237,207