Abstract
In 2009, Tseng et al. proposed a key agreement protocol based on chaotic maps. Tseng et al. claimed that their protocol preserve user anonymity. However, Tseng et al.’s protocol is insecure against the insider attack. Nui et al. proposed a new anonymous key agreement protocol in 2011. Unfortunately, Nui et al.’s protocol cannot provide user anonymity and has computational efficiency problem. We introduce a new key agreement protocol based on Chebyshev chaotic map. Our protocol overcomes these security problems and provides user anonymity.
This research was supported by the KCC(Korea Communications Commission), Korea, under the R&D program supervised by the KCA(Korea Communications Agency)"(KCA-2012-12-912-06-003).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory 22(6), 644–654 (1976)
Tseng, H.-R., Jan, R.-H., Yang, W.: A chaotic maps-based key agreement protocol that preserves user anonymity. In: Proceedings of the 2009 IEEE International Conference on Communications, ICC 2009, Dresden, Germany, June 14-18, pp. 1–6 (2009)
Xiao, D., Liao, X., Deng, S.: One-way hash function construction based on chaotic map with changeable-parameter. Chaos, Solitons & Fractals 24(1), 65–71 (2005)
Mason, J.C., Handscomb, D.C.: Chebyshev polynomials. Chapman & Hall/CRC, Boca Raton (2003)
Kocarev, L., Tasev, Z.: Public-key encryption based on Chebyshev maps. In: Proceedings of the International Symposium on Circuits and Systems, ISCAS 2003, vol. 3, pp. III-28–III-31 (May 2003)
Bergamo, P., D”Arco, P., Santis, A., Kocarev, L.: Security of public key cryptosystems based on Chebyshev polynomials. IEEE Transactions on Circuits and Systems-I 52(7), 1382–1393 (2005)
Han, S.: Security of a key agreement protocol based on chaotic maps. Chaos, Solitons & Fractals 38(3), 764–768 (2008)
Yoon, E.-J., Yoo, K.-Y.: A new key agreement protocol based on chaotic maps. In: Nguyen, N.T., Jo, G.-S., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2008. LNCS (LNAI), vol. 4953, pp. 897–906. Springer, Heidelberg (2008)
Lee, Y., Kim, S., Won, D.: Enhancement of two-factor authenticated key exchange protocols in public wireless LANs. Elsevier Computers and Electrical Engineering 36(1), 213–223 (2010)
Nam, J., Paik, J., Kim, U.M., Won, D.: Security Enhancement to a Password-Authenticated Group Key Exchange Protocol for Mobile Ad-hoc Networks. IEEE Communications Letters 12(2), 127–129 (2008)
Lee, C., Park, S., Lee, K., Won, D.: An Attack on an RFID Authentication Protocol Conforming to EPC Class 1 Generation 2 Standard. In: Lee, G., Howard, D., Ślęzak, D. (eds.) ICHIT 2011. LNCS, vol. 6935, pp. 488–495. Springer, Heidelberg (2011)
Nam, J., Lee, K., Paik, J., Paik, W., Won, D.: Security Improvement on a Group Key Exchange Protocol for Mobile Networks. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2011, Part IV. LNCS, vol. 6785, pp. 123–132. Springer, Heidelberg (2011)
Nam, J., Paik, J., Lee, B., Lee, K., Won, D.: An Improved Protocol for Server-Aided Authenticated Group Key Establishment. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2011, Part V. LNCS, vol. 6786, pp. 437–446. Springer, Heidelberg (2011)
Yang, H., Lee, K., Lee, C., Kwak, J., Won, D.: A Security Weakness in Tseng et al Key Agreement Protocol. In: Proc. of JWIS 2011, The 6th Joint Workshop on Information Security (October 2011)
Niu, Y., Wang, X.: An anonymous key agreement protocol based on chaotic maps. Commun. Nonlinear Sci. Numer. Simulat. 16(4), 1986–1992 (2011)
Yoon, E.-J.: Efficiency and security problems of anonymous key agreement protocol based on chaotic maps. Commun. Nonlinear Sci. Numer. Simulat. 17, 2735–2740 (2012)
Xue, K., Hong, P.: Security improvement on an anonymous key agreement protocol based on chaotic maps. Commun. Nonlinear Sci. Numer. Simulat. 17, 2969–2977 (2012)
Oh, S., Kwak, J., Lee, S., Won, D.: Security analysis and applications of standard key agreement protocols. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds.) ICCSA 2003, Part II. LNCS, vol. 2668, pp. 191–200. Springer, Heidelberg (2003)
Smith, T.F., Waterman, M.S.: Identification of Common Molecular Subsequences. J. Mol. Biol. 147, 195–197 (1981)
Bergamo, P., D’Arco, P., Santis, A., Kocarev, L.: Security of public key cryptosystems based on Chebyshev polynomial. IEEE Trans. Circ. Syst.-I 52(7), 1382–1393 (2005)
Zhang, L.: Cryptanalysis of the public key encryption based on multiple chaotic systems. Chaos Soliton Fract. 37(3), 669–674 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, H., Qiuyan, J., Lee, H., Lee, K., Won, D. (2013). Improvement of a Chaotic Map Based Key Agreement Protocol That Preserves Anonymity. In: Park, J.J.(.H., Arabnia, H.R., Kim, C., Shi, W., Gil, JM. (eds) Grid and Pervasive Computing. GPC 2013. Lecture Notes in Computer Science, vol 7861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38027-3_90
Download citation
DOI: https://doi.org/10.1007/978-3-642-38027-3_90
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38026-6
Online ISBN: 978-3-642-38027-3
eBook Packages: Computer ScienceComputer Science (R0)