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

IEEE Transactions on Consumer Electronics

Event-Oriented Linkable Group Signature From Lattice

Yongli Tang, Deng Pan, Qing Ye, Yuanhong Li, Jinxia Yu

Published Feb 1, 2024• 11 citations
Publisher

Abstract

With the ever-increasing volume of transactions on e-commerce platforms, the protection of consumer privacy becomes a paramount concern. In this context, group signatures have proven to be an effective tool for the privacy-preserving of consumers. However, conventional group signature schemes are unable to effectively and flexibly control the number of user signatures. Moreover, with the advent of the post-quantum era, the existing cryptographic systems for electronic consumer systems, which rely on traditional number theory, will be undermined by quantum computation. This paper presents an event-oriented linkable group signature scheme from lattice that introduces a higher degree of flexibility in terms of signature control. Then, we prove its security in the random oracle model and based on the hardness of module short integer solution and module learning with errors. The security analysis shows that the scheme respectively achieves quantum security levels of 93-bit and 207-bit for two selected parameter sets. We have also evaluated the storage and time cost of the scheme, which indicates that our scheme is quite practical and could have a promising future in the consumer electronics sector.

DOI
10.1109/tce.2024.3364188

Related papers

Traceable Signatures using Lattices

Thakkalapally Preethi, B. B. Amberker

Traceable Signatures is an extension of group signatures that allow tracing of all signatures generated by a particular group member without violating the privacy of remaining members. It also allows members to claim the ownership of previously signed messages. Till date, all the existing traceable signatures are based on number-theoretic assumptions which are insecure in the presence of quantum computers. This work presents the first traceable signature scheme in lattices, which is secure even after the existence of quantum computers. Our scheme is proved to be secure in the random oracle model based on the hardness of Short Integer Solution and Learning with Errors

The International Arab Journal of Information Technology•Oct 22, 2020•1 citation

ML-GS: Module Lattice-Based Group Signature Scheme

Deng Pan, Yatao Yang, Weitao Sun +2 more

Abstract With the rapid growth of online users, protecting user privacy in access control scenarios has become a critical challenge in the field of information security. Group signatures serve as a fundamental cryptographic primitive that enables users to sign on behalf of a group, providing anonymity while supporting traceability of signers. However, traditional group signature schemes, which rely on number-theoretic assumptions vulnerable to quantum algorithms, face significant security threats in the advent of quantum computing. In this paper, we propose a module lattice-based group signature scheme (ML-GS). ML-GS leverages FIPS 204 standard, a recently standardized signature scheme by the National Institute of Standards Technology (NIST), and integrates a dualrejection-sampling signature mechanism with the K-PKE encryption scheme from FIPS 203 standard, forming a “sign-hybrid-encrypt” hybrid structure to ensure both efficiency and traceability. In the key generation phase, we introduce a module Gaussian preimage sampling algorithm that reduces public key size and supports dynamic user enrollment. The security of ML-GS is formally proven in the random oracle model under the Module Learning with Error (MLWE) and Module Short Integer Solution (MSIS) assumptions. Experimental results demonstrate that, compared to existing scheme with equivalent security level, the ML-GS scheme achieves significant improvements in both time and storage overhead.

Journal of Information assurance and security•Dec 1, 2025•0 citations

Lattice-based group signature scheme without random oracle

Thakkalapally Preethi, B. B. Amberker

Group signature is a cryptographic primitive where any member can anonymously sign a message on behalf of the population they belong to. Several group signatures were proposed based on number-theoretic assumptions. All these schemes are insecure in the presence of quantum computers. Group signatures based on lattice assumptions are believed to be quantum-resistant. In the past few years, group signatures based on lattice assumptions have been proposed and most of them are proved to be secure in random-oracle model. This paper presents a lattice-based group signature scheme without using random-oracle. Our scheme is based on correlation-intractable function ensembles for all evasive relations which are constructed recently based on well-defined assumptions. Security of our scheme is proved based on correlation-intractable function ensembles and hardness of Short Integer Solution and Learning With Errors problem.

Information Security Journal A Global Perspective•Jun 20, 2020•6 citations

Post-Quantum Identity-Based Linkable Ring Signcryption for Edge IoT Devices

Divyanshu Sinha, Sachin Kumar Gupta, Isha Das +6 more

