This paper puts forward a secure construction of certificateless aggregate signature scheme using bilinear maps. The security of our scheme is based on the infeasibility of the Computational Diffie-Hellman problem and is formally proven in the strongest security model of certificateless aggregate signature schemes. Due to its security and free of certificate management, it may have practical applications in many-to-one communications.