Paper 2014/081 Original: eprint.iacr.org/2014/081 ↗
Efficient Round Optimal Blind Signatures
Abstract
Known constructions of blind signature schemes suffer from at least one of the following limitations: (1) rely on parties having access to a common reference string or a random oracle, (2) are not round-optimal, or (3) are prohibitively expensive. In this work, we construct the \emph{first} blind-signature scheme that does not suffer from any of these limitations. In other words, besides being round optimal and having a standard model proof of security, our scheme is very efficient. Specifically, in our scheme, one signature is of size $6.5$ KB and the communication complexity of the signing protocol is roughly $100$ KB. An amortized variant of our scheme has communication complexity less that $1$ KB.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2014-02-05: last updated
- 2014-02-05: published
- Short URL
- https://ia.cr/2014/081
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2014/081,
author = {Sanjam Garg and Divya Gupta},
title = {Efficient Round Optimal Blind Signatures},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/081},
year = {2014},
url = {https://eprint.iacr.org/2014/081}
}