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 computer science

Lattice Signature with Efficient Protocols, Application to Anonymous Credentials

Corentin Jeudy, Adeline Roux-Langlois, Olivier Sanders

Published Jan 1, 2023• 36 citations
Publisher
DOI
10.1007/978-3-031-38545-2_12

Related papers

LSEP-AC: A SEP-based Anonymous Credential from Lattice

Xian Guo, Xianzhen Chen, Wenjuan Jia +3 more

The Anonymous credential is a fundamental cryptographic primitive for privacy-preserving authentication. Anonymos credentials based on signatures with efficient protocols (SEP) have attracted considerable attention due to their efficiency and compatibility with practical systems. However, most existing SEP-based anonymous credentials rely on classical hardness assumptions and are therefore not expected to withstand quantum adversaries, while post-quantum SEP instantiations remain limited in both number and efficiency. To address these limitations, a novel SEP-based anonymous credential (LSEP-AC) is proposed based on lattice-based cryptographic primitives such as the Plover signature, the LNP framework, and the Ajtai commitment in this paper. In the random oracle model, we formally prove that our LSEP-AC satisfies security properties, including correctness, anonymity, and unforgeability. The theoretical analysis and experimental evaluation both show that the anonymous credential size of the LSEP-AC is about 89.75 KB for 128 bit-security. The total verification key size of the user and issuer is around 2.52 KB, and the total secret key size of the user and issuer is around 7.74 KB, which exhibits significant advantages over related schemes.

•Feb 20, 2026•0 citations

An Efficient Lattice-Based Signature Scheme with Provably Secure Instantiation

Sedat Akleylek, Nina Bindel, Johannes A Buchmann +2 more

Lecture notes in computer science•Jan 1, 2016•76 citations

Efficient Identity-Based Signature from Lattices

Miaomiao Tian, Liusheng Huang

IFIP advances in information and communication technology•Jan 1, 2014•31 citations

Post-Quantum Issuer-Hiding Anonymous Credential Scheme

Anh The Ta, Chi-Kin Chau

Anonymous credential schemes are a key application in modern cryptography. Recent research has advanced these schemes by incorporating issuer-hiding capabilities, which prevent the disclosure of the credential issuer’s identity. While several issuer-hiding anonymous credential schemes exist, none offer resilience against quantum computing adversaries. To address this gap, we propose a post-quantum issuer-hiding anonymous credential scheme, building on the recent work known as ring referral (S&P ’25), which allows anonymous signatures from third-party signers. Ring referral is an integration of ring signature and anonymous credential schemes, enabling issuer-hiding anonymous credentials. In this paper, we present an efficient lattice-based ring referral scheme, which supports quantum-resistant security. Our scheme extends a recent lattice-based credential scheme (CCS ’24) via LNP proof system (CRYPTO ’22).

•Oct 13, 2025•0 citations

Improvement and Efficient Implementation of a Lattice-Based Signature Scheme

Rachid El Bansarkhani, Johannes A Buchmann

Lecture notes in computer science•Jan 1, 2014•60 citations

Efficient Implementation of a Post-Quantum Anonymous Credential Protocol

Olivier Blazy, Céline Chevalier, Guillaume Renaut +3 more

Authentication on the Internet usually has the drawback of leaking the identity of the users, or at least allowing to trace them from a server to another. Anonymous credentials overcome this issue, by allowing users to reveal the attributes necessary for the authentication, without revealing any other information (in particular not their identity). In this article, we provide a generic framework to construct anonymous credential schemes and use it to give a concrete construction of post-quantum (lattice-based) anonymous credential protocol. Our protocol thus allows for long-term security even when one considers the emergence of quantum computers able to break widely used traditional computational assumptions, such as RSA, the discrete logarithm or Diffie-Hellman. We also give a concrete implementation of our protocol, which is only one order of magnitude slower and bandwidth consuming than previous anonymous credentials that are not post-quantum.

International Conference on Availability, Reliability and Security (ARES)•Aug 9, 2023•9 citations
The Anonymous credential is a fundamental cryptographic primitive for privacy-preserving authentication. Anonymos credentials based on signatures with efficient protocols (SEP) have attracted considerable attention due to their efficiency and compatibility with practical systems. However, most existing SEP-based anonymous credentials rely on classical hardness assumptions and are therefore not expected to withstand quantum adversaries, while post-quantum SEP instantiations remain limited in both number and efficiency. To address these limitations, a novel SEP-based anonymous credential (LSEP-AC) is proposed based on lattice-based cryptographic primitives such as the Plover signature, the LNP framework, and the Ajtai commitment in this paper. In the random oracle model, we formally prove that our LSEP-AC satisfies security properties, including correctness, anonymity, and unforgeability. The theoretical analysis and experimental evaluation both show that the anonymous credential size of the LSEP-AC is about 89.75 KB for 128 bit-security. The total verification key size of the user and issuer is around 2.52 KB, and the total secret key size of the user and issuer is around 7.74 KB, which exhibits significant advantages over related schemes.
Anonymous credential schemes are a key application in modern cryptography. Recent research has advanced these schemes by incorporating issuer-hiding capabilities, which prevent the disclosure of the credential issuer’s identity. While several issuer-hiding anonymous credential schemes exist, none offer resilience against quantum computing adversaries. To address this gap, we propose a post-quantum issuer-hiding anonymous credential scheme, building on the recent work known as ring referral (S&P ’25), which allows anonymous signatures from third-party signers. Ring referral is an integration of ring signature and anonymous credential schemes, enabling issuer-hiding anonymous credentials. In this paper, we present an efficient lattice-based ring referral scheme, which supports quantum-resistant security. Our scheme extends a recent lattice-based credential scheme (CCS ’24) via LNP proof system (CRYPTO ’22).
Authentication on the Internet usually has the drawback of leaking the identity of the users, or at least allowing to trace them from a server to another. Anonymous credentials overcome this issue, by allowing users to reveal the attributes necessary for the authentication, without revealing any other information (in particular not their identity). In this article, we provide a generic framework to construct anonymous credential schemes and use it to give a concrete construction of post-quantum (lattice-based) anonymous credential protocol. Our protocol thus allows for long-term security even when one considers the emergence of quantum computers able to break widely used traditional computational assumptions, such as RSA, the discrete logarithm or Diffie-Hellman. We also give a concrete implementation of our protocol, which is only one order of magnitude slower and bandwidth consuming than previous anonymous credentials that are not post-quantum.