A New ID-based Aggregate Signature with Constant Pairing Operations

Given n signatures on n distinct messages from n distinct users, aggregate signature scheme is possible to aggregate all these signature into a single short signature. In this paper, we propose an identity-based aggregate signature scheme which requires constant pairing operations in the verification. We prove that the proposed signature scheme is secure against existential forgery under adaptively chosen message and ID attack in the random oracle model assuming the intractability of the computational Diffie-Hellman problem.