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

Journal of Ambient Intelligence and Humanized Computing

Revisiting post-quantum hash proof systems over lattices for Internet of Thing authentications

Zengpeng Li, Jiuru Wang, Wenyin Zhang

Published Oct 11, 2019• 11 citations
Publisher
DOI
10.1007/s12652-019-01529-2

Related papers

Hash Proof Systems over Lattices Revisited

Fabrice Benhamouda, Olivier Blazy, Léo Ducas +1 more

Lecture notes in computer science•Jan 1, 2018•46 citations

Post-Quantum Verifiable Decryption Scheme for Internet of Thing-Based Consumer Electronic Edge Device

Ruihang Huang, Ashutosh Sharma

The Edge-computing era presents opportunities for the rapid development of the Internet of Things (IoT), where identity authentication is fundamental to ensuring IoT security. However, under post-quantum attacks, traditional identity authentication schemes that rely on signcryption to generate node keys face challenges due to the high number of IoT nodes. These schemes consume significant resources, making it difficult to meet the low-cost requirements of IoT. Against the backdrop of the rapid development of new media and the increasingly growing security demands for resource-constrained consumer electronic edge devices, a lightweight group signcryption authentication scheme based on lattice cryptography is proposed. During the key generation phase, an improved trapdoor diagonal matrix is designed, optimizing the preimage sampling algorithm required for key generation and reducing the total time needed to generate multiple keys. In the identity authentication phase, based on the leftover hash lemma and the properties of signcryption, the scheme allows for simultaneous signing and encryption of messages in a single logical step. A low-interaction protocol combining dot products and hash operations is proposed, enabling group leaders to perform access authentication on behalf of group members. Simulation results show that the scheme reduces the number of interactions required for IoT device access, lowers computational costs during identity authentication, and reduces the total cost of signcryption and un-signcryption by at least 7% compared to existing schemes. Additionally, it is demonstrated that this scheme can resist post-quantum attacks in IoT environments.

IEEE Transactions on Consumer Electronics•May 1, 2025•6 citations

Lattice-Based Cryptography for Internet-of-Things in Post-quantum Computing

Levi Palmer, Yousef Fazea

Lecture notes on data engineering and communications technologies•Jan 1, 2024•3 citations

Lattice-based cryptosystems for the security of resource-constrained IoT devices in post-quantum world: a survey

Kübra Seyhan, Tu N. Nguyen, Sedat Akleylek +1 more

Cluster Computing•Aug 13, 2021•71 citations

HPGS: An Efficient Hash-Based Post-Quantum Dynamic Group Signature for Industrial Internet of Things

Kaili Dou, Yanyan Han, Suheng Wei +3 more

Group signatures, due to their inherent advantages in anonymous authentication, have been widely adopted in privacy-preserving multi-device authentication and related scenarios, establishing themselves as a fundamental cryptographic building block for securing communications in Industrial Internet of Things (IIoT) systems. However, existing post-quantum group signature schemes suffer from excessively large signature sizes, lack of strong non-frameability, and insufficient privilege separation, making them difficult to meet the efficiency and security requirements of IIoT. To address these limitations, this paper proposes a hash-based post-quantum group signature scheme (HPGS) for IIoT, which employs the SPHINCS+variant CEDRUS and MPC-in-the-Head zero-knowledge proofs. Specifically, we optimize the zero-knowledge proof circuit and Merkle tree parameters, and introduce an epoch-based Merkle tree accumulator to constrain the signature size to the kilobyte scale while supporting dynamic enrollment and revocation. Next, we design a member self-key-generation mechanism, where each member independently generates the signing key and only registers a public commitment, guaranteeing strong non-frameability. Furthermore, we distribute credential issuance and signature opening to two independent entities, enforcing protocol-level privilege separation. Experimental results show that, under NIST Level 1 post-quantum security, the scheme achieves a signature size of 47.07 KB, an online signing time of 104 μs, and a verification time of 1.4 ms, outperforming existing schemes in signing speed, verification efficiency, and functional completeness.

IEEE Internet of Things Journal•Jan 1, 2026•0 citations

Novel proxy signature from lattice for the post-quantum internet of things

Luyao Wang, Chunguang Huang, Hai Ying Cheng

Journal of Ambient Intelligence and Humanized Computing•Jan 28, 2022•15 citations
The Edge-computing era presents opportunities for the rapid development of the Internet of Things (IoT), where identity authentication is fundamental to ensuring IoT security. However, under post-quantum attacks, traditional identity authentication schemes that rely on signcryption to generate node keys face challenges due to the high number of IoT nodes. These schemes consume significant resources, making it difficult to meet the low-cost requirements of IoT. Against the backdrop of the rapid development of new media and the increasingly growing security demands for resource-constrained consumer electronic edge devices, a lightweight group signcryption authentication scheme based on lattice cryptography is proposed. During the key generation phase, an improved trapdoor diagonal matrix is designed, optimizing the preimage sampling algorithm required for key generation and reducing the total time needed to generate multiple keys. In the identity authentication phase, based on the leftover hash lemma and the properties of signcryption, the scheme allows for simultaneous signing and encryption of messages in a single logical step. A low-interaction protocol combining dot products and hash operations is proposed, enabling group leaders to perform access authentication on behalf of group members. Simulation results show that the scheme reduces the number of interactions required for IoT device access, lowers computational costs during identity authentication, and reduces the total cost of signcryption and un-signcryption by at least 7% compared to existing schemes. Additionally, it is demonstrated that this scheme can resist post-quantum attacks in IoT environments.
Group signatures, due to their inherent advantages in anonymous authentication, have been widely adopted in privacy-preserving multi-device authentication and related scenarios, establishing themselves as a fundamental cryptographic building block for securing communications in Industrial Internet of Things (IIoT) systems. However, existing post-quantum group signature schemes suffer from excessively large signature sizes, lack of strong non-frameability, and insufficient privilege separation, making them difficult to meet the efficiency and security requirements of IIoT. To address these limitations, this paper proposes a hash-based post-quantum group signature scheme (HPGS) for IIoT, which employs the SPHINCS+variant CEDRUS and MPC-in-the-Head zero-knowledge proofs. Specifically, we optimize the zero-knowledge proof circuit and Merkle tree parameters, and introduce an epoch-based Merkle tree accumulator to constrain the signature size to the kilobyte scale while supporting dynamic enrollment and revocation. Next, we design a member self-key-generation mechanism, where each member independently generates the signing key and only registers a public commitment, guaranteeing strong non-frameability. Furthermore, we distribute credential issuance and signature opening to two independent entities, enforcing protocol-level privilege separation. Experimental results show that, under NIST Level 1 post-quantum security, the scheme achieves a signature size of 47.07 KB, an online signing time of 104 μs, and a verification time of 1.4 ms, outperforming existing schemes in signing speed, verification efficiency, and functional completeness.