An efficient chaos-based 2-party key agreement protocol with provable security

摘要

Key agreement protocol is an important cryptographic primitive, which allows 2 parties to establish a secure session in an open network environment. A various of key agreement protocols were proposed. Nowadays, there still exists some other security flaws waiting to be solved. Owing to reduce the computational and communication costs and improve the security, chaotic map has been studied in-depth and treated as a good solution. Recently, Liu et al proposed a chaos-based 2-party key agreement protocol and demonstrated that it can defend denial-of-service attack and replay attack. We found, however, it cannot resist off-line password-guessing attack, and it also has some other security flaws. In this paper, we propose an improved chaos-based 2-party key agreement protocol. The results prove that the protocol can solve the threats of off-line password-guessing attack and other security flaws in the security proof section. What is more, performance analysis shows that the computational cost of the improved protocol is lower than Liu et al protocol.