With the rapid expansion of consumer electronics and the Internet of Things (IoT) ecosystem, ensuring secure communication in resource-constrained edge devices has become a critical challenge, especially under the threat of quantum attacks. Although lattice-based cryptographic schemes provide post-quantum security, they often suffer from large key storage and high computational overhead, limiting their applicability in edge environments. To address these challenges, we propose an identity-based linkable ring signcryption scheme constructed on the post quantum Lattice cryptography, tailored for edge-enabled IoT systems. The scheme employs a trapdoor generation algorithm to establish the master keys, utilizes compact Gaussian sampling to derive private keys for ring members, and integrates rejection sampling to generate user signatures with strong anonymity. Furthermore, a key encapsulation mechanism ensures identity protection during encryption. Security analysis under the Random Oracle Model (ROM) demonstrates the scheme's resistance to forgery and its linkability property. Performance evaluation shows that the proposed approach achieves smaller public keys, reduced encryption/decryption costs, and enhanced efficiency, making it well-suited for lightweight IoT and consumer electronics applications in the post-quantum era.

IEEE Transactions on Consumer Electronics•Jan 19, 2026•3 citations

Identity-Based Linkable Ring Signature on NTRU Lattice

Yongli Tang, Feifei Xia, Qing Ye +3 more

Although most existing linkable ring signature schemes on lattice can effectively resist quantum attacks, they still have the disadvantages of excessive time and storage overhead. This paper constructs an identity-based linkable ring signature (LRS) scheme over NTRU lattice by employing the technologies of trapdoor generation and rejection sampling. The security of this scheme relies on the small integer solution (SIS) problem on NTRU lattice. We prove that this scheme has unconditional anonymity, unforgeability, and linkability under the random oracle model (ROM). Through the performance analysis, this scheme has a shorter size of public/private keys, and when the number of ring members is small (such as N ≤ 8 ), this scheme has a shorter signature size compared with other existing latest lattice-based LRS schemes. The computational efficiency of signature has also been further improved since it only involves multiplication in the polynomial ring and modular operations of small integers. Finally, we implemented our scheme and other similar schemes, and it is shown that the time for the signature generation and verification of this scheme decreases roughly by 44.951% and 33.503%, respectively.

Security and Communication Networks•Sep 16, 2021•28 citations

A fully dynamic forward-secure group signature from lattice

Zhijian Liao, Qiong Huang, Xinjian Chen

Abstract A forward-secure group signature (FSGS) ensures the unforgeability of signatures in the past time period despite signing secret key is leaked in the current time period. As we know, traditional FSGS schemes are mostly relying on number-theoretic assumptions unable to resist quantum attacks. Therefore, we present an efficient lattice-based fully dynamic (i.e. users can flexibly join or quit the group) forward-secure group signature (DFSGS) by combining an improved version of FSGS scheme proposed by Ling. Based on an efficient zero-knowledge argument, we construct argument of knowledge of the committed value and the plaintext that help with privacy protection. Our DFSGS scheme is proved to be anonymous and forward-secure traceable relying on short integer solution and learning with errors assumptions in random oracle model. Moreover, the lengths of group public key and signature of our DFSGS scheme have been improved, and the length of user secret key has no connection with the quantity of group members.

