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

Sensors

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

Huanjie Zhang, Yang Chen, Shenghao Chen, Zilong Zhao, Dexin Zhu

Published Jul 31, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.3390/s26154840

Related papers

Lightweight Anonymous Key Sharing Authentication Protocol for Resource-Constrained IoT Devices

Gunawan Widjaja

The Internet of Things (IoT), as a new type of communication network, is involved in developing and applying secure transmission and storing a large amount of sensitive information. Due to the IoT devices' constrained resources, high connection costs, sluggish transmission speeds, and the inapplicability of security fundamentals like public key methods and digital signatures for simple device authentication, this paper presents a lightweight anonymous key-sharing authentication protocol for IoT devices. The protocol utilizes the tamper-resistant and anti-cloning properties of Hardware Physical Unclonable Functions (PUFs) to generate shared keys. In addition, it incorporates security primitives such as the MASK algorithm and Hash functions. The security analysis and verification using Ban logic and the proper tool ProVerif demonstrate that the protocol can defend against attacks such as man-in-the-middle, de-synchronization, impersonation, and modeling attacks. Compared with other protocols, this protocol exhibits the characteristics of low computational cost, minimal communication overhead and storage capacity, and high-security performance, making it suitable for secure communication and transmission in resource-constrained devices.

International Conference On Smart Technologies For Smart Nation (SmartTechCon)•Aug 18, 2023•0 citations

ALPAK: (Anonymized Lightweight PUF-based group Authentication with Key distribution) for IoT Devices

Konjengbam Roshan Singh, Divyashikha Sethia

Securing applications that gather and transfer confidential information has become a critical challenge in the rapidly evolving Internet of Things (IoT) landscape. Such data’s authenticity, integrity, and confidentiality must be guaranteed while reducing security functions’ computation and communication overhead to accommodate the numerous constrained devices involved. Group authentication and key management are essential aspects of IoT security, but existing protocols often need to be more computationally expensive for IoT applications and must take care of anonymization. Consequently, IoT devices may be open to potential cyber-attacks due to the use of simple security primitives. Physically Unclonable Function (PUF) can enable in lightweight approach to authentication and key distribution among group members. The factorial tree and Chinese Remainder Theorem (CRT) can minimize communication messages required to renew the keys. This paper presents a novel protocol, Anonymized Lightweight PUF-based group Authentication with Key distribution (ALPAK) for IoT Devices, which improves the PUF-Based Lightweight Group Authentication and Key Distribution Protocol (PLGAKD) to enhance the anonymity of IoT devices. The paper further presents the formal verification of the ALPAK scheme with the Scyther tool and detailed security analysis.

International Conference on Computing, Communication and Networking Technologies (ICCCNT)•Jul 6, 2023•1 citation

Novel Lightweight and Secure Group Authentication and Key Establishment in IoT

K. Nimmy, Ajith Abraham Ben, Amitha M Das

The Internet of Things (IoT) has become an integral part of modern life, with the number of connected devices increasing exponentially. Ensuring secure authentication among millions of such interconnected devices, along with the efficient distribution and management of secret keys, poses significant research challenges. Traditional one-to-one authentication schemes often overlook the stringent resource constraints of IoT devices and fail to address the scalability requirements of massive networks. In contrast, group authentication schemes (GASs) have emerged as promising solutions for many-to-many authentication, enabling simultaneous verification of multiple resource-constrained devices. However, most existing GASs remain energy-inefficient and lack the robustness required for large-scale deployment. To address these limitations, this paper proposes a novel, lightweight, and scalable group authentication scheme leveraging Physically Unclonable Functions (PUFs) to achieve enhanced security and efficiency in IoT environments. The security analysis using AVISPA and comparison with existing schemes reveal that the proposed protocol is secure and suitable for IoT networks.

IEEE International Conference on Recent Advances in Electronics, Communication, Computing, Automation and Power (RECCAP)•May 1, 2026•0 citations

A Scalable Group Authentication Protocol for IoT Based on PUF-Derived Bases in Inner Product Spaces

Pan Feng, Bing Li, Baofu Han +3 more

