Provably secure randomized blind aggregate signature scheme from bilinear pairing

Aggregate signatures are well-known technology in special areas where the signatures on n distinct messages generated by n distinct users need to be efficiently compressed to a single signature. Blind signature is an efficient technique to secure the user's privacy. It is very attractive for authentications in bandwidth-limited applications such as vehicle ad hoc networks and sensor networks to design a signature scheme with both properties of blinding and aggregate. However, as the best of our known, few research work have considered the combination of the aggregate signature and the blind signature or offered formal security proofs. In this paper, we present an randomized blind aggregate signature scheme with constant pairing computations, Furthermore, we provide concrete security proofs for the proposed scheme in the random oracle model under the Computational Diffie-Hellman assumption.