Efficient and secure authentication scheme with user anonymity based on cloud computing in 6G

Abstract

With the rapid development of 6G and the widespread adoption of cloud computing technologies, security issues in distributed cloud computing systems have become increasingly critical. Ensuring user anonymity, legitimate device access, communication security, and efficient authentication has emerged as an urgent challenge. To address these issues, this paper proposes an anonymous, secure, and efficient authentication scheme for 6G cloud computing. The scheme supports both user authentication and device access authentication by integrating Chebyshev chaotic mapping with a multi-factor authentication mechanism. It ensures secure verification of user identities and access devices and protects subsequent session keys. Furthermore, a Physical Unclonable Function (PUF) is deployed on the device side to leverage unique hardware features, providing strong identity recognition and resistance to physical attacks while improving system authentication efficiency. Performance evaluations demonstrate that the proposed scheme reduces computational overhead by an average of 30.45% and communication overhead by an average of 16.32% compared with the baseline scheme. These results confirm that the proposed scheme significantly enhances communication security between authorized users, legitimate devices, and cloud servers in 6G cloud computing environments. By combining chaotic mapping, multi-factor authentication, and PUF-based verification, the scheme achieves robust security, lightweight computation, and strong scalability suitable for next-generation distributed cloud systems.

1 Introduction

With commercialization of the fifth-generation (5G) mobile communication network, major global telecom operators and technology companies are now shifting their research and development focus to the sixth-generation (6G) network. 6G is envisioned not only as a faster, lower-latency and more widely covered communication platform, but also as a transformative infrastructure that enables the true interconnection of everything. This integration is expected to trigger profound societal transformation and technological innovation, laying the foundation for a new era of intelligent infrastructure.

In this transformative process, cloud computing—serving as a core supporting technology—will demonstrate greater capabilities and wider application scenarios in the 6G. Benefiting from 6G’s high data transmission rates, ultra-low latency, high reliability and edge-distributed architecture, cloud computing will overcome the limitations of traditional networks in bandwidth, delay and resource allocation. This will extend computing and service capabilities toward the network edge, enabling faster data processing, lower service response times and more intelligent decision-making [1].

In the realm of smart cities, the integration of cloud computing and 6G can support real-time acquisition and analysis of massive data from high-definition video surveillance, intelligent traffic control systems and public safety management, enabling intelligent scheduling of urban resources and rapid response to events. In the industrial internet, cloud platforms can monitor the operational status of factory equipment and production line data in real time, enabling predictive maintenance and significantly improving production efficiency and equipment utilization [2]. In autonomous driving scenarios, vehicles can maintain high-speed communication with the cloud via 6G networks, uploading sensor data for real-time cloud-based processing to enhance perception and decision-making capabilities. In telemedicine, doctors can use ultra-high-definition imaging and real-time interactive systems to guide surgeries or monitor the health of remote patients, greatly alleviating the imbalance of medical resource distribution. For immersive experiences such as Virtual Reality (VR)/Augmented Reality (AR) and holographic communication, complex graphics rendering and scene generation can be handled in the cloud and transmitted back to the user terminal via the 6G network, ensuring smooth and immersive user experiences [3].

However, as cloud computing continues to evolve, ensuring user privacy and data security within cloud environments has become an urgent issue. In 6G, the scale of user and device access is expected to reach unprecedented levels. Traditional authentication mechanisms may face significant challenges, including excessive latency and computational overhead, in handling such large-scale user access and device authentication. This is particularly true in cloud computing environments, where authentication processes may involve extensive data processing and transmission, placing greater demands on authentication efficiency [4–6]. Moreover, in traditional identity authentication mechanisms, users may need to disclose certain identity information during the authentication process, which poses risks of privacy leakage or exploitation by attackers. Therefore, there is a pressing need to design a cloud computing-based anonymous and secure authentication scheme that not only protects user privacy but also significantly enhances authentication efficiency.

1.1 Related work

At present, extensive research has been conducted both domestically and internationally in the fields of authentication and key agreement, resulting in the proposal of various protocol schemes aimed at ensuring the security of authentication processes and data communications [7–13].

