Welcome to the resource topic for 2025/1886
Title:
Blind Signatures from Arguments of Inequality
Authors: Michael Klooß, Russell W. F. Lai, Michael Reichle
Abstract:Blind signatures are an important tool for privacy-preserving applications with a long history dating back to Chaum’s seminal work in Crypto’82. In this work, we focus on the Fiat-Shamir paradigm, i.e., blind signatures based on \Sigma-protocols compiled via Fiat-Shamir, in the random oracle model. We resolve the following open problems:
- We give the first lattice-based blind signature that is concurrently-secure based on the Fiat-Shamir paradigm.
- We give the first pairing-free blind signature that is concurrently-secure under the discrete logarithm assumption (without the algebraic group model).
On a technical level, our work is inspired by the recent proofs of inequality technique (Klooß and Reichle, Crypto’25). This technique relies on statistical puncturing of the verification key. We explore the technique in the computational regime and develop new proof and design techniques to tackle the challenges encountered along the way.
ePrint: https://eprint.iacr.org/2025/1886
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .