Efficient Two-Move Blind Signatures in the Common Reference String Model

E.  Ghadafi; N. P.  Smart

Paper 2010/568

Efficient Two-Move Blind Signatures in the Common Reference String Model

E. Ghadafi and N. P. Smart

Abstract

Blind signatures provide a mechanism for achieving privacy and anonymity whereby a user gets the signer to sign a message of his choice without the signer learning the content of the message, nor linking message/signature request pairs when he sees the nal signature. In this paper, we construct a blind signature that requires minimal interaction (two moves) between the user and the signer, and which results in a signature which is a signature with respect to a standard (i.e. non-blind) signature scheme. The signature request protocol is akin to the classic, blind-unblind methodology used for RSA blind signatures in the random oracle model; whilst the output signature is a standard Camenisch-Lysyanskaya signature in bilinear groups. The scheme is secure in the common reference string model, assuming a discrete logarithm related assumption in bilinear groups; namely a new variant of the LRSW assumption. We provide evidence for the hardness of our new variant of the LRSW by showing it is intractable in the generic group model.

Note: -

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: Blind signatures
Contact author(s): nigel @ cs bris ac uk
History: 2012-01-16: last of 4 revisions; 2010-11-08: received; See all versions
Short URL: https://ia.cr/2010/568
License: CC BY

BibTeX

@misc{cryptoeprint:2010/568,
      author = {E.  Ghadafi and N. P.  Smart},
      title = {Efficient Two-Move Blind Signatures in the Common Reference String Model},
      howpublished = {Cryptology {ePrint} Archive, Paper 2010/568},
      year = {2010},
      url = {https://eprint.iacr.org/2010/568}
}