Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Scientific Reports

A lightweight hash-based quantum-resistant bidirectional authentication protocol for IoT devices integrating physical unclonable functions

Qiang Qin, Yongjiao Yang, Jiaxin Lin, Hanye Huang, Ruiqi Li

Published Jun 24, 2026• 0 citations
Publisher

Abstract

IoT devices face mounting security threats: tightly bounded computing budgets on one side, the imminent arrival of quantum adversaries on the other. We present a bidirectional authentication protocol that pairs Physical Unclonable Functions with hash-based primitives so that no long-term key ever sits in device-side non-volatile memory. The scheme is best characterised as Grover-tolerant rather than fully post-quantum: hash one-wayness incurs a quadratic-only slowdown under quantum search, and PUF unclonability adds a physical, non-cryptographic uniqueness assumption - we do not claim parity with NIST-standardised lattice or code-based schemes. Mutual authentication is achieved with conditional forward secrecy and weak unlinkability against external eavesdroppers, while delivering 24.3 ms latency, 15.7 mJ per-authentication energy, and a 136-byte exchange on ESP32. ProVerif symbolic verification, complemented by a sketched QROM reduction with explicit PUF-leakage modelling, covers replay, MITM, impersonation, and physical-capture adversaries. Environmental stressing from 0 °C to 70 °C confirms practical reliability. We deliberately omit ephemeral key exchange and anonymous credentials - the price of doing so is the conditional and partial (rather than full) flavours of forward secrecy and anonymity, which we make explicit throughout.

DOI
10.1038/s41598-026-56676-2

Related papers

Secure Mutual Authentication and Key-Exchange Protocol between PUF-Embedded IoT Endpoints

Yue Zheng, Chip-Hong Chang

Device authentication and key exchange protocol are essential front line of access controls in IoT security, and physical unclonable function (PUF) is a key enabler to lightweight, low-power and secure authentication of internet enabled endpoint devices in IoT. Current PUF-enabled authentication protocol requires the verifier to store a sufficiently large number of challenge-response pairs (CRPs) of each of its interlocutors, which makes the protocol impractical in application scenarios where the verifier is a resource-constrained device, especially when the verifier needs to communicate with multiple PUF- embedded endpoints. To solve this problem, a new lightweight PUF-based mutual authentication and key-exchange protocol is proposed in this paper to allow two resource-constrained PUF embedded endpoint devices to authenticate each other without the need to store the CRPs locally, and simultaneously establish the session key for secure data exchange without resorting to public-key algorithm. The PUF response reliability is mitigated by the use of reverse fuzzy extractor to offload the compute- intensive error decoding to the server during the initialization phase of the protocol. The proposed protocol is evaluated using ProVerif to corroborate its secrecy, mutual authenticity as well as resistance against replay and man-in-the-middle attacks.

IEEE International Symposium on Circuits and Systems proceedings•Apr 27, 2021•32 citations

PUF-Based Mutual Authentication and Key Exchange Protocol for Peer-to-Peer IoT Applications

Yue Zheng, Wenye Liu, Chongyan Gu +1 more

Peer to Peer (P2P) or direct connection IoT has become increasingly popular owing to its lower latency and higher privacy compared to database-driven or server-based IoT. However, wireless vulnerabilities raise severe concerns on IoT device-to-device communication. This is further aggravated by the challenge to achieve lightweight direct mutual authentication and secure key exchange between IoT peer nodes in P2P IoT applications. Physical unclonable function (PUF) is a key enabler to lightweight, low-power and secure authentication of resource-constrained devices in IoT. Nevertheless, current PUF-enabled authentication protocols, with or without the challenge-response pairs (CRPs) of each of its interlocutors stored in the verifier's side, are incompatible for P2P IoT scenarios due to the security, storage and computing power limitations of IoT devices. To solve this problem, a new lightweight PUF-based mutual authentication and key exchange protocol is proposed. It allows two resource-constrained PUF embedded endpoint devices to authenticate each other directly without the need for local storage of CRPs or any private secrets, and simultaneously establish the session key for secure data exchange without resorting to the public-key algorithm. The proposed protocol is evaluated using the game-based formal security analysis method as well as the automatic security analysis tool ProVerif to corroborate its mutual authenticity, secrecy, and resistance against replay and man-in-the-middle (MITM) attacks. Using two Avnet Ultra96-V2 boards to emulate the two IoT endpoint devices, a physical prototype system is also constructed to demonstrate and validate the feasibility of the proposed secure P2P connection scheme. A comparative analysis shows that the proposed protocol outperforms related protocols in terms of security features, computational complexity as well as communication and storage costs.

IEEE Transactions on Dependable and Secure Computing•Jul 25, 2022•129 citations

