一种具有CDH问题安全性基于身份的签名方案  

An Identity-based Signature Scheme with CDH Problem Security

作　　者：陈辉焱[1,2] 刘乐[2] 张晨晨[2] CHEN Huiyan;LIU Le;ZHANG Chenchen(Department of Information Security,Beijing Electronic Science and Technology Institute,Beijing 100070,China;Institute of Communication Engineering,Xidian University,Xi'an 710071,China)

机构地区：[1]北京电子科技学院信息安全系,北京100070 [2]西安电子科技大学通信工程学院,西安710071

出　　处：《计算机工程》2018年第4期174-180,共7页Computer Engineering

基　　金：北京电子科技学院信息安全重点实验室开放基金(2014KF-chy)

摘　　要：严格的安全证明需要较短的安全参数和较高的运行效率。为此,提出一种基于身份的签名方案IDSSTR,该方案具有可计算Diffie-Hellman问题的安全性规约,在线时自然有效,离线阶段也无需额外的条件,且验证过程也不变。为减小签名消息的总长度,给出具有消息恢复功能的IDSSTR修改版本。分析结果表明,可计算DiffieHellman问题的困难性与离散对数问题有着紧密联系,IDSSTR签名方案可为该困难问题提供安全保证。Tight security proofs need shorter security parameters and better efficiency.Therefor,a new Identity-based Signature(IBS)scheme named IDSSTR is proposed,which has a security specification for Computational Diffie-Hellman(CDH)problems and it is also naturally efficient on-line,no additional conditions is needed for the off-line stage and the verification process is unchanged.In order to shorten the total length of the signed message,a modified version of the IDSSTR with message recovery is goven.Analysis results show that,the difficulty of CDH problem is widely considered to be closely related to the discrete logarithm problem,therefor,the proposed signature scheme provides security assurance for such difficult problems.

关 键 词：基于身份的签名 可计算的Diffie-Hellman问题 离散对数问题 严格规约 随机预言机模型 

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