Abstract:

By combining the advantages of blind signatures with proxy signatures, a proxy blind signature can be widely applied in many fields, such as ecommerce. Currently, most of the proposed proxy blind signature schemes only give some heuristic explanations without formal proof, and onemore forgery is seldom considered in many schemes. In the paper, we propose a novel efficient security model and a proxy blind signature scheme based on bilinear parings. The scheme is unforgeable against adaptive chosen message/warrant attacks under the Computational DiffieHellman assumption and ChosenTarget Computational DiffieHellman assumption in the random oracle model. The analysis shows that the proposed scheme can satisfy the main secure properties of a proxy blind signature. Furthermore, the scheme is more efficient than traditional ones.

Key words: proxy blind signature;bilinear pairing;random oracle model;one-more forgery