Abstract This paper presents a scalable group authentication and key agreement protocol for dynamic IoT environments that integrates Physical Unclonable Function (PUF)-derived device bases with inner product space projections. During registration, each device is assigned a private basis $${\mathcal {B}}_i$$ B i derived from its PUF responses, enabling efficient group authentication without per-device centralized verification and thereby mitigating long-term reliance on the group manager (GM). The protocol provides single-broadcast operations for member joining and leaving as well as decentralized group key updates. Formal security analysis under the Real-or-Random (ROR) model and experimental evaluation demonstrate robustness against common attacks, low communication overhead (6.5- $$-$$ - 7.9 KB for 100 devices), and low authentication latency (1.135 ms for members and 0.051 ms for guests).

Cybersecurity•Mar 10, 2026•3 citations

Integrating Classical and Quantum PUF with QKD for Secure IoT Networks

Franco Cirillo, Maria Caterina D'Aloia, Christian Esposito

The increasing adoption of large-scale IoT systems introduces significant challenges for secure communication. At the same time, advances in quantum computing threaten the security of classical cryptographic schemes, motivating the need for lightweight and quantum-resilient solutions. Quantum Key Distribution (QKD) offers information-theoretic security, but requires an authenticated classical channel, typically relying on pre-shared keys, which limits scalability in heterogeneous IoT environments. Existing approaches either assume unrealistic quantum capabilities at the IoT level or rely on stored secrets and centralized infrastructures. In this work, we propose a hierarchical architecture that combines Quantum Physical Unclonable Functions (QPUFs), QKD, and classical PUFs to enable secure key establishment across IoT subnetworks without pre-shared keys or long-term secret storage. The approach leverages quantum-enabled gateways as trust anchors, while keeping IoT devices lightweight and purely classical. We implement the QPUF on real quantum hardware and evaluate its performance in terms of stability, uniqueness, and uniformity. The results indicate that the proposed design provides reliable and distinctive responses, supporting its use as a hardware-rooted trust anchor and demonstrating the feasibility of integrating quantum security mechanisms into practical IoT systems.

IEEE International Conference on Smart Computing Workshops and Other Affiliated Events (SMARTCOMP Companion)•Jun 1, 2026•0 citations

A Novel Quantum-Based Authentication Method for IoT Devices using Quantum Physical Unclonable Functions

M. Premalatha, D. Narendar Singh

The Internet of Things (IoT) has ushered in significant advancements in networked technologies, yet it simultaneously raises concerns about the security and privacy of connected devices. Traditional authentication methods based on cryptographic protocols are increasingly vulnerable to attacks as the number of devices grows and attackers develop more sophisticated strategies. In this paper, we propose a novel quantum-based authentication method using Quantum Physical Unclonable Functions (QPUFs) to address the security challenges in IoT devices. Quantum PUFs exploit the inherent quantum properties of devices to generate unique, unclonable responses to challenges, providing a high level of security and resilience against attacks such as cloning, spoofing, and interception. We present the architecture of the proposed quantum authentication system, discuss the challenge-response protocol, and evaluate the system’s performance. Experimental results show that this approach offers strong security guarantees with minimal computational overhead. We Evaluate the Security, Scalability of our approach in simulated adverse IoT environment.

