Another Efficient Blind Signature Scheme Based on Bilinear Map

Blind signature is an important anonymous technique. In this paper, we propose an efficient short blind signature scheme from bilinear pairings. Our scheme has the following advantages: First, the round complexity of our blind signature scheme is optimal. Namely, each interactive signature generation requires the requesting user and the signer to transmit only one message each. Second, the proposed scheme is provably secure against generic parallel attack. Third, the signature size is short enough with only half of the DSA signature. As for efficiency of the scheme, no pairings operator is required in the blind signing phase and two pairing operators are only needed in the verification phase. Thus, our scheme is suitable for mobile device.