可证明安全的短代理签名方案  

Short Proxy Signature Scheme with Provable Security

作　　者：黄茹芬 黄振杰 陈群山[1] 农强 

机构地区：[1]闽南师范大学计算机学院,福建漳州363000 [2]漳州城市职业学院,福建漳州363000

出　　处：《计算机工程》2017年第12期255-260,266,共7页Computer Engineering

基　　金：国家自然科学基金(61170246);福建省中青年教师教育科研项目(JA14202;JA15317)

摘　　要：为避免网络阻塞问题,降低网络的数据流量,基于双线性映射提出只有一个群元素的短代理签名方案,包括签名的定义、新方案的构造和安全性分析。采用随机预言机模型,基于离散对数、计算Diffie-Hellman和逆计算Diffie-Hellman困难假设,证明方案的安全性。通过与其他现有代理签名方案的比较,分析该方案在性能上的优势。分析结果表明,该方案在签名产生阶段不需要任何双线性对运算,在签名验证阶段也仅需要2个双线性对运算,具有签名短、高效、安全等优点。In order to avoid network congestion, and reduce the data flow, based on bilinear mapping, this paper proposes short proxy signature scheme with only one group element, including the signature definition, the construction of new scheme and the security analysis. A rigorous security proof is given under the random oracle model, which is based on the discrete logarithm,computational Diffie-Hellman and reverse computational Diffie-Hellman hardness assumption. Compared with the other existing security proxy signature schemes, the performance of the scheme is analyzed. Analysis results show that the proposed scheme doesn＇ t require any bilinear pairing operation in signature generation phase and requires just two bilinear pairing operations in signature verification phase, and it has the advantages of short signature, high efficiency, safety and so on.

关 键 词：代理签名 短签名 双线性对 双线性DIFFIE-HELLMAN问题 逆计算Diffie-Hellman问题 随机预言机模型 

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