Parai et al. [10] based on Gupta’s [9] research, proposed an identity-based three-party authentication key negotiation protocol for resource-constrained IoT devices. They tested and estimated the execution time of the protocol on a Raspberry Pi 4 device, covering security levels from 80 bits to 256 bits. However, since the protocol is based on bilinear pairings, it still has a high computational cost. In 2023, Mookherji et al. [11] proposed a semi-centralized architecture and a certification and key negotiation scheme for smart healthcare systems. In this scheme, the cloud server delegates user registration functionality to fog servers, and users can complete registration by sending requests to fog servers. This scheme claims to effectively address the threat of server single-point compromise. However, fog servers are typically deployed close to the device edge layer and are considered untrusted. Compared to centralized cloud servers, fog servers have higher key management costs and challenges. Qiu et al. [14] addressed the imbalance between practicality and security in three-factor authentication by proposing a lightweight mobile device authentication scheme using chaotic mapping. The scheme utilizes fuzzy verifiers and honeyword techniques to resist offline password guessing attacks. In 2021, Lin et al. [15] introduced an authentication protocol tailored for 5G healthcare IoT systems, enabling patients to access multiple remote medical services using paired credentials. However, due to the absence of timestamps and the use of a public authentication parameter, the scheme is susceptible to Denial of Service (DoS) attacks. Additionally, storing users’ private keys in plaintext on the smart card leaves it vulnerable to card theft attacks. To address identity verification in Wireless Body Area Networks (WBAN), Alzahrani et al. [16] introduced a lightweight protocol that facilitates session key generation between sensor and hub nodes. Nevertheless, it lacks comprehensive mutual authentication among access points, hubs, and sensors, limiting its practical deployment. Nyangaresi et al. [17] proposed a cheme to secure interactions between body sensor units and administrators in WBAN scenarios, achieving forward secrecy through session key generation. Yet, the protocol fails to preserve user anonymity when the gateway node acts as an insider adversary.

Xie et al. [18] designed a scheme for patient monitoring systems using elliptic curve cryptography (ECC) and validated its security via formal analysis. However, it does not implement mutual authentication between sensor and relay nodes. Deebak et al. [19] designed a framework for cloud-assisted medical cyber-physical systems based on Chebyshev chaotic maps. A major weakness lies in the registration phase, where user credentials are transmitted in plaintext to the gateway, risking identity exposure. Tu et al. [20] also proposed EAKE-WCI, an anonymous authentication protocol for wearable healthcare devices in cloud environments. While the scheme ensures mutual authentication among users, devices, and servers, it lacks adequate password protection during login, making it vulnerable to guessing attacks. Edwards et al. [21] introduced a distributed authentication framework, incorporating physical tokens, biometrics, and cryptographic keys to validate user identity. Lee et al. [22] developed a three-factor authentication method tailored for sensor-based devices operating in IoT settings. Their approach utilizes Physical Unclonable Function (PUF) and honeypot mechanisms to mitigate threats such as ID/password guessing, brute-force, and eavesdropping attacks. Mirsaraei et al. [23] introduced another three-factor authentication protocol suitable for IoT applications, employing elliptic curve cryptography and smart cards for user registration and identity verification within private blockchain environments. This design is particularly effective for resource-constrained IoT devices. Ghose et al. [25] presented two-factor authentication protocol. Initial verification step is based on traditional credentials (username and password), while the second step leverages persistent associations between the user’s device and an auxiliary unit. Ahmad et al. [26] introduced BAuth-ZKP, a multi-factor authentication protocol designed for smart city. By utilizing blockchain smart contracts, the scheme enables secure user verification without revealing personal identity information. Braeken et al. [27] developed a two-way multi-factor authentication and key exchange mechanism aimed at facilitating secure access to remote sensor nodes. Their approach ensures real-time data retrieval and defends against semi-trusted intermediaries, while preserving user anonymity and untraceability, and mitigating risks from session-specific data leakage. In the healthcare sector, Miao et al. [28] proposed a three-factor authentication protocol for medical IoT systems, leveraging blockchain to manage identity-related data and applying Chebyshev chaotic maps to enhance login and authentication robustness. Zhang et al. [29] presented an ECC-based three-factor scheme involving credentials, passwords, and biometrics for secure interaction among administrators, gateways, and industrial IoT devices. This protocol supports identity revocation and online updates, adapting to dynamic industrial requirements. To enhance cloud network security, Bernard et al. [30] designed a mutual authentication protocol utilizing visual cryptography. The approach employs confidential mappings—specifically visual encryption and challenge-response pairs—along with credential-based verification to counteract weaknesses in traditional cryptographic algorithms. Despite its enhanced security features, the scheme incurs significant computational cost, which limits its efficiency on resource-limited platforms.

PUF is an emerging cryptographic primitive known for its strong resistance to duplication. Min et al. [32] designed an authentication approach that integrates PUF with a dynamic identity mechanism, effectively safeguarding device identities and enhancing privacy at the hardware level. In a subsequent work, Aman et al. [33] developed a PUF-based mutual authentication protocol, enabling secure communication between devices and servers, as well as among devices themselves, thereby expanding its applicability. Shah et al. [34] presented a PUF-enabled authentication mechanism that employs challenge–response pairs and incorporates the AES encryption algorithm to improve overall system security. Zhu et al. [35] introduced a PUF-driven authentication protocol specifically designed for RFID environments, addressing critical security concerns such as unclonability and traceability, while also supporting mutual authentication. In summary, current authentication schemes still have security vulnerabilities and incur high computational and communication costs [24–31].

