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

Tanuki: New Frameworks for (Concurrently Secure) Blind Signatures from Post-Quantum Group Actions

Lucjan Hanzlik, Yi-Fu Lai, Marzio Mula, Eugenio Paracucchi, Daniel Slamanig, Gang Tang

Published Dec 7, 2025• 11 citations
Publisher
DOI
10.1007/978-981-95-5113-2_2

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•9 citations

Post-quantum Adaptor Signatures with Strong Security from Cryptographic Group Actions

Ryann Cartor, Nathan Daly, Giulia Gaggero +3 more

Lecture notes in computer science•Jan 1, 2026•0 citations

A Secure Quantum Voting Scheme Based on Quantum Group Blind Signature

Zhang Xiao, Jian-Zhong Zhang, Shu-Cui Xie

International Journal of Theoretical Physics•Dec 19, 2019•20 citations

Quantum group blind signature scheme without entanglement

Rui Xu, Liusheng Huang, Wei Yang +1 more

Optics Communications•Apr 18, 2011•92 citations

Tanuki: New Frameworks for (Concurrently Secure) Blind Signatures from Post-Quantum Groups Actions.

Lucjan Hanzlik, Yi-Fu Lai, Marzio Mula +3 more

Blind signatures are fundamental cryptographic primitives enabling privacy-preserving authentication and have seen renewed interest in the post-quantum literature. Existing efficient constructions predominantly rely on Fischlin’s generic paradigm instantiated over lattice assumptions, while blinding techniques for Σ-protocol-based blind signatures remain sparse beyond lattices. Moreover, achieving provable concurrent security under polynomially many sessions has been a longstanding open challenge for this approach in the post-quantum literature as evidenced by the recent attacks in EC’24 and PKC’24. This work broadens the landscape of post-quantum blind signatures by introducing novel techniques and proposing four frameworks based on general cryptographic group actions, without requiring commutativity. Our constructions admit instantiations under diverse post-quantum assumptions, including CSIDH (isogeny-based), LESS (code-based, NIST round-two), and more. These frameworks offer flexible trade-offs in assumptions (from interactive one-more to the standard inversion problem) and key/signature sizes, and culminate in a construction that achieves security under polynomially many concurrent sessions. This enables the first efficient blind signatures from isogenies and codes with provable concurrent security with 4.5 and 64.7 KB respectively. We also outline several directions for optimization and further instantiations for future work.

•Jan 1, 2025•0 citations

Security Analysis of the Quantum (t, m, n) Threshold Group Blind Signature Scheme and its Improvement

Jiahao Zhang, Nian Xue, Hao Wang +4 more

International Journal of Theoretical Physics•Jan 8, 2025•2 citations
Blind signatures are fundamental cryptographic primitives enabling privacy-preserving authentication and have seen renewed interest in the post-quantum literature. Existing efficient constructions predominantly rely on Fischlin’s generic paradigm instantiated over lattice assumptions, while blinding techniques for Σ-protocol-based blind signatures remain sparse beyond lattices. Moreover, achieving provable concurrent security under polynomially many sessions has been a longstanding open challenge for this approach in the post-quantum literature as evidenced by the recent attacks in EC’24 and PKC’24. This work broadens the landscape of post-quantum blind signatures by introducing novel techniques and proposing four frameworks based on general cryptographic group actions, without requiring commutativity. Our constructions admit instantiations under diverse post-quantum assumptions, including CSIDH (isogeny-based), LESS (code-based, NIST round-two), and more. These frameworks offer flexible trade-offs in assumptions (from interactive one-more to the standard inversion problem) and key/signature sizes, and culminate in a construction that achieves security under polynomially many concurrent sessions. This enables the first efficient blind signatures from isogenies and codes with provable concurrent security with 4.5 and 64.7 KB respectively. We also outline several directions for optimization and further instantiations for future work.