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

Cryptography

On Advances of Anonymous Credentials—From Traditional to Post-Quantum

Madusha Chathurangi, Qinyi Li, Ernest Foo

Published Jan 26, 2025• 6 citations
Publisher

Abstract

Anonymous credential (AC) systems are privacy-preserving authentication mech-anisms that allow users to prove that they have valid credentials anonymously. These systems provide a powerful tool for several practical applications, such as anonymous pay-ment systems in e-commerce, preserving robust privacy protection for users. Most existing AC systems are constructed using traditional number-theoretic approaches, making them insecure under quantum attacks. With four decades of research in anonymous credential systems, there is a need for a comprehensive review that identifies the design structures of AC systems, organizes the research trends, and highlights unaddressed gaps for the future development of AC, especially bringing AC to post-quantum cryptography. This work is a complete study describing AC systems, as well as their architecture, components, security, and performance. Additionally, real-world implementations of various applications are identified, analyzed, and compared according to the design structure. Lastly, the challenges hindering the shift toward the quantumly secure lattice-based AC designs are discussed.

DOI
10.3390/cryptography9010008

Related papers

Review of Privacy-Preserving and Anonymous Signature Schemes Resilient to Quantum Computing and Artificial Intelligence

Manish Singh, Tapan Kumar Jain, Shankar Bhattacharjee

Communication and networked systems rely heavily on cryptographic digital signatures to ensure message authenticity, integrity, and non-repudiation. However, rapid advancements in quantum computing and artificial intelligence (AI) have expanded the attack surface, posing significant threats to conventional public-key schemes such as RSA, DSA, and ECDSA. Quantum algorithms undermine their underlying hardness assumptions, while AI-driven techniques enable traffic analysis, side-channel inference, and behavioral pattern recognition. This review presents a structured analytical assessment of post-quantum signature schemes and privacy-preserving authentication mechanisms to address these dual threats. It evaluates lattice-based, hash-based, and zero-knowledge proof-based signatures, as well as anonymity-enhancing schemes such as ring and group signatures. A unified analytical framework is introduced to map cryptographic schemes to quantum and AI-assisted threat models, based on parameters such as security strength, anonymity, efficiency, and applicability. The analysis shows that lattice- and hash-based schemes provide strong quantum resistance, while privacy-preserving mechanisms enhance anonymity but introduce performance trade-offs. It also identifies a gap in integrating post-quantum cryptography with AI-resilient privacy mechanisms. The findings highlight the need for unified, future-ready cryptographic designs.

Defence Science Journal•Jun 22, 2026•0 citations

Practical Post-Quantum Signatures for Privacy

Sven Argo, Tim E. Güneysu, Corentin Jeudy +3 more

The transition to post-quantum cryptography has been an enormous challenge and effort for cryptographers over the last decade, with impressive results such as the future NIST standards. However, the latter has so far only considered central cryptographic mechanisms (signatures or KEM) and not more advanced ones, e.g., targeting privacy-preserving applications. Of particular interest is the family of solutions called blind signatures, group signatures and anonymous credentials, for which standards already exist, and which are deployed in billions of devices. Such a family does not have, at this stage, an efficient post-quantum counterpart although very recent works improved this state of affairs by offering two different alternatives: either one gets a system with rather large elements but a security proved under standard assumptions or one gets a more efficient system at the cost of ad-hoc interactive assumptions or weaker security models. Moreover, all these works have only considered size complexity without implementing the quite complex building blocks their systems are composed of. In other words, the practicality of such systems is still very hard to assess, which is a problem if one envisions a post-quantum transition for the corresponding systems/standards.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Dec 2, 2024•22 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

Security in Post-Quantum Era: A Comprehensive Survey on Lattice-Based Algorithms

Hien D. Nguyen, Samsul Huda, Yasuyuki Nogami +1 more

Lattice-based post-quantum cryptography (PQC) has attracted significant attention as a promising solution to the security challenges posed by quantum computing. Unlike traditional cryptographic algorithms, lattice-based schemes are expected to remain secure even in the face of quantum attacks, making them essential for future-proofing data security. Despite their strong theoretical foundations, lattice-based schemes face several practical challenges, particularly in optimizing performance and scalability for real-world applications. This survey provides a novel taxonomy that categorizes lattice-based PQC designs, emphasizing computational paradigms and security considerations. We systematically evaluated lattice-based PQC implementations on both software platforms, including central processing units and graphics processing units, as well as hardware platforms like field-programmable gate arrays and application-specific integrated circuits, highlighting their strengths and limitations. In addition, we explored the practical applications of lattice-based cryptography in fields such as secure communication, critical infrastructure, privacy-preserving data analytics, artificial intelligence, and trust and authentication systems. By offering a comprehensive overview of the current state of lattice-based PQC, this survey aims to provide valuable insights into the ongoing advancements and future research directions in the field as we transition to a post-quantum era.

IEEE Access•Jan 1, 2025•42 citations

Implementation and Extension of a Post-Quantum Anonymous Credential

Sherry Wang

