Abstract:

Aggregate signature is useful in special areas where the signatures on many different messages generated by many different users need to be aggregated. Since the existing certificate-based aggregate signature schemes cannot achieve high efficiency, a efficient certificate-based aggregate signature scheme from bilinear pairing was proposed. Under the random oracle model, the scheme was proved to be existentially unforgeable against adaptive chosen message and identity attacks, and the security could be reduced to Computational Diffie-Hellman (CDH) assumption. The analysis shows that the scheme has constant pairing computations, and only requires three pairing computations, thus it is efficient.

摘要：

聚合签名主要适用于需要将不同用户对不同消息的签名聚合成一个单一签名的场合。针对已有的基于证书聚合签名方案效率不高的问题，利用双线对构造了一个高效的基于证书聚合签名方案。在随机预言模型中证明了方案在适应性选择消息和身份攻击下是存在性不可伪造的，其安全性归约为计算Diffie-Hellman(CDH)困难问题。分析表明该方案的对运算是常量，而且只需3次双线性对运算，因此运算效率较高。