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

Identity-based multi-proxy signature without bilinear pairings

作　　者：邹昌芝 

机构地区：[1]荆楚理工学院教育技术中心,湖北荆门448000

出　　处：《计算机工程与应用》2016年第9期96-101,共6页Computer Engineering and Applications

摘　　要：现有基于身份的多代理签名方案采用计算量大的双线性对运算,总体计算开销较高。基于椭圆曲线上的加法循环群,提出一种不使用对运算的基于身份多代理签名方案,其中,用户私钥产生、代理签名授权和多代理签名算法均来源于Schnorr的短签名机制。在随机预言模型下,新方案的不可伪造性被规约为多项式时间敌手求解离散对数问题,具有可证明安全性。对比分析表明,新方案计算开销更低。The identity-based multi-proxy signature schemes employing computation-intensive bilinear pairing operations have higher cost of computing. Based on the elliptic curve group, a pairing-free identity-based multi-proxy signature scheme is proposed. In the new scheme, user＇s private key generation algorithm, delegation generation algorithm and multi-proxy signature generation algorithm are all derived from Schnorr＇s short signature scheme. In the random oracle model, the new scheme achieves provable security, and its unforgeability is deduced to a polynomial time adversary solving the discrete logarithm problem. Comparative analysis shows that the new scheme is more efficient in computation.

关 键 词：基于身份密码学 多代理签名 离散对数问题 随机预言模型 

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