1.2 Contributions

In this paper, we propose a cloud-based anonymous and secure authentication scheme. Our approach enables mutual authentication between users and access devices, allowing them to securely establish a reliable shared session key. Communication efficiency is also considered in the proposed scheme. The main contributions of this work can be summarized as follows:

1.3 Paper organization

The structure of this paper is arranged as follows. Section 2 outlines the foundational concepts relevant to the proposed scheme. Section 3 details the authentication protocol in depth. Sections 4 and 5 are dedicated to the security assessment and efficiency analysis of the scheme. The final section concludes the study and highlights potential avenues for future exploration.

2 Preliminaries

This section presents the relevant background of proposed scheme, with detailed explanations provided below.

2.1 System architecture

As shown in Figure 1, cloud-based authentication protocol proposed in this paper consists of three main components: cloud servers, users, and access devices. These components are interconnected via a high-speed, highly reliable 6G core network, forming a secure communication architecture that supports large-scale heterogeneous device access.

FIGURE 1

Cloud Servers: Serving as the central management entities, cloud servers are responsible for identity authentication, key management, secure storage, and data processing.

Users: It refers to individuals or organizations utilizing the system services, including system administrators, household users, and industrial control personnel. Users initiate authentication requests via terminals to access cloud resources or remotely control access devices.

Access devices engage in mutual authentication with both users and cloud servers via the proposed protocol, ensuring that all communications occur in a trusted and secure environment, thereby preventing unauthorized access and data leakage.

Leveraging the high bandwidth and low latency characteristics of 6G core network, proposed system achieves strong security guarantees while meeting real-time performance requirements and supporting massive connectivity.

2.2 Chebyshev chaotic mapping

Given an integer and a variable , where , can be defined as:

From Equation 1, the recursive formula for Chebyshev polynomials is derived as Equation 2 [36–38]:

According to the above formulas, Chebyshev polynomials satisfy the semi-group property. That is, for any two positive integers , and , Equation 3 holds:

The semigroup property [43]: For and , the enhanced Chebyshev polynomial is defined as Equation 4:where is a large prime number. Based on this definition, the enhanced Chebyshev polynomial still satisfies the semi-group property, expressed as Equation 5:

Chebyshev Polynomial-Based Diffie-Hellman Problem (): For any positive integers and , and any , given and , it is computationally hard to derive , due to the semi-group property of Chebyshev polynomials modulo a large prime [39–41].

2.3 Physical unclonable function

Physical Unclonable Function (PUF) is cryptographic primitives embedded as circuit modules within chips, serving as hardware security mechanisms. They exploit random physical variations introduced during manufacturing, which are uncontrollable and unique to each device. This inherent randomness ensures that producing two identical PUF-enabled devices is practically impossible. Consequently, PUF is increasingly utilized in information security, particularly for lightweight device authentication and as novel factors in multi-factor authentication protocols.

These characteristics make PUF particularly suitable for secure, hardware-level identity verification in resource-constrained environments.

3 Proposed scheme

This section provides a comprehensive explanation of the proposed scheme, which is built upon an enhanced Chebyshev chaotic map. Table 1 outlines the symbols and cryptographic operations utilized throughout the scheme.

3.1 System initialization

Cloud server selects a large prime number , generates a random number and hash function . Then, computes , and publicly discloses the parameters , while keeping as a long-term private key securely stored. Figure 2 is flowchart for proposed scheme.

FIGURE 2

3.2 Registration

3.2.1 Access device registration

sends its identity to Cloud server. The registration process is as follows:

Step 1: Access device choose its identity , selects a challenge value , computes and , and sends the registration information to .

Step 2: Upon receiving , first checks whether is already registered. If it is not registered, cloud server computes , , then sends to and stores , , and in cloud server database.

Step 3: The access device receives the message, saves and the challenge value .

3.2.2 User registration

Step 1: selects identity and , then selects a random number , computes , and sends to cloud server.

Step 2: When receives the message, it first checks if the user’s already exists. If it already exists, meaning user is already registered, end the session. If there is no duplication, cloud server proceeds to the next step. The cloud server generates an anonymous identity , where is the current timestamp, computes , and , stores , , , and in SC. Then sends it to .

Step 3: Upon receiving SC, inputs their biometric features , calculates , then computes , and generates a challenge , calculating . The user then computes , and . Finally, the user stores in their smart card SC, and securely keeps the smart card.

3.3 Login and authentication

