基于椭圆曲线的无中心匿名双向认证系统设计及实现

【作者】 郑春明；

【导师】 张琨；

【作者基本信息】 南京理工大学 ， 计算机应用技术， 2008， 硕士

【摘要】 信息技术的进一步飞速发展,对信息安全的各项领域提出了更高的要求。计算机硬件、并行计算等方面的发展,使得传统的RSA密码体制受到越来越多的威胁,人们逐渐转向优点众多的椭圆曲线密码体制。同时针对日益复杂的环境变化,人们迫切需要提高对隐私、匿名性等方面的保护。传统单一的有中心秘密保管体制,也逐步转变为分布式、无中心的门限秘密共享体制,以更好的适应高安全、高抗毁力、分散权限等需求。本文在研究椭圆曲线、无中心门限方案的基础上,提出并构建了一套完整的匿名双向认证系统,实现了其中的关键算法。论文主要研究工作和创新成果如下:1.在研究现有椭圆曲线无中心门限方案的基础上,设计了匿名双向认证系统的完全无中心初始化门限方案。方案基于椭圆曲线,结合拉各朗日插值算法,采用了完全无中心的门限模式。方案包括系统的初始化、门限签名、签名验证三部分,具有密钥短、运算快、不需可信中心、安全性高等优点。同时提出了无可信中心环境下动态改变门限值和增删成员的方法。此方法不需重新初始化和更换系统原有的秘密,实施起来具有很高的效率和安全性。2.设计了基于椭圆曲线的匿名双向认证方案,并证明了其正确性,分析了安全性和有效性。方案可以很好的抵抗重放、中间人等各种攻击,且认证不需分布式认证中心参与,实现了匿名性。3.设计了系统节点之间的加密通信方案,保证了通信的安全性、消息完整性、保密性、时效性和不可抵赖性,采用改进的签名方程,避免了求逆运算,提高了执行效率。4.实现了匿名双向认证原型系统,并给出了一个具体的应用实例,取得了预期的效果。实验结果验证了方案的可行性、安全性和高效性。更多还原

【Abstract】 With the information technology closer rapid development, it places higher demand on information security. Computer hardware and parallel computing make more threat to the traditional RSA cryptosystem. As the environment becoming more complicated, we imminently need better protection of privacy and anonymity. The traditional single authentication center no longer meets the requirement. Various schemes based on the elliptic curves, threshold schemes, without trusted party schemes and so on, provide more reliable, more effective means for the protection of information security.By researching on the elliptic curves and threshold without trusted party, an anonymity mutual authentication system without a trusted party is proposed and designed, the kernel algorithm are proposed and its security proof is given. The main contributes of this dissertation are as follows:First, propose a (t,n) threshold scheme without a trusted center, and give a dynamic scheme on changing value of threshold. The threshold scheme is based on elliptic curves, has higher security. When changing the value of threshold dynamically, there is no need to re-initialization, and the share secret can be used repeatedly though threshold value changed. This significantly enhances the utilization rate of the secret shares, and makes the scheme more flexibility, efficiently.Second, propose an anonymity mutual authentication scheme, and give its security proof, analyze its validity and advantages. The scheme can withstand replay attack, man-in-the-middle attack and so on, has properties such as anonymous and authentication without any third party.Then, propose an encrypted communication scheme between system users, ensure the security of communications, information integrity, confidentiality, timeliness and non-repudiation. By applying a modified elliptic curve signature equation, avoid calculating the inverse elements in the finite field, get a more efficient implementation.Finally, implement the prototype system. The test results show that our scheme which has feasibility, and is more secure and efficient.更多还原