A Provably Secure Certificate-Based Aggregate Signature Scheme

Aggregate signature is widely used in special occasions where the signatures on many different messages generated by many different users need to be compressed into one single signature. This paper presents an efficient certificate-based aggregate signature (CBAS) scheme from bilinear pairing. In the random oracle model, the new scheme is proven existentially unforgeable against adaptive chosen message attacks under the computational Diffie-Hellman assumption. The signature verification of the new scheme only needs constant pairing computations, which improves the efficiency of communication and computation, and it is more suitable for the applications in resource-constrained network environment.