At this phase, user and the access device complete authentication and key agreement through the cloud server. The process is illustrated in Figure 3.

FIGURE 3

Step 1: The user inserts the smart card inputs their , login password , and provides biometric information . Then, calculate , compute , and . Next, calculate and . Then, calculate , and check if Afterward, generates two random numbers and Calculate and User sends the message to cloud server .

Step 2: receives the login request from , first checks Then, computes , and The server then verifies if If the equality does not hold, rejects session. If the equality holds, retrieves the database using , obtaining generates and calculates , and Then, calculate and send to the access device

Step 3: Access device receives the message from server Access device checks , then calculates = and Then, and is verified. If the value is correct, access device generates a random number and calculates , and . Access device then sends and to cloud server .

Step 4: Upon receiving and , computes , and verifies the value of . Then, , and . Next, calculate . sends the message to user via a public channel and calculates , sending to access device

Step 5: Upon receiving the message, the user computes and , then verifies whether If it holds, then mutual authentication between and server is successfully completed, and a session key is established.

Step 6: Upon receiving the message, computes and verifies whether . If the equality holds, mutual authentication between and is successfully completed, and a session key is established.

4 Security analysis

In this section, we conduct a security analysis of the proposed scheme under the Random Oracle Model (ROM). Furthermore, additional security properties are examined through semantic evaluation [45–47].

4.1 Formal security proof using ROM

The security of session keys can be formally proven through rigorous mathematical analysis of the protocol within the Random Oracle Model (ROM).

Participants: Entities involved in the scheme include the user , cloud server and the access device . Let , , and respectively denote instances of the user , cloud server and access device .

Accepted: Instance enters an accepted state when it receives the final scheme message during communication process. The instance maintains the sequence of all exchanged messages, forming a session identifier for the current session.

Freshness: Instances and are considered fresh if the adversary has not obtained their session key using the query.

It is assumed that adversary has complete control over the communication in the system. can intercept, eavesdrop and modify messages. In the Random Oracle Model, can perform simulated queries to compromise the authenticity and confidentiality of key agreement and session keys. The types of queries allowed are as follows:

: Simulates a passive attack where obtains all messages exchanged between user , cloud server and the access device .

: Simulates an active attack. impersonates instance and sends message to instance . If is valid, responds appropriately; otherwise, the simulator terminates the query.

: If , the user’s password is revealed. If , the smart card itself is returned. If , biometric data is provided.

: Allows to retrieve all information stored in the device node.

: Allows to obtain session key generated by instance and its partner.

: initiates this challenge query on a legitimate instance of and . fair coin c is tossed to determine the output; If c = 1, the real session key is returned; If c = 0, a random string is returned; In other cases, the output is null. Only A knows the outcome of the coin toss.

Semantic Security: can perform multiple queries on and guess a bit value c. Let denote the authentication and key agreement protocol. If c = c, wins the game and breaks the semantic security of . The event where wins is denoted as Succ. Thus, we have:where , , and respectively denote the number of random oracle queries, the number of Send queries, the output length of random oracle and the probability of a false positive by the simulation extractor. The parameters and are those of the Zipf distribution.

Proof: Five distinct games are defined for formal analysis. Let denote the success event in game , and represent the probability that adversary correctly guesses the value of and wins the game in . initiates the Test query and attempts to guess the value of .

Game :

simulates a real-world attack on the proposed protocol . Adversary must randomly choose a bit ccc before the game begins. By definition, we obtain:

Game :

In this game, within the random oracle model, adversary performs a passive eavesdropping attack. However, based on the messages transmitted over the public channel, is still unable to compute the session key or obtain any other secret information. Therefore, we have:

Game :

Building upon the previous game, additionally includes simulations of the Send and Hash queries. Assuming that attempts to find a collision in the hash function, the collision probability based on the birthday paradox is given by:

Game :

In addition, due to the use of fuzzy extractors, false positives may occur. The probability that adversary successfully deceives the reproduction function Rep(⋅) is bounded by , and the success rate for such deception through Send queries is: .

Therefore, we obtain the following result:

Game :

In Game , adversary is allowed to perform the query, which simulates the physical capture of a sensor node. Through this query, obtains the information stored in . In addition, can use the Execute query to eavesdrop on all messages exchanged during the authentication and key agreement process. Although adversary attempts to compute the session key, decryption is not possible because lacks the user’s secret paramaters. Furthermore, the adversary cannot obtain the necessary random values used in key generation. As a result, in order to derive the session key, must solve the CMDLP problem. Let denote the advantage of adversary in solving the CMDLP problem within time t. Therefore, we conclude:

In Game , all random oracle simulation queries are executed. Therefore, we have:

According to Equations 6–12, we obtain: . The above sequence of games demonstrates that the protocol is provably secure under the Random Oracle Model (ROM).

