A Safe and Efficient Identity Authentication Protocol Based on Chebyshev Polynomials

Medical applications are increasingly utilizing wireless sensor networks due to their significance. Telehealth information systems require a complete and appropriate security mechanism, as any illegal misuse of relevant data can have serious consequences. At the same time, medical sensor resources are limited, so we need to design a secure and efficient lightweight medical identity authentication protocol. In 2024, Khushil Kumar Saini et al. proposed an authentication protocol that uses a discrete logarithmic problem on an elliptic curve, but due to its high overhead, we propose a medical identity authentication protocol using Chebyshev polynomial, which has lower computational overhead and communication overhead than discrete logarithmic problems. Finally, the ROR model is used to demonstrate security and the overhead is compared with other relevant protocols.

Authors

Institutions

Publication Details

Published
2025-04-28
DOI
https://doi.org/10.1109/icaidt66272.2025.00014
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 Safe and Efficient Identity Authentication Protocol Based on Chebyshev Polynomials

Weidong Wang, Fengtong Wen
Advanced Authentication Protocols Security
article

A Safe and Efficient Identity Authentication Protocol Based on Chebyshev Polynomials

Weidong Wang, Fengtong Wen
article en

Abstract

Medical applications are increasingly utilizing wireless sensor networks due to their significance. Telehealth information systems require a complete and appropriate security mechanism, as any illegal misuse of relevant data can have serious consequences. At the same time, medical sensor resources are limited, so we need to design a secure and efficient lightweight medical identity authentication protocol. In 2024, Khushil Kumar Saini et al. proposed an authentication protocol that uses a discrete logarithmic problem on an elliptic curve, but due to its high overhead, we propose a medical identity authentication protocol using Chebyshev polynomial, which has lower computational overhead and communication overhead than discrete logarithmic problems. Finally, the ROR model is used to demonstrate security and the overhead is compared with other relevant protocols.

University of Jinan (CN)
Openalex Percentile: Top 73%
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.

A Safe and Efficient Identity Authentication Protocol Based on Chebyshev Polynomials — Weidong Wang, Fengtong Wen · (2025) | TGRS Research Map | TGRS