With the development of quantum computers and quantum algorithms, many of our classical public-key cryptographic systems will be compromised. To circumvent this, one approach is to take our classical cryptographic systems and design them on mathematically hard problems for which no known quantum algorithms can provide a speedup. Our work revolves around one such cryptographic system, the anonymous credential protocol. In this thesis, we implement a post-quantum anonymous credential scheme, and extend it to include additional features like the disclosure of properties of attributes. We implement the protocol in Python, run a series of correctness tests, and then compare our work with implementations from the literature. We also outline a more complete picture of what adversarial models are needed for post-quantum security. The motivation behind our work is to build more usable, feature-intensive anonymous credential systems that are resistant to adversaries with quantum computing capabilities. We present our work as a step towards providing more easily accessiblesoftware for a larger audience to extend.

•May 1, 2026•0 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
Anonymous credential (AC) systems are privacy-preserving authentication mech-anisms that allow users to prove that they have valid credentials anonymously. These systems provide a powerful tool for several practical applications, such as anonymous pay-ment systems in e-commerce, preserving robust privacy protection for users. Most existing AC systems are constructed using traditional number-theoretic approaches, making them insecure under quantum attacks. With four decades of research in anonymous credential systems, there is a need for a comprehensive review that identifies the design structures of AC systems, organizes the research trends, and highlights unaddressed gaps for the future development of AC, especially bringing AC to post-quantum cryptography. This work is a complete study describing AC systems, as well as their architecture, components, security, and performance. Additionally, real-world implementations of various applications are identified, analyzed, and compared according to the design structure. Lastly, the challenges hindering the shift toward the quantumly secure lattice-based AC designs are discussed.
Communication and networked systems rely heavily on cryptographic digital signatures to ensure message authenticity, integrity, and non-repudiation. However, rapid advancements in quantum computing and artificial intelligence (AI) have expanded the attack surface, posing significant threats to conventional public-key schemes such as RSA, DSA, and ECDSA. Quantum algorithms undermine their underlying hardness assumptions, while AI-driven techniques enable traffic analysis, side-channel inference, and behavioral pattern recognition. This review presents a structured analytical assessment of post-quantum signature schemes and privacy-preserving authentication mechanisms to address these dual threats. It evaluates lattice-based, hash-based, and zero-knowledge proof-based signatures, as well as anonymity-enhancing schemes such as ring and group signatures. A unified analytical framework is introduced to map cryptographic schemes to quantum and AI-assisted threat models, based on parameters such as security strength, anonymity, efficiency, and applicability. The analysis shows that lattice- and hash-based schemes provide strong quantum resistance, while privacy-preserving mechanisms enhance anonymity but introduce performance trade-offs. It also identifies a gap in integrating post-quantum cryptography with AI-resilient privacy mechanisms. The findings highlight the need for unified, future-ready cryptographic designs.
The transition to post-quantum cryptography has been an enormous challenge and effort for cryptographers over the last decade, with impressive results such as the future NIST standards. However, the latter has so far only considered central cryptographic mechanisms (signatures or KEM) and not more advanced ones, e.g., targeting privacy-preserving applications. Of particular interest is the family of solutions called blind signatures, group signatures and anonymous credentials, for which standards already exist, and which are deployed in billions of devices. Such a family does not have, at this stage, an efficient post-quantum counterpart although very recent works improved this state of affairs by offering two different alternatives: either one gets a system with rather large elements but a security proved under standard assumptions or one gets a more efficient system at the cost of ad-hoc interactive assumptions or weaker security models. Moreover, all these works have only considered size complexity without implementing the quite complex building blocks their systems are composed of. In other words, the practicality of such systems is still very hard to assess, which is a problem if one envisions a post-quantum transition for the corresponding systems/standards.
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.
Lattice-based post-quantum cryptography (PQC) has attracted significant attention as a promising solution to the security challenges posed by quantum computing. Unlike traditional cryptographic algorithms, lattice-based schemes are expected to remain secure even in the face of quantum attacks, making them essential for future-proofing data security. Despite their strong theoretical foundations, lattice-based schemes face several practical challenges, particularly in optimizing performance and scalability for real-world applications. This survey provides a novel taxonomy that categorizes lattice-based PQC designs, emphasizing computational paradigms and security considerations. We systematically evaluated lattice-based PQC implementations on both software platforms, including central processing units and graphics processing units, as well as hardware platforms like field-programmable gate arrays and application-specific integrated circuits, highlighting their strengths and limitations. In addition, we explored the practical applications of lattice-based cryptography in fields such as secure communication, critical infrastructure, privacy-preserving data analytics, artificial intelligence, and trust and authentication systems. By offering a comprehensive overview of the current state of lattice-based PQC, this survey aims to provide valuable insights into the ongoing advancements and future research directions in the field as we transition to a post-quantum era.
With the development of quantum computers and quantum algorithms, many of our classical public-key cryptographic systems will be compromised. To circumvent this, one approach is to take our classical cryptographic systems and design them on mathematically hard problems for which no known quantum algorithms can provide a speedup. Our work revolves around one such cryptographic system, the anonymous credential protocol. In this thesis, we implement a post-quantum anonymous credential scheme, and extend it to include additional features like the disclosure of properties of attributes. We implement the protocol in Python, run a series of correctness tests, and then compare our work with implementations from the literature. We also outline a more complete picture of what adversarial models are needed for post-quantum security. The motivation behind our work is to build more usable, feature-intensive anonymous credential systems that are resistant to adversaries with quantum computing capabilities. We present our work as a step towards providing more easily accessiblesoftware for a larger audience to extend.
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).