摘要
目前大多数基于证书密码体制的数字签名方案都使用双线性对构造,计算开销较大、计算效率低,因此有必要研究更安全、更高效的基于证书签名方案。基于离散对数难题和分叉引理,提出了一个不含双线性对运算的基于证书数字签名方案,并在随机预言模型下证明了方案的安全性,分析了方案的效率。分析表明,方案可以抵抗用户伪造攻击和CA伪造攻击,抵抗公钥替换攻击,并且计算效率较高,适合应用于移动通信等计算能力和带宽受限的领域。
There are pairing operations in most current certificate＊based signature schemes, so the effieiencies of those schemes are low. It is necessary to research certificate-based signature schemes with higher security and higher efficiency. Based on discrete logarithm problem and the forking lemma, this paper presented a certificate-based signature scheme without pairings, which efficiency had been analyzed, and it proved security under the random oracle model. Analysis show that the scheme is existentially unforgeable against user attack and CA attack, against public key replacing attack. Because of its effi- cieney, it can he used in the computation Dower and bandwidth limited environment.
出处
《计算机应用研究》
CSCD
北大核心
2013年第5期1504-1507,1519,共5页
Application Research of Computers
基金
成都市2007年科技攻关项目(07GGYB050GX-010)
关键词
基于证书签名
随机预言模型
离散对数难题
双线性对
certificate-based signature
random oracle model
discrete logarithm problem
bilinear pairing
