一种不可否认的门限代理签名方案  

A Kind of Threshold Proxy Signature Scheme with Nonrepudiation Property

作　　者：刘丹妮[1] 王兴伟[1] 黄敏[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110819

出　　处：《东北大学学报（自然科学版）》2014年第12期1692-1696,共5页Journal of Northeastern University(Natural Science)

基　　金：国家杰出青年科学基金资助项目(61225012;71325002);高等学校博士学科点专项科研基金优先发展领域资助项目(20120042130003);中央高校基本科研业务费专项资金资助项目(N110204003;N120104001)

摘　　要：针对目前的门限代理签名方案计算复杂性高、通信量大的问题,提出一种不可否认的门限代理签名方案.为提高安全性,在签名人向CA申请公钥证书时,CA采用零知识证明的方法对与该公钥相关的私钥进行验证,保证该公钥未被篡改.为提高运行效率,代理份额产生阶段,原始签名人只需计算一个公共的代理份额,广播给代理群,各个群成员并行地生成自己的代理密钥,与原始签名人逐一为每个代理群成员生成代理密钥的串行操作相比,减少了计算量.采用将敌手分为三类的安全模型,仿真各类敌手伪造签名的过程,证明方案的安全性.To overcome the drawbacks, such as high computational complexity and heavy communication, in the present threshold proxy signature schemes, a nonrepudiable threshold proxy signature scheme was proposed. To improve the security, when a signer applies for public key certificate to the CA, the CA validates the signer＇s private key associated with the signer＇s public key by the method of zero-knowledge proof. To improve the efficiency, in the phase of proxy key generation, original signer only needs to calculate and broadcast a public proxy share to the proxy group, and the group members generate their own proxy keys concurrently. Comparing with the schemes that original signer generates proxy keys one by one for all the proxy members, the amount of calculation was greatly reduced by the proposed method. The security model of three types of adversaries was proposed. It was simulated that the adversaries forge the signature. The new scheme was proved to be secure by the simulation process.

关 键 词：密码学 代理签名 门限代理签名 零知识证明 敌手 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]