Skip to Main content Skip to Navigation
Journal articles

Short Blind Signatures

Abstract : Blind signatures allow users to obtain signatures on messages hidden from the signer; moreover, the signer cannot link the resulting message/signature pair to the signing session. This paper presents blind signature schemes, in which the number of interactions between the user and the signer is minimal and whose blind signatures are short. Our schemes are defined over bilinear groups and are proved secure in the common-reference-string model without random oracles and under standard assumptions: CDH and the decision-linear assumption. (We also give variants over asymmetric groups based on similar assumptions.) The blind signatures are Waters signatures, which consist of 2 group elements. Moreover, we instantiate partially blind signatures, where the message consists of a part hidden from the signer and a commonly known public part, and schemes achieving perfect blindness. We propose new variants of blind signatures, such as signer-friendly partially blind signatures, where the public part can be chosen by the signer without prior agreement, 3-party blind signatures, as well as blind signatures on multiple aggregated messages provided by independent sources. We also extend Waters signatures to non-binary alphabets by proving a new result on the underlying hash function.
Document type :
Journal articles
Complete list of metadata
Contributor : David Pointcheval Connect in order to contact the contributor
Submitted on : Sunday, December 22, 2013 - 6:32:38 PM
Last modification on : Thursday, March 17, 2022 - 10:08:35 AM




Olivier Blazy, Georg Fuchsbauer, David Pointcheval, Damien Vergnaud. Short Blind Signatures. Journal of Computer Security, IOS Press, 2013, 21 (5), pp.627-661. ⟨10.3233/JCS-130477⟩. ⟨hal-00921915⟩



Record views