高效的无证书广义指定验证者聚合签名方案  

Certificateless-based efficient aggregate signature scheme with universal designated verifier

作　　者：张玉磊[1] 周冬瑞 李臣意 张永洁 王彩芬[1] 

机构地区：[1]西北师范大学计算机科学与工程学院,甘肃兰州730070 [2]甘肃卫生职业学院,甘肃兰州730000

出　　处：《通信学报》2015年第2期48-55,共8页Journal on Communications

基　　金：国家自然科学基金资助项目(61163038;61262056;61262057);甘肃省高等学校科研基金资助项目(2013A-014);西北师范大学青年教师科研能力提升计划基金资助项目(NWNU-LKQN-12-32)~~

摘　　要：研究无证书广义指定验证者聚合签名的安全模型,基于双线性映射提出无证书广义指定验证者聚合签名方案。在随机预言模型和计算Diffie-Hellman困难问题假设下,证明方案不仅可以抵抗无证书广义指定验证者聚合签名的3类伪造攻击,而且满足指定验证性和不可传递性。方案的聚合签名长度和单用户签名长度相当,签名公共验证和指定验证需要的双线性对数固定。The security model of the certificateless aggregate signature scheme with universal designated verifier was studied, and then a certificateless aggregate signature scheme with universal designated verifier using bilinear pairings was proposed. In the random oracle mode, based on the hardness of the computational Diffie-Hellman problem, the new scheme was proved to be secure against three attacks of certificateless aggregate signature scheme with universal designated verifier. Meanwhile, the scheme satisfies properties of strong designated verify and non-transferability. Furthermore, the length of final aggregate signature is equivalent as the length of signal user＇s signature, it is more efficient than others because the pairing computation is fixed among public verifies and designed verifies.

关 键 词：聚合签名 无证书签名 广义指定验证者 计算Diffie-Hellman困难问题 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]