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.
Category / Keywords: public-key cryptography / Blind Signatures, Round Complexity, Efficiency, Complexity Leveraging Original Publication (with major differences): IACR-EUROCRYPT-2014 Date: received 4 Feb 2014, last revised 4 Feb 2014 Contact author: divyag at cs ucla edu Available format(s): PDF | BibTeX Citation Version: 20140205:144326 (All versions of this report) Short URL: ia.cr/2014/081 Discussion forum: Show discussion | Start new discussion