一个高效的基于身份的聚合签名方案

聚合签名可以把n个签名者对n个不同消息的签名聚合成一个签名,从而能使n个签名的验证等式减少为一个验证等式.针对目前已有的基于身份的聚合签名方案效率和安全性不能兼顾这一问题,利用双线性对构造了一个安全高效的基于身份的聚合签名方案,在随机预言机模型下给出了方案的安全性证明,其安全性可紧的规约为计算Diffie-Hellman问题.与已有的基于身份的聚合签名相比,本文方案更能提高签名验证与传输效率,因签名的验证只需计算3个双线性对,签名的长度只有320 bits.

An Efficient Identity-Based Aggregate Signature Scheme

Security analyses of an ID-based aggregate signature scheme presented by Song, Kim, Lee and Yoon were given in this paper. It is found that the scheme is universally forgeable. We presented a new identity-based aggregate signature scheme from 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, our 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 our scheme is only about 320 bits.