4.2 Semantic analysis

5 Performance analysis

In this subsection, we compare the proposed scheme with other existing scheme.

5.1 Function

In this subsection, the proposed scheme is compared with other existing protocols. The proposed scheme can effectively resist various types of attacks and largely meets the relevant security and functional requirements. In the table, a check mark (√) indicates that the protocol satisfies the corresponding security or functional requirement, while a cross mark (×) indicates that it does not. F1–F10 represent abbreviations for different attack types and functional features, with corresponding explanations provided below Table 2.

5.2 Computation overhead

This subsection presents a comparison of the computational overhead of the proposed schemes. The comparison is based on the computational efforts required by the protocol entities during the authentication and key agreement processes. The computation times are uniformly defined as follows: hash function, elliptic curve scalar multiplication, and chaotic map computation cost are denoted as , and , respectively.

As shown in Table 3 and Figure 4, the proposed scheme exhibits significant advantages in multiple aspects. In terms of total computational cost, the Our scheme has a total of , which is among the lowest compared to other schemes. Although the usage of is slightly higher, the amount of is relatively lower, indicating a well-balanced design between complex and regular computations, thus leading to higher efficiency in resource utilization.

FIGURE 4

Regarding total execution time, the Our scheme achieves a time of 1.88030, which is only slightly higher than that of [46] (1.53252) and [43] (1.87992), but significantly better than other schemes such as [42] (4.07076) and [44] (5.59188). This demonstrates that the Our scheme performs excellently in terms of efficiency and can meet high-performance requirements.

Furthermore, in terms of task distribution, the Our scheme maintains a balanced computational load among the user, cloud server, and access device. Specifically, the user side is responsible for , the cloud server handles , and the access device takes . Compared to other schemes where one component may bear a disproportionate load, the Our scheme avoids performance bottlenecks, contributing to more stable and scalable system operation.

In summary, our scheme demonstrates strong overall advantages in computational efficiency, execution time, and load distribution, making it well-suited for practical deployment and widespread application.

5.3 Communication overhead

Table 4 and Figure 5 present a comparison of the communication overhead between the proposed protocol and five related protocols. For the sake of a fair comparison, the lengths of various parameters are uniformly set as follows: 160 bits for the Chebyshev polynomial, 320 bits for points on the elliptic curve, 160 bits for hash values, 128 bits for random nonces, 32 bits for the identities of the user and the access device node, 32 bits for timestamps, and 128 bits for blocks used in symmetric encryption and decryption. In addition, the communication process in the proposed protocol involves several potential components, including the user terminal, the PUF module embedded in the device, the encryption/decryption unit, the secure communication channel (e.g., TLS/SSL), and the core cloud server with its key management and auditing modules. These components together ensure the reliability, confidentiality, and integrity of message exchanges, forming the foundation for a fair and meaningful comparison of communication overhead.

FIGURE 5

As shown in Table 4, the proposed scheme demonstrates a significant advantage in terms of communication cost, achieving a total of 2,144 bits, which is relatively low compared to all the referenced schemes.

Specifically, compared to the highest communication cost in [43] (3,232 bits), the proposed scheme reduces the overhead by approximately 33.7%. It also achieves reductions of about 24.7% compared to [42] (2,848 bits), 21.2% compared to [44] (2,720 bits), and 23.9% compared to [46] (2,816 bits). Although [45] has the lowest communication cost (1,760 bits), it likely involves trade-offs in terms of computational complexity, security mechanisms, or functional completeness; otherwise, it would not be outperformed by more efficient schemes.

Overall, the proposed scheme effectively reduces communication overhead while maintaining system security and functional integrity. It achieves a communication cost optimization of approximately 20%–35% compared to most existing schemes, making it well-suited for bandwidth- and energy-constrained environments such as the Internet of Things and edge computing.

6 Conclusion

This paper presents an anonymous and secure authentication scheme for 6G cloud environments by combining Chebyshev chaotic mapping with the PUF mechanism. The scheme achieves secure identity verification, session key confidentiality, and resistance to common network attacks, while experiments demonstrate significant improvements in authentication efficiency and reductions in computational and communication overhead. Limitations remain regarding large-scale scalability, cross-vendor PUF compatibility, and sensitivity of chaotic parameters, which open meaningful directions for future research. Overall, the scheme offers a promising security solution for high-concurrency 6G cloud systems and provides a foundation for further exploration.

References

• 1.

  ChenJLiTZhangYYouTLuYTiwariPet alGlobal-and-local attention-based reinforcement learning for cooperative behaviour control of multiple UAVs. IEEE Trans Vehicular Technol (2023) 73(3):4194–206. 10.1109/tvt.2023.3327571

  • CrossRef
  • Google Scholar
  • View reference in article

