A gateway-optimized certificateless authentication scheme with dynamic anonymity for resource-asymmetric smart environments

• Reasonable allocation of system resources to avoid threats from malicious gateways. • One-time password method based on hash chains to realize full dynamic anonymity. • Fuzzy extractor to enable two-factor authentication including user biometrics. • Dynamic update of authentication employs random numbers rather than timestamps. The rapid evolution of Internet of Things (IoT) demands secure and lightweight authentication schemes for resource-asymmetric environments, where gateways are powerful but user and device sides are constrained. Existing authentication and key agreement (AKA) protocols often fail to provide dynamic anonymity, resist malicious gateways, and support low-entropy passwords. To address these limitations, we propose a certificateless AKA scheme that combines a one-time password algorithm based on hash chains (HOTP) with fuzzy extractors for multi-factor authentication. The scheme ensures full dynamic anonymity, resists replay and impersonation attacks, and eliminates reliance on time synchronization. We formally verify its security using ProVerif and provide informal analysis. Performance comparisons demonstrate that the proposed scheme significantly reduces computational overhead while enhancing security, outperforming existing methods. These results confirm its suitability for secure, scalable IoT applications.

Institutions

Publication Details

Journal
Computer Networks
Published
2025-12-19
DOI
https://doi.org/10.1016/j.comnet.2025.111953
Primary Topic
Advanced Authentication Protocols Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A gateway-optimized certificateless authentication scheme with dynamic anonymity for resource-asymmetric smart environments

Computer Networks
Advanced Authentication Protocols Security
article

A gateway-optimized certificateless authentication scheme with dynamic anonymity for resource-asymmetric smart environments

article en

Abstract

• Reasonable allocation of system resources to avoid threats from malicious gateways. • One-time password method based on hash chains to realize full dynamic anonymity. • Fuzzy extractor to enable two-factor authentication including user biometrics. • Dynamic update of authentication employs random numbers rather than timestamps. The rapid evolution of Internet of Things (IoT) demands secure and lightweight authentication schemes for resource-asymmetric environments, where gateways are powerful but user and device sides are constrained. Existing authentication and key agreement (AKA) protocols often fail to provide dynamic anonymity, resist malicious gateways, and support low-entropy passwords. To address these limitations, we propose a certificateless AKA scheme that combines a one-time password algorithm based on hash chains (HOTP) with fuzzy extractors for multi-factor authentication. The scheme ensures full dynamic anonymity, resists replay and impersonation attacks, and eliminates reliance on time synchronization. We formally verify its security using ProVerif and provide informal analysis. Performance comparisons demonstrate that the proposed scheme significantly reduces computational overhead while enhancing security, outperforming existing methods. These results confirm its suitability for secure, scalable IoT applications.

Computer NetworksVol. 275
Hebei University (CN)
Openalex Percentile: Top 36%
Advanced Authentication Protocols Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.