Evidence map›Paper›PMID 41423502›Full record

ArticleScientific reports2025

Multi-factor authentication and key agreement scheme based on PUF and Chebyshev chaotic map for wireless sensor networks.

Linjie Wang, Chunxia Han

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Linjie WangSchool of Data Science, Tongren University, Tongren, 554300, China. wanglinjie_66@hotmail.com.
Chunxia HanSchool of Data Science, Tongren University, Tongren, 554300, China.

Funding

National Natural Science Foundation of China 62262058
6 · The paper itself

Abstract

Wireless sensor networks (WSNs) communication systems represent a flexible, reliable, and efficient paradigm that enables bidirectional real-time data exchange, as well as mutual identity authentication between the User and the Sensor Node. However, due to the open nature of these networks, communications among entities may be intercepted or manipulated by attackers through public channels at any time. As WSNs often lack fundamental security mechanisms, they are vulnerable to various potential threats. In response to these challenges, we propose a three-party authentication and key agreement scheme for WSNs based on physical unclonable functions (PUFs) and the lightweight Chebyshev chaotic map cryptographic operation. This approach ensures the preservation of privacy and resilience against machine learning-based modeling attacks, as well as other existing security risks. Furthermore, by incorporating hash functions and XOR operations into the framework design, the pseudonyms of Users and the parameters used for identity authentication are dynamically generated and updated, achieving one-time usage. The correctness and security of the proposed scheme are validated through both formal and informal analysis methods. Additionally, a simulation of practical deployment scenarios is conducted to evaluate its computational and communication overhead in comparison with competing schemes. The detailed comparative results demonstrate that the proposed scheme outperforms existing approaches in terms of efficiency and security.

Indexed as

Chebyshev chaotic mapDynamic authenticationOne-time pseudo identityPhysical unclonable functionWireless sensor networks

Identifiers

PMID41423502
PMCPMC12835016

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.