• 2.

  MiaoJNingXHongSWangLLiuB. Secure and efficient authentication protocol for supply chain systems in artificial intelligence-based internet of things. IEEE Internet Things J (2025) 12:39532–42. 10.1109/jiot.2025.3592401

  • CrossRef
  • Google Scholar
  • View reference in article

• 3.

  BaiZMiaoHMiaoJXiaoNSunX. Artificial intelligence-driven cybersecurity applications and challenges. Innovative Appl AI (2025) 2(2):26–33. 10.70695/AA1202502A09

  • CrossRef
  • Google Scholar
  • View reference in article

• 4.

  FarhoudiMShokrnezhadMTalebTLiRSongJ. Discovery of 6G services and resources in edge-cloud-continuum. IEEE Netw (2024) 39:223–32. 10.1109/mnet.2024.3438096

  • CrossRef
  • Google Scholar
  • View reference in article

• 5.

  ChenJShuQLuYZhangYWangY. QCTF: a quantized communication and transferable fusion framework for multi-agent collaborative perception. IEEE Trans Intell Transportation Syst (2025) 26:15013–27. 10.1109/TITS.2025.3574725

  • CrossRef
  • Google Scholar
  • View reference in article

• 6.

  RazaqueAKhanMYooJAlotaibiAAlshammariMAlmianiM. Blockchain-enabled heterogeneous 6G supported secure vehicular management system over cloud edge computing. Internet Things (2024) 25:101115. 10.1016/j.iot.2024.101115

  • CrossRef
  • Google Scholar
  • View reference in article

• 7.

  XiaoYGaoS. 5GAKA-LCCO: a secure 5G authentication and key agreement protocol with less communication and computation overhead. Information (2022) 13(5):257. 10.3390/info13050257

  • CrossRef
  • Google Scholar
  • View reference in article

• 8.

  ChenJRenCHuYZhangYLuYLiQet alDual-centralized Q-Network-Based reinforcement learning for cooperative path planning of multiple UAVs. IEEE Trans Intell Transportation Syst (2025) 26:13232–46. 10.1109/TITS.2025.3587392

  • CrossRef
  • Google Scholar
  • View reference in article

• 9.

  GuptaDSParaiKObaidatMS. Efficient and secure design of id-3paka protocol using ECC[C]//2021 international conference on computer, information and telecommunication systems (CITS). IEEE (2021). p. 1–5.

  • Google Scholar
  • View reference in article

• 10.

  ParaiKGuptaDSIslamSKH. IoT-ID3PAKA: efficient and robust ID-3PAKA protocol for resource-constrained IoT devices. IEEE Internet Things J (2023) 11:10304–13. 10.1109/jiot.2023.3325583

  • CrossRef
  • Google Scholar
  • View reference in article

• 11.

  MookherjiSOdeluVPrasathRDasAKParkY. Fog-based single sign-on authentication protocol for electronic healthcare applications. IEEE Internet Things J (2023) 10:10983–96. 10.1109/jiot.2023.3242903

  • CrossRef
  • Google Scholar
  • View reference in article

• 12.

  XiongLWangJKYuLXiongNWuH. An efficient privacy-preserving access control scheme for cloud computing services. IEEE Trans Consumer Electron (2025) 71:6642–58. 10.1109/tce.2025.3534833

  • CrossRef
  • Google Scholar
  • View reference in article

• 13.

  SoniPPradhanJPalAKIslamSH. Cybersecurity attack-resilience authentication mechanism for intelligent healthcare system. IEEE Trans Ind Inform (2022) 19(1):830–40. 10.1109/tii.2022.3179429

  • CrossRef
  • Google Scholar
  • View reference in article

• 14.

  QiuSWangDXuGKumariS. Practical and provably secure three-factor authentication protocol based on extended chaotic-maps for Mobile lightweight devices. IEEE Trans Dependable Secure Comput (2020) 19(2):1–1351. 10.1109/tdsc.2020.3022797

  • CrossRef
  • Google Scholar
  • View reference in article

• 15.

  LinTWHsuCLLeTVLuCFHuangBY. A Smartcard-Based user-controlled single sign-on for privacy preservation in 5G-IoT telemedicine systems. Sensors (2021) 21(8):2880. 10.3390/s21082880

  • Pubmed Abstract
  • CrossRef
  • Google Scholar
  • View reference in article

• 16.

  AlzahraniBAIrshadAAlbeshriAAlsubhiK. A provably secure and lightweight patient-healthcare authentication protocol in wireless body area networks. Wireless Personal Commun (2021) 117(1):47–69. 10.1007/s11277-020-07237-x

  • CrossRef
  • Google Scholar
  • View reference in article

