无双线性对的基于身份代理重签名方案  

Identity-based proxy re-signature scheme without bilinear pairing

作　　者：黄萍[1] 杨小东[1] 李燕[1] 王彩芬[1] 

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

出　　处：《计算机应用》2015年第6期1678-1682,共5页journal of Computer Applications

基　　金：国家自然科学基金资助项目(61262057;61163038);国家档案局科技项目(2014-X-33);甘肃省科技计划项目(145RJDA325);甘肃省自然科学基金资助项目(1308RJYA039);兰州市科技计划项目(2013-4-22)

摘　　要：针对基于身份双向代理重签名方案需要复杂双线性对运算的问题,利用哈希函数提出了一种无双线性对的基于身份代理重签名方案。在离散对数困难问题的假设下,证明了该方案在自适应性选择消息攻击下是不可伪造的。该方案具有双向性、多用性、透明性和密钥最优性,避免了双线性对运算。与基于身份的双向代理重签名方案——Shao方案相比,所提方案能够有效降低重签名算法的计算复杂度,提高签名验证算法的计算效率。作为该方案的一个延伸,在其基础上构造了一个聚合代理重签名方案,能将同一时间段内的重签名进行聚合,大大降低了通信带宽。The existing identity-based bidirectional proxy re-signature schemes require expensive bilinear pairing operations. Focused on the issue, an identity-based bidirectional proxy re-signature scheme without bilinear pairing was presented by using hash function. Under the assumption of discrete logarithm difficult problem, the proposed proxy re- signature scheme was proved secure against forgery under adaptive chosen message attacks. Furthermore, the proposed scheme was bidirectional, versatile, transparent and key optimal, which eliminated the bilinear pairing operations. Compared with the identity-based bidirectional proxy re-signature scheme -- Shao scheme, the proposed scheme could reduce the computational complexity of re-signature algorithm and improve the computation efficiency of signature verification algorithm. Based on the proposed scheme, an aggregate proxy re-signature scheme was proposed. The new scheme can aggregate re-signatures only if they are generated in the same time period, which can greatly reduce the communication overhead.

关 键 词：代理重签名 基于身份的密码体制 聚合代理重签名 离散对数 双线性对 

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