Skip to main content

Research Repository

Advanced Search

Efficient two-move blind signatures in the common reference string model

Ghadafi, E.; Smart, N. P.


Essam Ghadafi
Senior Lecturer in Computer Science

N. P. Smart


D Gollmann

F.C Freiling


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 message, or being able to link a signature to the protocol run via which it was obtained. In this paper, we construct a blind signature scheme that requires minimal interaction (two moves) between the user and the signer, and which yields standard signatures. 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 assumption by showing it is intractable in the generic group model. © 2012 Springer-Verlag.


Ghadafi, E., & Smart, N. P. (2012). Efficient two-move blind signatures in the common reference string model. Lecture Notes in Artificial Intelligence, 7483 LNCS, 274-289.

Journal Article Type Conference Paper
Acceptance Date Sep 8, 2012
Publication Date Oct 8, 2012
Journal Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Print ISSN 0302-9743
Electronic ISSN 1611-3349
Publisher Springer Verlag
Peer Reviewed Peer Reviewed
Volume 7483 LNCS
Pages 274-289
Book Title Information Security
ISBN 9783642333828
Keywords efficient, two-move blind signatures, common reference string model
Public URL
Publisher URL

This file is under embargo due to copyright reasons.

You might also like

Downloadable Citations