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

Ghadafi, E.; Smart, N. P.

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

• Presentation Conference Type: Conference Paper (published)
• Acceptance Date: Sep 8, 2012
• Publication Date: Oct 8, 2012
• Deposit Date: Mar 23, 2017
• Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
• Print ISSN: 0302-9743
• Publisher: Springer Verlag
• Peer Reviewed: Peer Reviewed
• Volume: 7483 LNCS
• Pages: 274-289
• Book Title: Information Security
• ISBN: 9783642333828
• DOI: https://doi.org/10.1007/978-3-642-33383-5_17
• Keywords: efficient, two-move blind signatures, common reference string model
• Public URL: https://uwe-repository.worktribe.com/output/943985
• Publisher URL: http://dx.doi.org/10.1007/978-3-642-33383-5_17
• Contract Date: Mar 23, 2017