摘要
基于无证书公钥密码体制的优点和多重数字签名的要求,设计了一个高效的无证书并行多重签名方案。方案需要的对运算与用户的数量无关,与其他基于双线性对技术的多重签名方案相比,具有较高的效率。在随机预言模型下,基于计算Diffie-Hellman困难问题假设,证明方案可以抵抗无证书并行多重签名中的两类攻击。
A new efficient certificateless parallel multi-signature scheme was proposed based on the advantages of certificateless public key cryptosystem and the demands of digital multi-signature.The efficiency of the proposed scheme relied on that the pairing computation was not related to the number of signature users.The scheme decreased the pairing's number and was more efficient than known multi-signature schemes based on bilinear pairing technology.Furthermore,under the random oracle model,relying on the hardness of the Computational Diffie-Hellman(CDH) problem,the new scheme was proved to be secure against two attackers of certificateless parallel multi-signature.
出处
《计算机应用》
CSCD
北大核心
2010年第A12期3337-3340,共4页
journal of Computer Applications
基金
教育部科学技术研究重点项目(208148)
甘肃省教育厅重点项目(0801-01)
甘肃省自然科学基金资助项目(096RJZA124)
西北师范大学青年教师科研基金资助项目(NWNU-LKQN-09-5)
关键词
无证书
并行多重签名
计算DH问题
随机预言模型
certificateless
parallel multi-signature
Computational Diffie-Hellman(CDH) problem
random oracle model
