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

Cybersecurity

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

Pan Feng, Bing Li, Baofu Han, Yongli Ma, Yuanyuan Hu, Runan Zhao

Published Mar 10, 2026• 3 citations
Publisher

Abstract

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).

DOI
10.1186/s42400-025-00468-0

Related papers

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

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

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

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

Practical and Efficient PUF-Based Protocol for Authentication and Key Agreement in IoT

Sivappriya Manivannan, Rajat Subhra Chakraborty, Indrajit Chakrabarti +1 more

The immense potential of the Internet of Things (IoT) is challenged by grave security vulnerabilities that are easily exploitable in resource-constrained environments. We propose a lightweight Authentication and Key Agreement (AKA) protocol to derive a shared session key for each communicating node in amutually communicating cluster of IoT nodes. Each IoT device is embedded with a Physically Unclonable Function (PUF), and a Fuzzy Extractor (FE) is deployed to correct and reproduce the private key and public helper data pair from the possibly erroneous PUF response. This secret raw PUF response is not stored explicitly in the server. A forward-secure authenticated key agreement is achieved by incorporating Elliptic Curve Diffie-Hellman Key Exchange (ECDH) protocol. The security of the proposed scheme has been formally verified while considering both active and passive attackers using the Verifpal tool. A prototype implementation with the Arbiter PUF circuit, FE, and associated software has successfully demonstrated the efficacy of our scheme.

IEEE Embedded Systems Letters•Aug 2, 2023•16 citations

Enhanced Authentication Protocol for the Internet of Things Environment

Chien‐Ming Chen, Xuanang Li, Shuangshuang Liu +2 more

The Internet of Things (IoT) is among the most promising technologies of the future, and its development has garnered attention worldwide. However, the rise of the IoT has been accompanied by a proportionate increase in security concerns regarding communication between IoT entities. Recently, Alzahrani et al. proposed an identity-based authentication and key agreement protocol for an IoT environment, wherein a physically unclonable function was employed. They claimed that their protocol can resist various types of attacks; however, after thorough analysis, we determined it to be ineffective against privileged internal attacks, physical IoT device capture attacks, stolen-verifier attacks, and known temporary information exposure attacks. To resolve these security weaknesses, we propose a new authentication and key agreement protocol. In addition, we demonstrate that the proposed protocol is provably secure in real-or-random (ROR) model and Burrows–Abadi–Needham (BAN) logic, resisting known attacks while incurring low communication and computation costs.

Security and Communication Networks•Mar 11, 2022•23 citations
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).
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) 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.
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.
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.
The immense potential of the Internet of Things (IoT) is challenged by grave security vulnerabilities that are easily exploitable in resource-constrained environments. We propose a lightweight Authentication and Key Agreement (AKA) protocol to derive a shared session key for each communicating node in amutually communicating cluster of IoT nodes. Each IoT device is embedded with a Physically Unclonable Function (PUF), and a Fuzzy Extractor (FE) is deployed to correct and reproduce the private key and public helper data pair from the possibly erroneous PUF response. This secret raw PUF response is not stored explicitly in the server. A forward-secure authenticated key agreement is achieved by incorporating Elliptic Curve Diffie-Hellman Key Exchange (ECDH) protocol. The security of the proposed scheme has been formally verified while considering both active and passive attackers using the Verifpal tool. A prototype implementation with the Arbiter PUF circuit, FE, and associated software has successfully demonstrated the efficacy of our scheme.
The Internet of Things (IoT) is among the most promising technologies of the future, and its development has garnered attention worldwide. However, the rise of the IoT has been accompanied by a proportionate increase in security concerns regarding communication between IoT entities. Recently, Alzahrani et al. proposed an identity-based authentication and key agreement protocol for an IoT environment, wherein a physically unclonable function was employed. They claimed that their protocol can resist various types of attacks; however, after thorough analysis, we determined it to be ineffective against privileged internal attacks, physical IoT device capture attacks, stolen-verifier attacks, and known temporary information exposure attacks. To resolve these security weaknesses, we propose a new authentication and key agreement protocol. In addition, we demonstrate that the proposed protocol is provably secure in real-or-random (ROR) model and Burrows–Abadi–Needham (BAN) logic, resisting known attacks while incurring low communication and computation costs.