A Certificateless Aggregate Signature Scheme without Bilinear Pairing

Currently, the aggregate signature schemes were mostly designed by bilinear pairing, which leads to high computational overhead. Considering the environment of the space-ground integrated network, we propose a certificateless aggregated signature scheme, and we prove the security and unforgeability of our scheme using a random oracle model, where an adversary has an ability of the adaptive chosen-message attack. At the same time, this scheme does not need to specify an aggregate signature verifier, and breaks through the linear relationship between certificateless aggregate signatures in the traditional scheme. Therefore, the signature of our scheme has compactness, and the length has nothing to do with the number of users. Compared with the existing schemes, our scheme improves the verification efficiency, reduces the computing overhead, and is suitable for the network which has tight resources.