基于双线性对的通用可组合重签名方案研究  

Study on universally composable proxy re-signature scheme based on bilinear pairing

作　　者：艾鸿[1] 刘跃军[2] 

机构地区：[1]上海海洋大学信息学院,上海201306 [2]上海大学巴士汽车学院,上海200314

出　　处：《计算机工程与设计》2013年第11期3748-3751,共4页Computer Engineering and Design

基　　金：南北极环境综合考察与评估专项基金项目(CHINARE2012-04-07)

摘　　要：对洪等学者提出的在随机预言机模型下具有UC安全的通用可组合代理重签名方案进行了安全性分析。针对洪等学者提出的通用可组合代理重签名方案并不具备他们宣称的不可伪造性问题,给出了任意恶意的攻击者都能在不知道代理密钥的情况下成功伪造一个代理重签名并通过有效性验证的方法。为了克服该问题,提出了一个改进的方案,对新方案进行正确性和安全性分析。分析结果显示,改进的方案能克服原方案存在的缺陷,在随机预言机模型下是安全的,比原方案更加有效。The security of a universally composable proxy re-signature scheme proposed by Hong and others is analyzed, which is UC secure in the random oracle. Aiming at solve the problem that Hong and others＇ universally composable proxy re-signature scheme is not secure as they claimed, a method is proposed that any malicious attacker can forge successfully a proxy re-signature and pass the verification. In order to overcome the problem, an improved scheme is proposed, and the correctness and the securi ty of the improved scheme are analyzed. The analysis shows that the improved scheme overcomes the existed drawback and ensure the seeurety in the random oracle, which is more efficient than the original scheme.

关 键 词：通用可组合安全 代理重签名 可伪造性 可证明安全 随机预言机模型 

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