International Journal of Engineering and Manufacturing•Apr 8, 2026•0 citations
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.
The Internet of Things (IoT), as a new type of communication network, is involved in developing and applying secure transmission and storing a large amount of sensitive information. Due to the IoT devices' constrained resources, high connection costs, sluggish transmission speeds, and the inapplicability of security fundamentals like public key methods and digital signatures for simple device authentication, this paper presents a lightweight anonymous key-sharing authentication protocol for IoT devices. The protocol utilizes the tamper-resistant and anti-cloning properties of Hardware Physical Unclonable Functions (PUFs) to generate shared keys. In addition, it incorporates security primitives such as the MASK algorithm and Hash functions. The security analysis and verification using Ban logic and the proper tool ProVerif demonstrate that the protocol can defend against attacks such as man-in-the-middle, de-synchronization, impersonation, and modeling attacks. Compared with other protocols, this protocol exhibits the characteristics of low computational cost, minimal communication overhead and storage capacity, and high-security performance, making it suitable for secure communication and transmission in resource-constrained devices.
Securing applications that gather and transfer confidential information has become a critical challenge in the rapidly evolving Internet of Things (IoT) landscape. Such data’s authenticity, integrity, and confidentiality must be guaranteed while reducing security functions’ computation and communication overhead to accommodate the numerous constrained devices involved. Group authentication and key management are essential aspects of IoT security, but existing protocols often need to be more computationally expensive for IoT applications and must take care of anonymization. Consequently, IoT devices may be open to potential cyber-attacks due to the use of simple security primitives. Physically Unclonable Function (PUF) can enable in lightweight approach to authentication and key distribution among group members. The factorial tree and Chinese Remainder Theorem (CRT) can minimize communication messages required to renew the keys. This paper presents a novel protocol, Anonymized Lightweight PUF-based group Authentication with Key distribution (ALPAK) for IoT Devices, which improves the PUF-Based Lightweight Group Authentication and Key Distribution Protocol (PLGAKD) to enhance the anonymity of IoT devices. The paper further presents the formal verification of the ALPAK scheme with the Scyther tool and detailed security analysis.
The Internet of Things (IoT) has become an integral part of modern life, with the number of connected devices increasing exponentially. Ensuring secure authentication among millions of such interconnected devices, along with the efficient distribution and management of secret keys, poses significant research challenges. Traditional one-to-one authentication schemes often overlook the stringent resource constraints of IoT devices and fail to address the scalability requirements of massive networks. In contrast, group authentication schemes (GASs) have emerged as promising solutions for many-to-many authentication, enabling simultaneous verification of multiple resource-constrained devices. However, most existing GASs remain energy-inefficient and lack the robustness required for large-scale deployment. To address these limitations, this paper proposes a novel, lightweight, and scalable group authentication scheme leveraging Physically Unclonable Functions (PUFs) to achieve enhanced security and efficiency in IoT environments. The security analysis using AVISPA and comparison with existing schemes reveal that the proposed protocol is secure and suitable for IoT networks.
Abstract This paper presents a scalable group authentication and key agreement protocol for dynamic IoT environments that integrates Physical Unclonable Function (PUF)-derived device bases with inner product space projections. During registration, each device is assigned a private basis Bi{\mathcal {B}}_iBi​ B i derived from its PUF responses, enabling efficient group authentication without per-device centralized verification and thereby mitigating long-term reliance on the group manager (GM). The protocol provides single-broadcast operations for member joining and leaving as well as decentralized group key updates. Formal security analysis under the Real-or-Random (ROR) model and experimental evaluation demonstrate robustness against common attacks, low communication overhead (6.5- −-− - 7.9 KB for 100 devices), and low authentication latency (1.135 ms for members and 0.051 ms for guests).
The increasing adoption of large-scale IoT systems introduces significant challenges for secure communication. At the same time, advances in quantum computing threaten the security of classical cryptographic schemes, motivating the need for lightweight and quantum-resilient solutions. Quantum Key Distribution (QKD) offers information-theoretic security, but requires an authenticated classical channel, typically relying on pre-shared keys, which limits scalability in heterogeneous IoT environments. Existing approaches either assume unrealistic quantum capabilities at the IoT level or rely on stored secrets and centralized infrastructures. In this work, we propose a hierarchical architecture that combines Quantum Physical Unclonable Functions (QPUFs), QKD, and classical PUFs to enable secure key establishment across IoT subnetworks without pre-shared keys or long-term secret storage. The approach leverages quantum-enabled gateways as trust anchors, while keeping IoT devices lightweight and purely classical. We implement the QPUF on real quantum hardware and evaluate its performance in terms of stability, uniqueness, and uniformity. The results indicate that the proposed design provides reliable and distinctive responses, supporting its use as a hardware-rooted trust anchor and demonstrating the feasibility of integrating quantum security mechanisms into practical IoT systems.
The Internet of Things (IoT) has ushered in significant advancements in networked technologies, yet it simultaneously raises concerns about the security and privacy of connected devices. Traditional authentication methods based on cryptographic protocols are increasingly vulnerable to attacks as the number of devices grows and attackers develop more sophisticated strategies. In this paper, we propose a novel quantum-based authentication method using Quantum Physical Unclonable Functions (QPUFs) to address the security challenges in IoT devices. Quantum PUFs exploit the inherent quantum properties of devices to generate unique, unclonable responses to challenges, providing a high level of security and resilience against attacks such as cloning, spoofing, and interception. We present the architecture of the proposed quantum authentication system, discuss the challenge-response protocol, and evaluate the system’s performance. Experimental results show that this approach offers strong security guarantees with minimal computational overhead. We Evaluate the Security, Scalability of our approach in simulated adverse IoT environment.