This record is in review state, the data has not yet been validated.
Tightly-Secure Blind Signatures in Pairing-Free Groups
Loading...
Author / Producer
Date
2026-01-01
Publication Type
Conference Paper
ETH Bibliography
Citations
Scopus:
Altmetric
Data
Rights / License
Abstract
We construct the first blind signature scheme that achieves all of the following properties simultaneously:it is tightly secure under a standard (i.e., non-interactive, non-q-type) computational assumption,it does not require pairings,it does not rely on generic, non-black-box techniques (like generic NIZK proofs). it is tightly secure under a standard (i.e., non-interactive, non-q-type) computational assumption, it does not require pairings, it does not rely on generic, non-black-box techniques (like generic NIZK proofs). The third property enables a reasonably efficient solution, and in fact signatures in our scheme comprise 10 group elements and 29 Zp-elements. Our scheme starts from a pairing-based non-blind signature scheme (Abe et al., JoC 2023), and uses recent techniques of Chairattana-Apirom, Tessaro, and Zhu (CRYPTO 2024) to replace the pairings used in this scheme with non-interactive zero-knowledge proofs in the random oracle model. This conversion is not generic or straightforward (also because prior works have converted only significantly simpler signature schemes), and we are required to improve upon and innovate existing techniques in several places. As an interesting side note, and unlike previous works, our techniques only require a non-programmable random oracle, and our signature scheme achieves predicate blindness (which means that the user can prove statements about the signed message during the signing process).
Permanent link
Publication status
External links
Editor
Book title
Journal / series
Lecture Notes in Computer Science
Volume
16250 LNCS
Pages / Article No.
337 - 369