• 17.

  NyangaresiVO. Provably secure pseudonyms based authentication protocol for wearable ubiquitous computing Environment[C]//2022 international conference on inventive computation technologies (ICICT). IEEE (2022). p. 1–6.

  • Google Scholar
  • View reference in article

• 18.

  XieQLiuDDingZTanXHanL. Provably secure and lightweight patient monitoring protocol for wireless body area network in IoHT. J Healthc Eng (2023) 2023(1):4845850. 10.1155/2023/4845850

  • Pubmed Abstract
  • CrossRef
  • Google Scholar
  • View reference in article

• 19.

  DeebakBDHwangSO. A cloud-assisted medical cyber-physical system using a privacy-preserving key agreement framework and a chebyshev chaotic map. IEEE Syst J (2023) 17(4):5543–54. 10.1109/JSYST.2023.3303460

  • CrossRef
  • Google Scholar
  • View reference in article

• 20.

  TuSBadshahAAlasmaryH. EAKE-WC: efficient and anonymous AuthenticatedKey exchange scheme for wearable computing. IEEE Trans Mobile Computing (2023) 1:1–12. 10.1109/TMC.2023.3297854

  • CrossRef
  • Google Scholar
  • View reference in article

• 21.

  EdwardsJAparicio-NavarroFJMaglarasL. FFDA: a novel four-factor distributed authentication Mechanism[C]//2022 IEEE international conference on cyber security and resilience (CSR). Rhodes, Greece: IEEE (2022). p. 376–81.

  • Google Scholar
  • View reference in article

• 22.

  LeeJOhJKwonDKimMYuSJhoNSet alPUFTAP-IoT: PUF-based three-factor authentication protocol in IoT environment focused on sensing devices. Sensors (2022) 22(18):7075. 10.3390/s22187075

  • Pubmed Abstract
  • CrossRef
  • Google Scholar
  • View reference in article

• 23.

  Ghafouri MirsaraeiABaratiABaratiH. A secure three-factor authentication scheme for IoT environments. J Parallel Distributed Comput (2022) 169:87–105. 10.1016/j.jpdc.2022.06.011

  • CrossRef
  • Google Scholar
  • View reference in article

• 24.

  ZhangLZhuYRenWZhangYChooKKR. Privacy-preserving fast three-factor authentication and key agreement for IoT-Based E-Health systems. IEEE Trans Serv Comput (2023) 16(2):1324–33. 10.1109/tsc.2022.3149940

  • CrossRef
  • Google Scholar
  • View reference in article

• 25.

  GhoseNGuptaKLazosL. ZITA: zero-interaction two-factor authentication using contact traces and In-band proximity verification. IEEE Transactions on Mobile Computing (2023). p. 1–16.

  • Google Scholar
  • View reference in article

• 26.

  AhmadMOTripathiGSiddiquiFAlamMAAhadMAAkhtarMMet alBAuth-ZKP—a blockchain-based multi-factor authentication mechanism for securing smart cities. Sensors (2023) 23(5):2757. 10.3390/s23052757

  • Pubmed Abstract
  • CrossRef
  • Google Scholar
  • View reference in article

• 27.

  BraekenA. Highly efficient bidirectional multifactor authentication and key agreement for real-time access to sensor data. IEEE Internet Things J (2023) 10(23):21089–99. 10.1109/jiot.2023.3284501

  • CrossRef
  • Google Scholar
  • View reference in article

• 28.

  MiaoJWangZWuZNingXTiwariP. A blockchain-enabled privacy-preserving authentication management protocol for internet of medical things. Expert Syst Appl (2024) 237:121329. 10.1016/j.eswa.2023.121329

  • CrossRef
  • Google Scholar
  • View reference in article

• 29.

  ZhangZHuangWHuangYLiaoYZhouS. A domain isolated tripartite authenticated key agreement protocol with dynamic revocation and online public identity updating for IIoT. IEEE Internet Things J (2024) 11:15616–32. 10.1109/jiot.2023.3349005

  • CrossRef
  • Google Scholar
  • View reference in article

• 30.

  BernardEBChenCShiruiWGuoHLiuJ. A secure mutual authentication protocol based on visual cryptography technique for IoT-Cloud. Chin J Electron (2024) 33(1):43–57. 10.23919/cje.2022.00.339

  • CrossRef
  • Google Scholar
  • View reference in article

• 31.

  PappuRRavikanthBRechtJGershenfeldN. Physical one-way functions. Science (2002) 297(5589):2026–30. 10.1126/science.1074376

  • Pubmed Abstract
  • CrossRef
  • Google Scholar
  • View reference in article

