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 Symposium on Security and Privacy (S&P)

Blinding Post-Quantum Hash-and-Sign Signatures

Charles Bouillaguet, Thibauld Feneuil, Jules Maire, Matthieu Rivain, Julia Sauvage, Damien Vergnaud

Published May 18, 2026• 0 citations
Publisher
DOI
10.1109/sp63933.2026.00032

Related papers

Non-Interactive Blind Signatures: Post-Quantum and Stronger Security

Foteini Baldimtsi, Jiaqi Cheng, Rishab Goyal +1 more

Lecture notes in computer science•Dec 10, 2024•5 citations

Lattice-Based Threshold Blind Signatures

Sebastian Faller, Guilhem Niot, Michael Reichle

Blind signatures are a central tool for privacy-preserving protocols. They allow users to obtain signatures from a signer without the signer seeing the signed message. For instance, it enables electronic cash: signatures correspond to coins which can be issued by the bank in a privacy-preserving manner via blind signing. To mitigate the risk of key compromise, threshold blind signatures allow the distribution of the signing key amongst N parties. While recent works have focused on improving the security of this primitive in the classical setting, no construction is known to date in the post-quantum setting. We present the first construction of a threshold blind signature secure in the post-quantum setting, based on lattices. We prove its security under an interactive variant of the SIS assumption introduced in [Agrawal et al., CCS’22]. Our construction has a reasonable overhead of a factor of roughly 1.4 X to 2.5 X in signature size over comparable non-threshold blind signatures over lattices under heuristic but natural assumptions.

IEEE Symposium on Security and Privacy (S&P)•May 18, 2026•1 citation

Practical Post-Quantum Signatures

Kwangjo Kim

SpringerBriefs in information security and cryptography•Jan 1, 2025•0 citations

Post-Quantum Blind Signature Schemes

Lukáš Belza

This work addresses the threat that quantum computers pose to conventional digital signatures. It focuses on remote signing scenarios, specifically in the context of national identification systems such as ID Austria. We propose a new blind signature scheme that is secure against quantum attacks, preserves user privacy, and supports remote signing. The construction uses a commitment scheme and a post-quantum digital signature. We formally define the security model and prove that the scheme satisfies the IND-CMA and EUF-CMA properties. We discuss a specific instance using the Dilithium algorithm and other PQ algorithms. The result is a practically deployable scheme suitable for electronic identification and digital services. A novelty is the combination of blind signatures with post-quantum signatures in a remote signing model and the proof of its security.

•Jan 1, 2026•0 citations

A Post-Quantum Multi-Signature Scheme

Chanyoung Ko, Youngkyung Lee, Kwangsu Lee +1 more

Information Security and Cryptology•Jan 1, 2021•0 citations

A survey on lattice-based digital signature

Fengxia Liu, Zhiyong Zheng, Zixian Gong +5 more

Abstract Lattice-based digital signature has become one of the widely recognized post-quantum algorithms because of its simple algebraic operation, rich mathematical foundation and worst-case security, and also an important tool for constructing cryptography. This survey explores lattice-based digital signatures, a promising post-quantum resistant alternative to traditional schemes relying on factoring or discrete logarithm problems, which face increasing risks from quantum computing. The study covers conventional paradigms like Hash-and-Sign and Fiat-Shamir, as well as specialized applications including group, ring, blind, and proxy signatures. It analyzes the versatility and security strengths of lattice-based schemes, providing practical insights. Each chapter summarizes advancements in schemes, identifying emerging trends. We also pinpoint future directions to deploy lattice-based digital signatures including quantum cryptography.

Cybersecurity•Apr 1, 2024•34 citations
Blind signatures are a central tool for privacy-preserving protocols. They allow users to obtain signatures from a signer without the signer seeing the signed message. For instance, it enables electronic cash: signatures correspond to coins which can be issued by the bank in a privacy-preserving manner via blind signing. To mitigate the risk of key compromise, threshold blind signatures allow the distribution of the signing key amongst N parties. While recent works have focused on improving the security of this primitive in the classical setting, no construction is known to date in the post-quantum setting. We present the first construction of a threshold blind signature secure in the post-quantum setting, based on lattices. We prove its security under an interactive variant of the SIS assumption introduced in [Agrawal et al., CCS’22]. Our construction has a reasonable overhead of a factor of roughly 1.4 X to 2.5 X in signature size over comparable non-threshold blind signatures over lattices under heuristic but natural assumptions.
This work addresses the threat that quantum computers pose to conventional digital signatures. It focuses on remote signing scenarios, specifically in the context of national identification systems such as ID Austria. We propose a new blind signature scheme that is secure against quantum attacks, preserves user privacy, and supports remote signing. The construction uses a commitment scheme and a post-quantum digital signature. We formally define the security model and prove that the scheme satisfies the IND-CMA and EUF-CMA properties. We discuss a specific instance using the Dilithium algorithm and other PQ algorithms. The result is a practically deployable scheme suitable for electronic identification and digital services. A novelty is the combination of blind signatures with post-quantum signatures in a remote signing model and the proof of its security.
Abstract Lattice-based digital signature has become one of the widely recognized post-quantum algorithms because of its simple algebraic operation, rich mathematical foundation and worst-case security, and also an important tool for constructing cryptography. This survey explores lattice-based digital signatures, a promising post-quantum resistant alternative to traditional schemes relying on factoring or discrete logarithm problems, which face increasing risks from quantum computing. The study covers conventional paradigms like Hash-and-Sign and Fiat-Shamir, as well as specialized applications including group, ring, blind, and proxy signatures. It analyzes the versatility and security strengths of lattice-based schemes, providing practical insights. Each chapter summarizes advancements in schemes, identifying emerging trends. We also pinpoint future directions to deploy lattice-based digital signatures including quantum cryptography.