Paper 2023/1810
Pairing-Free Blind Signatures from Standard Assumptions in the ROM
, Department of Computer Science, ETH Zürich, Switzerland, DIENS, Ecole normale superieure, CNRS, Inria, PSL University, Paris, France, Department of Computer Science, ETH Zürich, SwitzerlandAbstract
Blind Signatures are a useful primitive for privacy preserving applications such as electronic payments, e-voting, anonymous credentials, and more. However, existing practical blind signature schemes based on standard assumptions require either pairings or lattices. We present the first construction of a round-optimal blind signature in the random oracle model based on standard assumptions without resorting to pairings or lattices. In particular, our construction is secure under the strong RSA assumption and DDH (in pairing-free groups). For our construction, we provide a NIZK-friendly signature based on strong RSA, and efficiently instantiate Fischlin's generic framework (CRYPTO'06). Our Blind Signature scheme has signatures of size 4.28 KB and communication cost 62.19 KB. On the way, we develop techniques that might be of independent interest. In particular, we provide efficient relaxed range-proofs with subversion zero-knowledge and compact commitments to elements of arbitrary groups.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- Blind SignaturesZero-knowledge Proofs
- Contact author(s)
-
julia kastner @ inf ethz ch
ky nguyen @ ens psl eu
michael reichle @ inf ethz ch - History
- 2023-11-24: approved
- 2023-11-23: received
- See all versions
- Short URL
- https://ia.cr/2023/1810
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1810,
author = {Julia Kastner and Ky Nguyen and Michael Reichle},
title = {Pairing-Free Blind Signatures from Standard Assumptions in the ROM},
howpublished = {Cryptology ePrint Archive, Paper 2023/1810},
year = {2023},
note = {\url{https://eprint.iacr.org/2023/1810}},
url = {https://eprint.iacr.org/2023/1810}
}
