Provably secure randomized blind signature scheme based on bilinear pairing

Blind signature is a well-known technique used to construct some advanced applications for the consideration of user privacy. Various generic ideas and variants on blind signatures have been brought up so far, but few of them considered the randomization property or offered formal proofs. The concept of randomization can form a solution for reducing the threat of coercion or bribery in anonymous electronic voting systems based on blind signatures. This manuscript will present a blind signature scheme with randomization based on bilinear pairing primitives. Furthermore, we will also provide concrete security proofs for the required properties of the proposed scheme under the random oracle model.