中国物理B ›› 2015, Vol. 24 ›› Issue (6): 60509-060509.doi: 10.1088/1674-1056/24/6/060509

• GENERAL • 上一篇    下一篇

An efficient three-party password-based key agreement protocol using extended chaotic maps

舒剑a b   

  1. a Department of Electronic Commerce, Jiangxi University of Finance and Economics, Nanchang 330013, China;
    b School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China
  • 收稿日期:2014-09-10 修回日期:2014-12-17 出版日期:2015-06-05 发布日期:2015-06-05
  • 基金资助:
    Project supported by the National Natural Science Foundation of China (Grant No. 61462033).

An efficient three-party password-based key agreement protocol using extended chaotic maps

Shu Jian (舒剑)a b   

  1. a Department of Electronic Commerce, Jiangxi University of Finance and Economics, Nanchang 330013, China;
    b School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China
  • Received:2014-09-10 Revised:2014-12-17 Online:2015-06-05 Published:2015-06-05
  • Contact: Shu Jian E-mail:mikeshujian@jxufe.edu.cn
  • About author:05.45.Vx; 05.45.-a
  • Supported by:
    Project supported by the National Natural Science Foundation of China (Grant No. 61462033).

RichHTML

1

PDF (PC)

272

赞

摘要： Three-party password-based key agreement protocols allow two users to authenticate each other via a public channel and establish a session key with the aid of a trusted server. Recently, Farash et al. [Farash M S, Attari M A 2014 “An efficient and provably secure three-party password-based authenticated key exchange protocol based on Chebyshev chaotic maps”, Nonlinear Dynamics 77(7): 399–411] proposed a three-party key agreement protocol by using the extended chaotic maps. They claimed that their protocol could achieve strong security. In the present paper, we analyze Farash et al.'s protocol and point out that this protocol is vulnerable to off-line password guessing attack and suffers communication burden. To handle the issue, we propose an efficient three-party password-based key agreement protocol using extended chaotic maps, which uses neither symmetric cryptosystems nor the server's public key. Compared with the relevant schemes, our protocol provides better performance in terms of computation and communication. Therefore, it is suitable for practical applications.

关键词: key agreement protocol, trusted server, extended chaotic maps, strong security

Abstract: Three-party password-based key agreement protocols allow two users to authenticate each other via a public channel and establish a session key with the aid of a trusted server. Recently, Farash et al. [Farash M S, Attari M A 2014 “An efficient and provably secure three-party password-based authenticated key exchange protocol based on Chebyshev chaotic maps”, Nonlinear Dynamics 77(7): 399–411] proposed a three-party key agreement protocol by using the extended chaotic maps. They claimed that their protocol could achieve strong security. In the present paper, we analyze Farash et al.'s protocol and point out that this protocol is vulnerable to off-line password guessing attack and suffers communication burden. To handle the issue, we propose an efficient three-party password-based key agreement protocol using extended chaotic maps, which uses neither symmetric cryptosystems nor the server's public key. Compared with the relevant schemes, our protocol provides better performance in terms of computation and communication. Therefore, it is suitable for practical applications.

Key words: key agreement protocol, trusted server, extended chaotic maps, strong security

中图分类号:  (Communication using chaos)

  • 05.45.Vx
05.45.-a (Nonlinear dynamics and chaos)