• 32.

  MinZYaoXHongL. Physical unclonable function based authentication protocol for unit IoT and ubiquitous IoT[C]//international conference on identification. IEEE Computer Society (2016). p. 179 184.

  • Google Scholar
  • View reference in article

• 33.

  AmanMNChuaKCSikdarB. Mutual authentication in IoT systems using physical unclonable functions. IEEE Internet Things J (2017) 4(5):1327–40. 10.1109/jiot.2017.2703088

  • CrossRef
  • Google Scholar
  • View reference in article

• 34.

  ShahTVenkatesanS. Authentication of IoT device and IoT server using secure vaults, 819 (2018). p. 824.

  • Google Scholar
  • View reference in article

• 35.

  ZhuFLiPXuHWangR. A lightweight RFID mutual authentication protocol with PUF. Sensors (2019) 19(13):2957–78. 10.3390/s19132957

  • Pubmed Abstract
  • CrossRef
  • Google Scholar
  • View reference in article

• 36.

  MoJHuZShenW. A provably secure three-factor authentication protocol based on chebyshev chaotic mapping for wireless sensor network. IEEE Access (2022) 10:12137–52. 10.1109/access.2022.3146393

  • CrossRef
  • Google Scholar
  • View reference in article

• 37.

  TruongTTTranMTDuongAD. Improved Chebyshev polynomials‐based authentication scheme in client‐server environment. Security Commun Networks (2019) 2019(1):1–11. 10.1155/2019/4250743

  • CrossRef
  • Google Scholar
  • View reference in article

• 38.

  HeKRenZ. A new three-factor authentication scheme using Chebyshev chaotic map for peer-to-peer industrial internet of things. Computer Networks (2024) 247:110450. 10.1016/j.comnet.2024.110450

  • CrossRef
  • Google Scholar

• 39.

  KumarNAliR. Blockchain-enabled authentication framework for maritime transportation system empowered by 6G-IoT. Comput Networks (2024) 244:110353. 10.1016/j.comnet.2024.110353

  • CrossRef
  • Google Scholar

• 40.

  YuanMTanHZhengWVijayakumarPAlqahtaniFTolbaA. A robust ECC-based authentication and key agreement protocol for 6G-based smart home environments. IEEE Internet Things J (2024) 11(18):29615–27. 10.1109/jiot.2024.3392498

  • CrossRef
  • Google Scholar

• 41.

  KumarNAliR. A smart contract-based 6G-enabled authentication scheme for securing internet of nano medical things network. Ad Hoc Networks (2024) 163:103606. 10.1016/j.adhoc.2024.103606

  • CrossRef
  • Google Scholar

• 42.

  ZhaoXLiDLiH. Practical three-factor authentication protocol based on elliptic curve cryptography for industrial internet of things. Sensors (2022) 22(19):7510. 10.3390/s22197510

  • Pubmed Abstract
  • CrossRef
  • Google Scholar

• 43.

  IrshadAChaudhrySAXieQLiXFarashMSKumariSet alAn enhanced and provably secure chaotic map-based authenticated key agreement in multi-server architecture. Arabian J Sci Eng (2018) 43:811–28. 10.1007/s13369-017-2764-z

  • CrossRef
  • Google Scholar

• 44.

  ThakurGPrajapatSKumarPChenCM. A privacy-preserving three-factor authentication system for IoT-enabled wireless sensor networks. J Syst Architecture (2024) 154:103245. 10.1016/j.sysarc.2024.103245

  • CrossRef
  • Google Scholar

• 45.

  LiFYuXCuiYYuSSunYWangYet alAn anonymous authentication and key agreement protocol in smart living. Comput Commun (2022) 186:110–20. 10.1016/j.comcom.2022.01.019

  • CrossRef
  • Google Scholar

• 46.

  Abdi Nasib FarHBayatMKumar DasAFotouhiMPournaghiSMDoostariMA. LAPTAS: lightweight anonymous privacy-preserving three-factor authentication scheme for WSN-based IIoT. Wireless Networks (2021) 27(2):1389–412. 10.1007/s11276-020-02523-9

  • CrossRef
  • Google Scholar

• 47.

  CuiJYuJZhongHWeiLLiuL. Chaotic map-based authentication scheme using physical unclonable function for internet of autonomous vehicle. IEEE Trans Intell Transportation Syst (2022) 24(3):3167–81. 10.1109/tits.2022.3227949

  • CrossRef
  • Google Scholar

• 48.

  JiangQZhangNNiJMaJMaXChooKKR. Unified biometric privacy preserving three-factor authentication and key agreement for cloud-assisted autonomous vehicles. IEEE Trans Vehicular Technol (2020) 69(9):9390–401. 10.1109/tvt.2020.2971254

  • CrossRef
  • Google Scholar