Lightweight Anonymous Group Authentication and Quantum-Cloud Key Distribution Based on PUF for Classical Network Environments

Huanjie Zhang, Yang Chen, Shenghao Chen +2 more

With the rapid development of quantum computing, in response to its disruptive threats to traditional cryptosystems and the urgent demand for lightweight and highly scalable secure group communication among resource-constrained devices in large-scale Internet of Things (IoT) scenarios, this paper proposes a lightweight anonymous group authentication scheme that integrates Physical Unclonable Functions (PUFs), distributed Gossip algorithms, and quantum key distribution. By exploiting the uniqueness and unclonability derived from the inherent physical characteristics of PUF hardware, the scheme fundamentally eliminates attack vectors against quantum computers without requiring devices to pre-store any secret keys in their memory, while the QKCS pre-provisions CRPs and key seeds, which is the standard enrollment procedure in PUF-based systems. Combined with information-theoretically secure quantum keys as session keys, it forms a dual protection mechanism: anti-forgery at the physical layer and anti-quantum attack at the cryptographic layer. Innovatively, the Gossip algorithm is deeply integrated with group key agreement, converting global broadcast into local iterative interactions between nodes, which effectively alleviates broadcast storms and improves the scalability and fault tolerance of the protocol. Meanwhile, a pseudonym mechanism is introduced to achieve anonymous identity protection, and a dynamic key update strategy guarantees forward and backward security when members join or leave the group. Formal verification based on BAN logic and security analysis show that the proposed protocol can resist typical attacks such as replay attacks, man-in-the-middle attacks, and impersonation attacks. Performance evaluations demonstrate that our scheme outperforms existing comparable schemes in terms of computational cost, communication overhead, and dynamic group management efficiency, demonstrating its potential for resource-constrained IoT environments, pending further validation on real hardware platforms.

Sensors•Jul 31, 2026•0 citations

Quantum Safe Lattice-Based Lightweight Authentication Protocol

Kübra Seyhan, Sedat Akleylek, Ahmet Faruk Dursun

In this paper, a lattice-based lightweight authentication protocol is proposed for resource-constrained devices. The constructed protocol provides post-quantum security by relying on the hardness of module learning with errors (MLWE) assumption over lattices. Physical unclonable function (PUF), message authentication code (MAC), and exclusive or (XOR) operations are used to satisfy lightweight considerations. Informal security analysis shows that the proposed scheme provides integrity, confidentiality, anonymity, mutual authentication, and replay attack resistance. For performance evaluations based on resource-limited environments, two different authentication scenarios are constructed on the ESP32 platform, and analyses are presented in terms of running time, communication cost, and CPU cycles.

International Informatics and Software Engineering Conference (IISEC)•Feb 5, 2026•0 citations

QUANTUM-RESISTANT AUTHENTICATION AND KEY EXCHANGE PROTOCOL FOR SECURE IOT ARCHITECTURES

Dr. I. V. Prakash

The rapid expansion of Internet of Things (IoT) ecosystems has introduced significant security challenges due to resource-constrained devices, heterogeneous network architectures, and largescale connectivity. Traditional authentication and key exchange mechanisms, primarily based on classical cryptographic algorithms such as RSA and ECC, are vulnerable to future quantum computing attacks. The emergence of quantum algorithms, particularly Shor’s algorithm, threatens the long-term confidentiality and integrity of IoT communications. This paper proposes a Quantum-Resistant Authentication and Key Exchange Protocol specifically designed for secure IoT architectures. The proposed framework integrates post-quantum cryptographic primitives, including lattice-based key exchange mechanisms and hash-based authentication schemes, optimized for low computational overhead suitable for constrained IoT devices. The protocol ensures mutual authentication, forward secrecy, and resistance against quantum adversaries while maintaining minimal communication latency. Security analysis demonstrates robustness against replay, man-in-the-middle, and key-compromise attacks. Performance evaluation shows that the proposed solution achieves a balance between quantum security strength and resource efficiency, making it suitable for next-generation IoT deployments in smart cities, healthcare systems, and industrial automation.

International Journal of AI EBioMedicine Innovations•Feb 12, 2026•0 citations

Provably Secure PUF-enabled Lattice-based Authentication for Post-Quantum Industrial Internet of Things in the Era of Industry 4.0

Khalid Mahmood, Salman Shamshad, Muhammad Asad Saleem +4 more

