Efficient and Provably-Secure Certificateless Aggregate Signature Scheme
Hongzhen Du, Meijuan Huang, Wen Qiao-yan · Dianzi xuebao · 2013
This paper proposes an efficient certificateless aggregate signature scheme from bilinear pairings.Its security proof is given in the random oracle model and it can be reduced to computational Diffie-Hellman problem.Compared with the existing certificateless aggregate signature schemes,our scheme drastically improves the efficiency of signature communication and verification since the verification algorithm only requires 4 pairings,and the length of the signature generated by our scheme is only about 320 bits,which is the shortest certificateless aggregate signature.