New Construction of Efficient Certificateless Aggregate Signatures

This paper proposes a novel construction of efficient certificateless aggregate signature (CLAS) scheme. On basis of the computational Diffie-Hellman (CDH) assumption, the proposed scheme can be proven existentially unforgeable against adaptive chosen-message attacks. The new scheme also requires small constant pairing computations for aggregate verification, which is independent of the number of signers. Most importantly, a certain synchronization for aggregating randomness can be avoided by the proposed scheme. All the signers don't need to share the same synchronized clock to generate the aggregate signature, which greatly decreases the implementation complexity in many application scenarios.