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

Lattice-based verifiably encrypted group signatures

Peidong Guan, Shuai Wang

Published Jan 7, 2026• 0 citations
Publisher

Abstract

Abstract Verifiably encrypted signature (VES) schemes are extensively utilized in fair exchange which combine the features of encryption and signature, aiming to provide a solution that can not only verify the validity of signatures but also safeguard the privacy of signatures. With the development of quantum algorithms and quantum computing, it is necessary to construct a VES protocol that can resist attack of quantum computing. At the same time, some new security properties can also be added to the VES protocol to enhance its security. To reach this goal, we propose a state-of-the-art lattice-based verifiably encrypted group signature (VEGS) scheme. In the random oracle model, the VEGS scheme is provably secure under the assumptions of learning with error (LWE) and inhomogeneous small integer solution (ISIS). Our scheme provides five security properties, namely unforgeability, opacity, extractability, anonymity and traceability. The three properties unforgeability, opacity and extractability are the properties that the VES protocol needs to meet, and the anonymity and traceability properties are additional security properties brought by combining with the group signature.

DOI
10.1186/s42400-025-00526-7

Related papers

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

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

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

A Provably Secure Group Signature Scheme from Code-Based Assumptions.

Martianus Frederic Ezerman, Hyung Tae Lee, San Ling +2 more

Abstract. We solve an open question in code-based cryptography by introducing the first provably secure group signature scheme from code-based assumptions. Specifically, the scheme satisfies the CPA-anonymity and traceability requirements in the random oracle model, assuming the hardness of the McEliece problem, the Learning Parity with Noise prob-lem, and a variant of the Syndrome Decoding problem. Our construction produces smaller key and signature sizes than the existing post-quantum group signature schemes from lattices, as long as the cardinality of the underlying group does not exceed the population of the Netherlands ( ≈ 224 users). The feasibility of the scheme is supported by implementa-tion results. Additionally, the techniques introduced in this work might be of independent interest: a new verifiable encryption protocol for the randomized McEliece encryption and a new approach to design formal security reductions from the Syndrome Decoding problem.

•Jan 1, 2015•0 citations

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

Verifier-local revocation group signatures with backward unlinkability from lattices

Yanhua Zhang, Ximeng Liu, Yupu Hu +2 more

For group signature (GS) supporting membership revocation, verifier-local revocation (VLR) mechanism seems to be a more flexible choice, because it requires only that verifiers download up-to-date revocation information for signature verification, and the signers are not involved. As a post-quantum secure cryptographic counterpart of classical number-theoretic cryptographic constructions, the first lattice-based VLR group signature (VLR-GS) was introduced by Langlois et al. (2014). However, none of the contemporary lattice-based VLR-GS schemes provide backward unlinkability (BU), which is an important property to ensure that previously issued signatures remain anonymous and unlinkable even after the corresponding signer (i.e., member) is revoked. In this study, we introduce the first lattice-based VLR-GS scheme with BU security (VLR-GS-BU), and thus resolve a prominent open problem posed by previous works. Our new scheme enjoys an $${\cal O}\left( {\log \,N} \right)$$ factor saving for bit-sizes of the group public-key (GPK) and the member’s signing secret-key, and it is free of any public-key encryption. In the random oracle model, our scheme is proven secure under two well-known hardness assumptions of the short integer solution (SIS) problem and learning with errors (LWE) problem.

Frontiers of Information Technology & Electronic Engineering•Jun 1, 2022•7 citations
Abstract Verifiably encrypted signature (VES) schemes are extensively utilized in fair exchange which combine the features of encryption and signature, aiming to provide a solution that can not only verify the validity of signatures but also safeguard the privacy of signatures. With the development of quantum algorithms and quantum computing, it is necessary to construct a VES protocol that can resist attack of quantum computing. At the same time, some new security properties can also be added to the VES protocol to enhance its security. To reach this goal, we propose a state-of-the-art lattice-based verifiably encrypted group signature (VEGS) scheme. In the random oracle model, the VEGS scheme is provably secure under the assumptions of learning with error (LWE) and inhomogeneous small integer solution (ISIS). Our scheme provides five security properties, namely unforgeability, opacity, extractability, anonymity and traceability. The three properties unforgeability, opacity and extractability are the properties that the VES protocol needs to meet, and the anonymity and traceability properties are additional security properties brought by combining with the group signature.
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.
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
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.
Abstract. We solve an open question in code-based cryptography by introducing the first provably secure group signature scheme from code-based assumptions. Specifically, the scheme satisfies the CPA-anonymity and traceability requirements in the random oracle model, assuming the hardness of the McEliece problem, the Learning Parity with Noise prob-lem, and a variant of the Syndrome Decoding problem. Our construction produces smaller key and signature sizes than the existing post-quantum group signature schemes from lattices, as long as the cardinality of the underlying group does not exceed the population of the Netherlands ( ≈ 224 users). The feasibility of the scheme is supported by implementa-tion results. Additionally, the techniques introduced in this work might be of independent interest: a new verifiable encryption protocol for the randomized McEliece encryption and a new approach to design formal security reductions from the Syndrome Decoding problem.
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.
For group signature (GS) supporting membership revocation, verifier-local revocation (VLR) mechanism seems to be a more flexible choice, because it requires only that verifiers download up-to-date revocation information for signature verification, and the signers are not involved. As a post-quantum secure cryptographic counterpart of classical number-theoretic cryptographic constructions, the first lattice-based VLR group signature (VLR-GS) was introduced by Langlois et al. (2014). However, none of the contemporary lattice-based VLR-GS schemes provide backward unlinkability (BU), which is an important property to ensure that previously issued signatures remain anonymous and unlinkable even after the corresponding signer (i.e., member) is revoked. In this study, we introduce the first lattice-based VLR-GS scheme with BU security (VLR-GS-BU), and thus resolve a prominent open problem posed by previous works. Our new scheme enjoys an O(log⁡ N){\cal O}\left( {\log \,N} \right)O(logN) factor saving for bit-sizes of the group public-key (GPK) and the member’s signing secret-key, and it is free of any public-key encryption. In the random oracle model, our scheme is proven secure under two well-known hardness assumptions of the short integer solution (SIS) problem and learning with errors (LWE) problem.