### Efficient Round Optimal Blind Signatures

Sanjam Garg and Divya Gupta

##### 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.

Available format(s)
Category
Public-key cryptography
Publication info
A major revision of an IACR publication in EUROCRYPT 2014
Keywords
Blind SignaturesRound ComplexityEfficiencyComplexity Leveraging
Contact author(s)
divyag @ cs ucla edu
History
Short URL
https://ia.cr/2014/081

CC BY

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},
note = {\url{https://eprint.iacr.org/2014/081}},
url = {https://eprint.iacr.org/2014/081}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.