可证明安全的无证书数字签名研究

发布时间：2018-05-31 23:47

本文选题：无证书密码体制 + 数字签名　；参考：《河南理工大学》2016年硕士论文

【摘要】：为解决基于身份密码体制的密钥托管问题,2003年,Al-Riyami和Paterson提出了无证书公钥密码体制。无证书公钥密码系统和基于身份的密码系统一样,无需CA颁发的数字证书来认证公钥,节省了因维护证书而所付的昂贵代价。无证书数字签名由于其不需要证书认证的特性而受到广泛关注,适应于移动通信网络、无线传感网络等无线通信的场合。但无证书密码系统因公钥没有证书认证,容易受到公钥替换攻击和不诚实的KGC的攻击。设计安全且高效的无证书数字签名方案成为人们的研究重点。本论文旨在研究高效可证明安全的无证书数字签名方案。本论文主要工作如下:通过对已有无证书签名方案的研究与学习,基于椭圆曲线离散对数难题提出一类高效可证明安全的无证书签名方案,并给出了形式化安全性证明,所提方案能够抵抗两类超级攻击者的攻击,相比已有的无证书签名方案,在计算效率上具有明显优势。对樊爱宛等人的无证书签名方案进行了安全性分析并提出了改进方案。樊爱宛等人提出一个高效的无证书签名方案,声称方案的安全性是抗存在性伪造的。对樊爱宛等的签名方案进行安全性分析,发现此方案不能抵抗第一类强攻击者的伪造攻击,为克服此方案的安全缺陷,提出了改进方案,改进方案具有更高的安全性,在随机预言机模型下给出了改进方案的形式化安全性证明。代理签名在电子商务、分布式系统、网格计算等场合应用广泛。现有的无证书代理签名方案大多是基于双线性对的,而双线性对运算比较耗时,使用双线性对的签名方案普遍计算效率不高。为提高无证书代理签名方案的计算效率,提出一个基于椭圆曲线离散对数难题的无证书代理签名方案,不使用双线性对,计算效率高,在随机预言机模型下给出了所提方案针对两类超级攻击者的安全性证明。所提方案适用于对计算和存储等资源有严格限制的实际应用的场合。
[Abstract]:In order to solve the problem of key escrow based on identity cryptosystem, Al-Riyami and Paterson proposed a certificateless public key cryptosystem in 2003. Certificate free public key cryptosystem, like identity-based cryptosystem, does not need the digital certificate issued by CA to authenticate the public key, thus saving the expensive cost of maintaining the certificate. Non-certificate digital signature is widely concerned because it does not need certificate authentication, which is suitable for wireless communication such as mobile communication network, wireless sensor network and so on. However, no certificate cryptosystem is vulnerable to public key replacement attack and dishonest KGC attack because public key does not have certificate authentication. Designing a secure and efficient certificate-free digital signature scheme has become the focus of research. The purpose of this thesis is to study an efficient certificateless digital signature scheme which can be proved to be secure. The main work of this thesis is as follows: based on the research and learning of the existing certificate-free signature schemes, a class of efficient certification-free signature schemes is proposed based on the elliptic curve discrete logarithm problem, and the formal security proof is given. The proposed scheme can resist the attack of two kinds of super attackers. Compared with the existing certificateless signature scheme, the proposed scheme has obvious advantages in computing efficiency. This paper analyzes the security of Fan Aiwan's signature scheme without certificate and puts forward the improvement scheme. Fan Ai-wan and others put forward an efficient certificate-free signature scheme, claiming that the security of the scheme is anti-existence forgery. Based on the security analysis of Fan Aiwan's signature scheme, it is found that the scheme can not resist the forgery attack of the first kind of strong attacker. In order to overcome the security defects of this scheme, an improved scheme is proposed, which has higher security. The formal security proof of the improved scheme is given under the stochastic oracle model. Proxy signatures are widely used in e-commerce, distributed systems, grid computing and so on. Most of the existing certificateless proxy signature schemes are based on bilinear pairings, but bilinear pairings are time-consuming, and the schemes with bilinear pairings are generally inefficient. In order to improve the computational efficiency of the certificate-free proxy signature scheme, a certificateless proxy signature scheme based on elliptic curve discrete logarithm problem is proposed. The security proof of the proposed scheme for two kinds of super attackers is given under the random oracle model. The proposed scheme is suitable for practical applications where computing and storage resources are strictly limited.
【学位授予单位】：河南理工大学
【学位级别】：硕士
【学位授予年份】：2016
【分类号】：TN918.91

【相似文献】