论文部分内容阅读
聚合签名可以把n个不同签名者对n个不同消息的n个签名聚合成一个签名,通过验证这一个签名就可以实现对n个签名的验证,即使得n个签名的验证等式减少为一个验证等式,从而实现了对消息签名的批量验证.无证书公钥密码体制解决了传统公钥密码体制中的证书管理问题以及基于身份密码体制中的密钥托管问题,由于聚合签名和无证书公钥密码体制的优点,无证书聚合签名方案成为了一个研究热点.本文基于双线性对构造了一个高效的无证书公钥密码体制下的聚合签名方案.在计算性Diffie-Hellman困难性假设下,无需分叉引理可在随机预言机模型中证明本文方案在类型I和类型II敌手的适应性选择消息攻击下是存在性不可伪造的.此外,本文方案签名长度仅有两个群元素,签名验证中仅需4个对运算(常数数量级)和n个标量乘运算.与已有的无证书聚合签名相比,本文方案具有快速的签名验证算法和较快的传输效率,适合带宽、存储和计算资源受限网络环境中的应用.
Aggregate signature can be n different signers for n different messages n signature into a signature, by verifying this signature can be achieved on the n signature verification, that even n signature verification equation reduced to one Verify the equation, so as to realize batch verification of message signature.The certificateless public key cryptosystem solves the problem of certificate management in traditional public key cryptosystem and key escrow problem in identity-based cryptosystem, Public key cryptosystem, certificate-free aggregate signature scheme becomes a research hotspot.Based on bilinear pairings, an efficient signature scheme of certificateless public-key cryptosystem is constructed.In the computational Diffie-Hellman hypothesis Without bifurcation, the proposed scheme can be proved to be existence-unforgetable in the random oracle model with type I and type II adversarial adaptive selective message attacks.In addition, the scheme signature length of this paper is only two groups of elements , Signature verification requires only four pairs of operations (constant order of magnitude) and n scalar multiplication operations.Compared with the existing certificateless aggregated signatures, this program Fast signature verification algorithm and fast transmission efficiency, suitable for bandwidth, storage and computing resources limited network environment applications.