无双线性对的部分盲代理重签名方案  

Partially Blind Proxy Re-Signature Scheme Without Bilinear Pairing

作　　者：牛淑芬 李文婷 王彩芬 NIU Shufen;LI Wenting;WANG Caifen(College of Computer Science and Engineering,Northwest Normal University,Lanzhou 730070,China)

机构地区：[1]西北师范大学计算机科学与工程学院,兰州730070

出　　处：《计算机工程》2020年第5期187-192,共6页Computer Engineering

基　　金：国家自然科学基金(61562077,61462077,61662071,61662069);甘肃省杰出青年基金(1308RJDA007);西北师范大学青年教师科研能力提升计划(NWNU-LKQN-14-7)。

摘　　要：针对盲代理重签名方案中的复杂双线性对运算及证书管理问题,借鉴WANG等人方案,基于大整数分解困难问题提出一种无双线性对的部分盲代理重签名方案,并在不同密码体制和部分盲性的框架下给出形式化定义及安全模型。该方案在随机预言模型中满足适应性选择消息下的不可伪造性和部分盲性,可实现签名从原始签名者到代理重签名者之间的透明转换,保护原始签名者的隐私,同时能够降低部分盲代理重签名算法的运算量,提高签名验证算法的运算效率。效率对比与分析结果表明,该方案在保证应用性的同时可有效增加部分盲性。To address complex bilinear pairing operations and certificate management problems of existing blind proxy re-signature schemes,by using WANG’s scheme for reference,this paper proposes a partially blind proxy re-signature scheme without bilinear pairing based on hard problem of integer factorization.Also,the new formalized definition and security model of the scheme are given under different cryptosystems and the framework of partial blindness.In the random oracle model,the scheme satisfies the unforgeability and partial blindness under adaptive chosen message attacks,and is able to achieve the transparent conversion from the original signer to the proxy re-signer,so as to protect privacy of the original signer and reduce the computational complexity of the partially blind proxy re-signature algorithm,and improve the computational efficiency of the signature verification algorithm.Efficiency comparison and analysis results show that the proposed scheme can ensure applicability while effectively improving partial blindness.

关 键 词：基于身份的代理重签名 部分盲签名 大整数分解 不可伪造性 随机预言模型 

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