Efficient Blind Signature Scheme Based on Modified Generalized Bilinear Inversion
As a special anonymous signature, the blindness of blind signatures makes it play an important role in electronic commerce. In this paper we first propose a novel blind signature scheme from bilinear pairings. Furthermore, we also give a formal proof of security for the proposed schemes in the random oracle model. And we show that the scheme satisfies the two properties of blind signature: blindness and unforgeability. As for efficiency of the scheme, the size of our blind signature is 320 bits, and no pairings operator are required in the blind signing phas and two pairing operators are needed I the verification phase.
J. H. Zhang et al., "Efficient Blind Signature Scheme Based on Modified Generalized Bilinear Inversion ", Key Engineering Materials, Vols. 439-440, pp. 1265-1270, 2010