An Efficient Identity-based Aggregate Signature Scheme

An aggregate signature scheme can aggregate n signatures on n distinct messages from n distinct signers into a single signature.Thus,n verification equations can be reduced to one.Since the existing identity-based aggregate signature scheme can not achieve both high efficiency and safety simultaneously,a secure and efficient identity-based aggregate signature scheme was proposed using bilinear pairings.Its security proof was given in the random oracle model and it could be tightly reduced to computational Diffie-Hellman problem.Compared with the existing ID-based aggregate signature schemes,this scheme greatly improves the efficiency of signature communication and verification since the verification algorithm only requires 3 pairing evaluations and the size of the signature generated by this scheme is only about 320 bits.