A Chaotic Maps-Based Key Agreement Protocol that Preserves User Anonymity
A Chaotic Maps-Based Key Agreement Protocol that Preserves User Anonymity
复制标题
DOI：
10.1109/icc.2009.5198581
复制
发表时间：
2009-06
期刊：
影响因子：
--
通讯作者：
Huei-Ru Tseng;R. Jan;Wuu Yang
中科院分区：
文献类型：
--
作者：
Huei-Ru Tseng;R. Jan;Wuu Yang
密钥协商协议是一种协议，通过该协议，两个或多个通信方可以通过开放的通信网络就密钥达成一致或交换信息，使得它们都就所建立的会话密钥达成一致，以用于随后的通信。近年来，人们提出了几种基于混沌映射的密钥协商协议。这些协议需要验证表来验证用户的合法性。由于这种方法显然会带来篡改的风险和管理表的成本，并遭受被盗验证者攻击，我们提出了一种新的密钥协商协议的基础上混沌映射，以提高安全性。该协议不仅实现了无需验证表的双向认证，而且允许用户匿名地与服务器交互。此外，所提出的协议的安全性建模和分析的Petri网。我们的分析表明，该协议可以成功地防御重放攻击，伪造攻击，和被盗验证者攻击。
A key agreement protocol is a protocol whereby two or more communicating parties can agree on a key or exchange information over an open communication network in such a way that both of them agree on the established session keys for use in subsequent communications. Recently, several key agreement protocols based on chaotic maps are proposed. These protocols require a verification table to verify the legitimacy of a user. Since this approach clearly incurs the risk of tampering and the cost of managing the table and suffers from the stolen-verifier attack, we propose a novel key agreement protocol based on chaotic maps to enhance the security. The proposed protocol not only achieves mutual authentication without verification tables, but also allows users to anonymously interact with the server. Moreover, security of the proposed protocol is modelled and analyzed with Petri nets. Our analysis shows that the proposed protocol can successfully defend replay attacks, forgery attacks, and stolen-verifier attacks.