×

An anonymous key agreement protocol based on chaotic maps. (English) Zbl 1221.94057

Summary: Recently, Tseng et al. proposed a novel key agreement protocol based on chaotic maps. They claimed that the protocol achieved session key agreement between a server and a user, and allowed the user to anonymously interact with the server. This paper, however, will demonstrate that Tseng et al.’s protocol can not guarantee user anonymity and protocol security against an insider adversary who is a legal user, and it can not provide perfect forward secrecy. Furthermore, the current paper presents a new key agreement protocol based on Chebyshev chaotic map in order to conquer these problems. In contrast with Tseng et al.’s protocol, the proposed protocol is more secure and preserves user anonymity.

MSC:

94A60 Cryptography
37N99 Applications of dynamical systems
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Menezes, A.; Van Oorschot, P.; Vanstone, S., Handbook of applied cryptography, (1997), CRC Press Boca Raton · Zbl 0868.94001
[2] Chen, G.; Mao, Y.; Chui, C., A symmetric image encryption scheme based on 3D chaotic cat maps, Chaos soliton fract, 21, 3, 749-761, (2004) · Zbl 1049.94009
[3] Wang, X.Y.; Chen, F.; Wang, T., A new compound mode of confusion and diffusion for block encryption of image based on chaos, Commun nonlinear sci numer simulat, 15, 9, 2479-2485, (2010) · Zbl 1222.94013
[4] Xiang, T.; Wong, K.; Liao, X.F., An improved chaotic cryptosystem with external key, Commun nonlinear sci numer simulat, 13, 9, 1879-1887, (2008) · Zbl 1221.94070
[5] Li, C.; Li, S.; Alvarez, G.; Chen, G.; Lo, K., Cryptanalysis of two chaotic encryption schemes based on circular bit shift and XOR operations, Phys lett A, 369, 1-2, 23-30, (2007) · Zbl 1209.94044
[6] Wang, Y.; Wong, K.; Liao, X.; Xiang, T., A block cipher with dynamic S-boxes based on tent map, Commun nonlinear sci numer simulat, 14, 7, 3089-3099, (2009) · Zbl 1221.94068
[7] Chen, G.; Chen, Y.; Liao, X., An extended method for obtaining S-boxes based on three-dimensional chaotic Baker maps, Chaos soliton fract, 31, 3, 571-579, (2007) · Zbl 1138.94354
[8] Xiao, D.; Shih, F.; Liao, X., A chaos-based hash function with both modification detection and localization capabilities, Commun nonlinear sci numer simulat, 15, 9, 2254-2261, (2010) · Zbl 1222.94040
[9] Deng, S.; Li, Y.; Xiao, D., Analysis and improvement of a chaos-based hash function construction, Commun nonlinear sci numer simulat, 15, 5, 1338-1347, (2010) · Zbl 1221.94043
[10] Xiao, D.; Liao, X.; Deng, S., One-way hash function construction based on the chaotic map with changeable-parameter, Chaos soliton fract, 24, 1, 65-71, (2005) · Zbl 1068.94019
[11] Kocarev, L.; Tasev, Z., Public-key encryption based on Chebyshev maps, Proc IEEE symp circ syst (ISCAS’03), 3, 28-31, (2003)
[12] Bergamo, P.; D’Arco, P.; Santis, A.; Kocarev, L., Security of public key cryptosystems based on Chebyshev polynomials, IEEE trans circ syst-I, 52, 7, 1382-1393, (2005) · Zbl 1374.94775
[13] Xiao, D.; Liao, X.; Deng, S., A novel key agreement protocol based on chaotic maps, Inform sci, 177, 4, 1136-1142, (2007)
[14] Han, S., Security of a key agreement protocol based on chaotic maps, Chaos soliton fract, 38, 3, 764-768, (2008) · Zbl 1146.94304
[15] Chang E, Han S, Using passphrase to construct key agreement, CBS-IS-2006, Technical report, Curtin University of Technology.
[16] Han, S.; Chang, E., Chaotic map based key agreement with/out clock synchronization, Chaos soliton fract, 39, 3, 1283-1289, (2009) · Zbl 1197.94190
[17] Tseng H, Jan R, Yang W, A chaotic maps-based key agreement protocol that preserves user anonymity. IEEE International Conference on Communications (ICC’09) 2009; 1-6.
[18] Zhang, L., Cryptanalysis of the public key encryption based on multiple chaotic systems, Chaos soliton fract, 37, 3, 669-674, (2008) · Zbl 1134.94371
[19] Schneier B. Applied cryptography, in: Protocol, algorithms and source code, New York, Wiley, 1996. · Zbl 0853.94001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.