The emergence of Industry 4.0 emphasizes automation, interconnectivity, and data-driven intelligence across industrial infrastructures, with the Industrial Internet of Things (IIoT) serving as a critical enabler. However, the proliferation of connected smart devices and the advent of quantum computing pose significant challenges to security and authentication mechanisms in such environments. To address these challenges, this paper proposes a lightweight, lattice-based authentication protocol for post-quantum IIoT environments. The proposed protocol enables secure mutual authentication and session key establishment between IIoT sensing devices and the gateway node. It integrates Physical Unclonable Functions (PUFs) to provide hardware-level device trust, eliminates the need to store long-term cryptographic keys in device memory, and uses one-time challenge-response pairs to prevent CRP reuse. The security of the proposed protocol is based on the hardness of the Ring LearningWith Errors (RLWE) problem, ensuring resistance against quantum adversaries. The protocol is formally validated under the Real-Or-Random (ROR) model and evaluated for its resistance to impersonation, replay, desynchronization, and device forgery attacks. Performance analysis shows that the proposed scheme reduces computational cost by 43.11% and communication overhead by 12.67% compared to existing lattice-based authentication protocols. These results confirm its suitability as an efficient and quantum-resilient authentication solution for future Industry 4.0-driven IIoT systems.

IEEE Transactions on Consumer Electronics•Jan 1, 2026•0 citations
IoT devices face mounting security threats: tightly bounded computing budgets on one side, the imminent arrival of quantum adversaries on the other. We present a bidirectional authentication protocol that pairs Physical Unclonable Functions with hash-based primitives so that no long-term key ever sits in device-side non-volatile memory. The scheme is best characterised as Grover-tolerant rather than fully post-quantum: hash one-wayness incurs a quadratic-only slowdown under quantum search, and PUF unclonability adds a physical, non-cryptographic uniqueness assumption - we do not claim parity with NIST-standardised lattice or code-based schemes. Mutual authentication is achieved with conditional forward secrecy and weak unlinkability against external eavesdroppers, while delivering 24.3 ms latency, 15.7 mJ per-authentication energy, and a 136-byte exchange on ESP32. ProVerif symbolic verification, complemented by a sketched QROM reduction with explicit PUF-leakage modelling, covers replay, MITM, impersonation, and physical-capture adversaries. Environmental stressing from 0 °C to 70 °C confirms practical reliability. We deliberately omit ephemeral key exchange and anonymous credentials - the price of doing so is the conditional and partial (rather than full) flavours of forward secrecy and anonymity, which we make explicit throughout.
Device authentication and key exchange protocol are essential front line of access controls in IoT security, and physical unclonable function (PUF) is a key enabler to lightweight, low-power and secure authentication of internet enabled endpoint devices in IoT. Current PUF-enabled authentication protocol requires the verifier to store a sufficiently large number of challenge-response pairs (CRPs) of each of its interlocutors, which makes the protocol impractical in application scenarios where the verifier is a resource-constrained device, especially when the verifier needs to communicate with multiple PUF- embedded endpoints. To solve this problem, a new lightweight PUF-based mutual authentication and key-exchange protocol is proposed in this paper to allow two resource-constrained PUF embedded endpoint devices to authenticate each other without the need to store the CRPs locally, and simultaneously establish the session key for secure data exchange without resorting to public-key algorithm. The PUF response reliability is mitigated by the use of reverse fuzzy extractor to offload the compute- intensive error decoding to the server during the initialization phase of the protocol. The proposed protocol is evaluated using ProVerif to corroborate its secrecy, mutual authenticity as well as resistance against replay and man-in-the-middle attacks.
Peer to Peer (P2P) or direct connection IoT has become increasingly popular owing to its lower latency and higher privacy compared to database-driven or server-based IoT. However, wireless vulnerabilities raise severe concerns on IoT device-to-device communication. This is further aggravated by the challenge to achieve lightweight direct mutual authentication and secure key exchange between IoT peer nodes in P2P IoT applications. Physical unclonable function (PUF) is a key enabler to lightweight, low-power and secure authentication of resource-constrained devices in IoT. Nevertheless, current PUF-enabled authentication protocols, with or without the challenge-response pairs (CRPs) of each of its interlocutors stored in the verifier's side, are incompatible for P2P IoT scenarios due to the security, storage and computing power limitations of IoT devices. To solve this problem, a new lightweight PUF-based mutual authentication and key exchange protocol is proposed. It allows two resource-constrained PUF embedded endpoint devices to authenticate each other directly without the need for local storage of CRPs or any private secrets, and simultaneously establish the session key for secure data exchange without resorting to the public-key algorithm. The proposed protocol is evaluated using the game-based formal security analysis method as well as the automatic security analysis tool ProVerif to corroborate its mutual authenticity, secrecy, and resistance against replay and man-in-the-middle (MITM) attacks. Using two Avnet Ultra96-V2 boards to emulate the two IoT endpoint devices, a physical prototype system is also constructed to demonstrate and validate the feasibility of the proposed secure P2P connection scheme. A comparative analysis shows that the proposed protocol outperforms related protocols in terms of security features, computational complexity as well as communication and storage costs.
With the rapid development of quantum computing, in response to its disruptive threats to traditional cryptosystems and the urgent demand for lightweight and highly scalable secure group communication among resource-constrained devices in large-scale Internet of Things (IoT) scenarios, this paper proposes a lightweight anonymous group authentication scheme that integrates Physical Unclonable Functions (PUFs), distributed Gossip algorithms, and quantum key distribution. By exploiting the uniqueness and unclonability derived from the inherent physical characteristics of PUF hardware, the scheme fundamentally eliminates attack vectors against quantum computers without requiring devices to pre-store any secret keys in their memory, while the QKCS pre-provisions CRPs and key seeds, which is the standard enrollment procedure in PUF-based systems. Combined with information-theoretically secure quantum keys as session keys, it forms a dual protection mechanism: anti-forgery at the physical layer and anti-quantum attack at the cryptographic layer. Innovatively, the Gossip algorithm is deeply integrated with group key agreement, converting global broadcast into local iterative interactions between nodes, which effectively alleviates broadcast storms and improves the scalability and fault tolerance of the protocol. Meanwhile, a pseudonym mechanism is introduced to achieve anonymous identity protection, and a dynamic key update strategy guarantees forward and backward security when members join or leave the group. Formal verification based on BAN logic and security analysis show that the proposed protocol can resist typical attacks such as replay attacks, man-in-the-middle attacks, and impersonation attacks. Performance evaluations demonstrate that our scheme outperforms existing comparable schemes in terms of computational cost, communication overhead, and dynamic group management efficiency, demonstrating its potential for resource-constrained IoT environments, pending further validation on real hardware platforms.
In this paper, a lattice-based lightweight authentication protocol is proposed for resource-constrained devices. The constructed protocol provides post-quantum security by relying on the hardness of module learning with errors (MLWE) assumption over lattices. Physical unclonable function (PUF), message authentication code (MAC), and exclusive or (XOR) operations are used to satisfy lightweight considerations. Informal security analysis shows that the proposed scheme provides integrity, confidentiality, anonymity, mutual authentication, and replay attack resistance. For performance evaluations based on resource-limited environments, two different authentication scenarios are constructed on the ESP32 platform, and analyses are presented in terms of running time, communication cost, and CPU cycles.
The rapid expansion of Internet of Things (IoT) ecosystems has introduced significant security challenges due to resource-constrained devices, heterogeneous network architectures, and largescale connectivity. Traditional authentication and key exchange mechanisms, primarily based on classical cryptographic algorithms such as RSA and ECC, are vulnerable to future quantum computing attacks. The emergence of quantum algorithms, particularly Shor’s algorithm, threatens the long-term confidentiality and integrity of IoT communications. This paper proposes a Quantum-Resistant Authentication and Key Exchange Protocol specifically designed for secure IoT architectures. The proposed framework integrates post-quantum cryptographic primitives, including lattice-based key exchange mechanisms and hash-based authentication schemes, optimized for low computational overhead suitable for constrained IoT devices. The protocol ensures mutual authentication, forward secrecy, and resistance against quantum adversaries while maintaining minimal communication latency. Security analysis demonstrates robustness against replay, man-in-the-middle, and key-compromise attacks. Performance evaluation shows that the proposed solution achieves a balance between quantum security strength and resource efficiency, making it suitable for next-generation IoT deployments in smart cities, healthcare systems, and industrial automation.
The emergence of Industry 4.0 emphasizes automation, interconnectivity, and data-driven intelligence across industrial infrastructures, with the Industrial Internet of Things (IIoT) serving as a critical enabler. However, the proliferation of connected smart devices and the advent of quantum computing pose significant challenges to security and authentication mechanisms in such environments. To address these challenges, this paper proposes a lightweight, lattice-based authentication protocol for post-quantum IIoT environments. The proposed protocol enables secure mutual authentication and session key establishment between IIoT sensing devices and the gateway node. It integrates Physical Unclonable Functions (PUFs) to provide hardware-level device trust, eliminates the need to store long-term cryptographic keys in device memory, and uses one-time challenge-response pairs to prevent CRP reuse. The security of the proposed protocol is based on the hardness of the Ring LearningWith Errors (RLWE) problem, ensuring resistance against quantum adversaries. The protocol is formally validated under the Real-Or-Random (ROR) model and evaluated for its resistance to impersonation, replay, desynchronization, and device forgery attacks. Performance analysis shows that the proposed scheme reduces computational cost by 43.11% and communication overhead by 12.67% compared to existing lattice-based authentication protocols. These results confirm its suitability as an efficient and quantum-resilient authentication solution for future Industry 4.0-driven IIoT systems.