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

Lecture notes in networks and systems

Quantum-defended Digital Signature on Lattice for IoT-enabled Systems

Daya Sagar Gupta, Lacchita Soni, H. Chandra

Published Jan 1, 2023• 1 citation
Publisher
DOI
10.1007/978-981-19-9719-8_26

Related papers

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•65 citations

Efficient Lattice-Based Digital Signatures for Embedded IoT Systems

Maksim Iavich, Nursulu A. Kapalova, Kairat Sakan

This paper offers a lattice-based digital signature construction, optimized for the provision of post-quantum security in resource-constrained environments, such as Internet of Things (IoT) devices. The offered scheme is built upon structured hardness assumptions, defined over polynomial rings that exhibit inherent algebraic symmetry. By exploiting the cyclic properties of these ring structures and implementing efficient Number Theoretic Transforms (NTTs), the construction achieves compact signatures that are under 3 KB and a runtime feasibility that uses less than 10 KB of RAM. The signature generation process incorporates balanced rejection sampling and carefully designed polynomial encodings that preserve structural regularity and computational efficiency. The security of the offered scheme is proven. The benchmark results generated from using the ARM Cortex-M4 platform demonstrate its practical usability. This study highlights how symmetric algebraic frameworks based on lattice-based cryptography can be leveraged to achieve both theoretical security and real-world performance in the post-quantum era.

Symmetry•Sep 12, 2025•4 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•2 citations

Proxy Signature for Sensor Networks against Cyber Attack

Jinbin Zheng, Huang Zhang, Baodian Wei +2 more

The Internet of Things (IoT) needs complex sensor networks.The increasing number of sensors and their networks underlines the importance of network security.Traditional digital signature schemes validate signatures from each node of networks, which need huge resources for storage and computation.To reduce the resources needed for security, a new scheme with a proxy signature is proposed.If an IoT application adopts the scheme and assigns its signing rights to the underlying nodes, the storage of their public keys is no longer necessary as the application trusts the signing rights.The development of computing technology introduces many risks to cryptographic schemes with a traditional digital signature, and a system with improved security at the quantum-resistant level is required.We propose a scheme with lattice-based cryptography using the bonsai-tree technique for a security system.The new scheme effectively protects the system from a chosen static message attack in the standard model.In the new scheme, an IoT application securely recognizes its honest nodes in the underlying sensor networks at a low storage cost, even in quantum computing.

Sensors and Materials•May 10, 2021•2 citations

Improving Lattice-Based Cryptography for Post Quantum Security in IoT and Block Chain Communications

K. Selvamani, S. Kanimozhi, S.K. Muthusundar +2 more

Lecture notes in networks and systems•Jan 1, 2026•1 citation

Lattice-Based Certificateless Proxy Re-Signature for IoT: A Computation-and-Storage Optimized Post-Quantum Scheme

Zhanzhen Wei, Gongjian Lan, Hong Zhao +2 more

Proxy re-signature enables transitive authentication of digital identities across different domains and has significant application value in areas such as digital rights management, cross-domain certificate validation, and distributed system access control. However, most existing proxy re-signature schemes, which are predominantly based on traditional public-key cryptosystems, face security vulnerabilities and certificate management bottlenecks. While identity-based schemes alleviate some issues, they introduce key escrow concerns. Certificateless schemes effectively resolve both certificate management and key escrow problems but remain vulnerable to quantum computing threats. To address these limitations, this paper constructs an efficient post-quantum certificateless proxy re-signature scheme based on algebraic lattices. Building upon algebraic lattice theory and leveraging the Dilithium algorithm, our scheme innovatively employs a lattice basis reduction-assisted parameter selection strategy to mitigate the potential algebraic attack vectors inherent in the NTRU lattice structure. This ensures the security and integrity of multi-party communication in quantum-threat environments. Furthermore, the scheme significantly reduces computational overhead and optimizes signature storage complexity through structured compression techniques, facilitating deployment on resource-constrained devices like Internet of Things (IoT) terminals. We formally prove the unforgeability of the scheme under the adaptive chosen-message attack model, with its security reducible to the hardness of the corresponding underlying lattice problems.

Sensors•Aug 6, 2025•4 citations
This paper offers a lattice-based digital signature construction, optimized for the provision of post-quantum security in resource-constrained environments, such as Internet of Things (IoT) devices. The offered scheme is built upon structured hardness assumptions, defined over polynomial rings that exhibit inherent algebraic symmetry. By exploiting the cyclic properties of these ring structures and implementing efficient Number Theoretic Transforms (NTTs), the construction achieves compact signatures that are under 3 KB and a runtime feasibility that uses less than 10 KB of RAM. The signature generation process incorporates balanced rejection sampling and carefully designed polynomial encodings that preserve structural regularity and computational efficiency. The security of the offered scheme is proven. The benchmark results generated from using the ARM Cortex-M4 platform demonstrate its practical usability. This study highlights how symmetric algebraic frameworks based on lattice-based cryptography can be leveraged to achieve both theoretical security and real-world performance in the post-quantum era.
The Internet of Things (IoT) needs complex sensor networks.The increasing number of sensors and their networks underlines the importance of network security.Traditional digital signature schemes validate signatures from each node of networks, which need huge resources for storage and computation.To reduce the resources needed for security, a new scheme with a proxy signature is proposed.If an IoT application adopts the scheme and assigns its signing rights to the underlying nodes, the storage of their public keys is no longer necessary as the application trusts the signing rights.The development of computing technology introduces many risks to cryptographic schemes with a traditional digital signature, and a system with improved security at the quantum-resistant level is required.We propose a scheme with lattice-based cryptography using the bonsai-tree technique for a security system.The new scheme effectively protects the system from a chosen static message attack in the standard model.In the new scheme, an IoT application securely recognizes its honest nodes in the underlying sensor networks at a low storage cost, even in quantum computing.
Proxy re-signature enables transitive authentication of digital identities across different domains and has significant application value in areas such as digital rights management, cross-domain certificate validation, and distributed system access control. However, most existing proxy re-signature schemes, which are predominantly based on traditional public-key cryptosystems, face security vulnerabilities and certificate management bottlenecks. While identity-based schemes alleviate some issues, they introduce key escrow concerns. Certificateless schemes effectively resolve both certificate management and key escrow problems but remain vulnerable to quantum computing threats. To address these limitations, this paper constructs an efficient post-quantum certificateless proxy re-signature scheme based on algebraic lattices. Building upon algebraic lattice theory and leveraging the Dilithium algorithm, our scheme innovatively employs a lattice basis reduction-assisted parameter selection strategy to mitigate the potential algebraic attack vectors inherent in the NTRU lattice structure. This ensures the security and integrity of multi-party communication in quantum-threat environments. Furthermore, the scheme significantly reduces computational overhead and optimizes signature storage complexity through structured compression techniques, facilitating deployment on resource-constrained devices like Internet of Things (IoT) terminals. We formally prove the unforgeability of the scheme under the adaptive chosen-message attack model, with its security reducible to the hardness of the corresponding underlying lattice problems.