论文部分内容阅读
可否认认证协议作为一种安全协议,被用在如电子选举等许多特殊领域中,由于交互式可否认认证协议的多次交互带来的安全隐患,非交互式可否认认证协议引起了更多的重视,提出一种基于椭圆曲线离散对数问题的非交互式可否认认证协议,椭圆曲线离散对数问题的难解性提高了密钥的保密性,保证了非交互式协议的安全,构建的非交互式可否认协议可以抵抗重放攻击、伪造攻击、冒充攻击和已知会话密钥攻击,基于形式化方法对该协议的可否认性进行了证明,最后通过与其他协议的比较,说明了该协议的安全性和高效.
Denying the authentication protocol as a security protocol is being used in many special areas such as electronic voting and the non-interactive deny authentication protocol has caused more due to the interactive security denying the security risks caused by multiple interactions of the authentication protocols , This paper proposes a non-interactive denial authentication protocol based on elliptic curve discrete logarithm problem. The difficulty of discrete logarithm problem of elliptic curve improves the confidentiality of key and guarantees the security and construction of non-interactive protocol The non-interactive denial protocol can resist the replay attack, counterfeit attack, impersonation attack and known session key attack. The non-interactive denial protocol proves the deniability of the protocol based on the formal method. Finally, through comparison with other protocols, The agreement is safe and efficient.