提出了一种新的基于双线性对的无证书聚合签名方案。在随机预言机模型下,基于计算Diffie-Hellman困难问题假设,证明了新方案在AⅠ攻击者的公钥替换攻击和AⅡ攻击者的KGC攻击下是存在不可伪造的。分析结果表明,在计算效率方面,新方案的验证只需要三个对运算,不仅较已有聚合签名方案在效率上更具优势,而且满足聚合签名要求的所有性质。
This paper proposed a new certificateless aggregate signature based on bilinear pairings. The proposed scheme was proved to be existential unforgeable against type Ⅰ and type Ⅱ adaptively chose message and identity attacks in the random oracle model. In the sign and verification algorithm,the scheme only needs three pairing computation and it meets all the properties of an aggregate signature,thus it is more efficient than the known schemes in terms of computation.