Abstract: Based on the hardness of the computational Diffie-Hellman problem, this paper proposed an identity-based proxy aggregate signature. hhe scheme not only owns all the secure properties of proxy signature, but also has merit of the aggregate signature. At last, the scheme's correctness was exactly proven in terms of bilinear pairing technique, and its security analysis was given in detail. It is indicated that this scheme is proven secure and reliable. Therefore, this scheme is secure and efficient.

Key words: Proxy aggregate signature, Identity based cryptography, Bilinear pairing, Computational DifficHcllman problem