Cybersecurity•Oct 2, 2022•7 citations
With the ever-increasing volume of transactions on e-commerce platforms, the protection of consumer privacy becomes a paramount concern. In this context, group signatures have proven to be an effective tool for the privacy-preserving of consumers. However, conventional group signature schemes are unable to effectively and flexibly control the number of user signatures. Moreover, with the advent of the post-quantum era, the existing cryptographic systems for electronic consumer systems, which rely on traditional number theory, will be undermined by quantum computation. This paper presents an event-oriented linkable group signature scheme from lattice that introduces a higher degree of flexibility in terms of signature control. Then, we prove its security in the random oracle model and based on the hardness of module short integer solution and module learning with errors. The security analysis shows that the scheme respectively achieves quantum security levels of 93-bit and 207-bit for two selected parameter sets. We have also evaluated the storage and time cost of the scheme, which indicates that our scheme is quite practical and could have a promising future in the consumer electronics sector.
Traceable Signatures is an extension of group signatures that allow tracing of all signatures generated by a particular group member without violating the privacy of remaining members. It also allows members to claim the ownership of previously signed messages. Till date, all the existing traceable signatures are based on number-theoretic assumptions which are insecure in the presence of quantum computers. This work presents the first traceable signature scheme in lattices, which is secure even after the existence of quantum computers. Our scheme is proved to be secure in the random oracle model based on the hardness of Short Integer Solution and Learning with Errors
Abstract With the rapid growth of online users, protecting user privacy in access control scenarios has become a critical challenge in the field of information security. Group signatures serve as a fundamental cryptographic primitive that enables users to sign on behalf of a group, providing anonymity while supporting traceability of signers. However, traditional group signature schemes, which rely on number-theoretic assumptions vulnerable to quantum algorithms, face significant security threats in the advent of quantum computing. In this paper, we propose a module lattice-based group signature scheme (ML-GS). ML-GS leverages FIPS 204 standard, a recently standardized signature scheme by the National Institute of Standards Technology (NIST), and integrates a dualrejection-sampling signature mechanism with the K-PKE encryption scheme from FIPS 203 standard, forming a “sign-hybrid-encrypt” hybrid structure to ensure both efficiency and traceability. In the key generation phase, we introduce a module Gaussian preimage sampling algorithm that reduces public key size and supports dynamic user enrollment. The security of ML-GS is formally proven in the random oracle model under the Module Learning with Error (MLWE) and Module Short Integer Solution (MSIS) assumptions. Experimental results demonstrate that, compared to existing scheme with equivalent security level, the ML-GS scheme achieves significant improvements in both time and storage overhead.
Group signature is a cryptographic primitive where any member can anonymously sign a message on behalf of the population they belong to. Several group signatures were proposed based on number-theoretic assumptions. All these schemes are insecure in the presence of quantum computers. Group signatures based on lattice assumptions are believed to be quantum-resistant. In the past few years, group signatures based on lattice assumptions have been proposed and most of them are proved to be secure in random-oracle model. This paper presents a lattice-based group signature scheme without using random-oracle. Our scheme is based on correlation-intractable function ensembles for all evasive relations which are constructed recently based on well-defined assumptions. Security of our scheme is proved based on correlation-intractable function ensembles and hardness of Short Integer Solution and Learning With Errors problem.
With the rapid expansion of consumer electronics and the Internet of Things (IoT) ecosystem, ensuring secure communication in resource-constrained edge devices has become a critical challenge, especially under the threat of quantum attacks. Although lattice-based cryptographic schemes provide post-quantum security, they often suffer from large key storage and high computational overhead, limiting their applicability in edge environments. To address these challenges, we propose an identity-based linkable ring signcryption scheme constructed on the post quantum Lattice cryptography, tailored for edge-enabled IoT systems. The scheme employs a trapdoor generation algorithm to establish the master keys, utilizes compact Gaussian sampling to derive private keys for ring members, and integrates rejection sampling to generate user signatures with strong anonymity. Furthermore, a key encapsulation mechanism ensures identity protection during encryption. Security analysis under the Random Oracle Model (ROM) demonstrates the scheme's resistance to forgery and its linkability property. Performance evaluation shows that the proposed approach achieves smaller public keys, reduced encryption/decryption costs, and enhanced efficiency, making it well-suited for lightweight IoT and consumer electronics applications in the post-quantum era.
Although most existing linkable ring signature schemes on lattice can effectively resist quantum attacks, they still have the disadvantages of excessive time and storage overhead. This paper constructs an identity-based linkable ring signature (LRS) scheme over NTRU lattice by employing the technologies of trapdoor generation and rejection sampling. The security of this scheme relies on the small integer solution (SIS) problem on NTRU lattice. We prove that this scheme has unconditional anonymity, unforgeability, and linkability under the random oracle model (ROM). Through the performance analysis, this scheme has a shorter size of public/private keys, and when the number of ring members is small (such as N ≤ 8 ), this scheme has a shorter signature size compared with other existing latest lattice-based LRS schemes. The computational efficiency of signature has also been further improved since it only involves multiplication in the polynomial ring and modular operations of small integers. Finally, we implemented our scheme and other similar schemes, and it is shown that the time for the signature generation and verification of this scheme decreases roughly by 44.951% and 33.503%, respectively.
Abstract A forward-secure group signature (FSGS) ensures the unforgeability of signatures in the past time period despite signing secret key is leaked in the current time period. As we know, traditional FSGS schemes are mostly relying on number-theoretic assumptions unable to resist quantum attacks. Therefore, we present an efficient lattice-based fully dynamic (i.e. users can flexibly join or quit the group) forward-secure group signature (DFSGS) by combining an improved version of FSGS scheme proposed by Ling. Based on an efficient zero-knowledge argument, we construct argument of knowledge of the committed value and the plaintext that help with privacy protection. Our DFSGS scheme is proved to be anonymous and forward-secure traceable relying on short integer solution and learning with errors assumptions in random oracle model. Moreover, the lengths of group public key and signature of our DFSGS scheme have been improved, and the length of user secret key has no connection with the quantity of group members.