Design and analysis of a chaotic maps-based three-party authenticated key agreement protocol

详细信息    查看全文

• 作者：Xiong Li ; Jianwei Niu ; Saru Kumari ; Muhammad Khurram Khan…
• 关键词：Chaotic maps ; Authentication ; Key agreement ; Information security
• 刊名：Nonlinear Dynamics
• 出版年：2015
• 出版时间：May 2015
• 年：2015
• 卷：80
• 期：3
• 页码：1209-1220
• 全文大小：430 KB
• 参考文献：1. Liu, B, Peng, J (2004) Nonlinear dynamics. High Education Press, Beijing
  2. Wang, XY, Wang, XJ, Zhao, JF, Zhang, ZF (2011) Chaotic encryption algorithm based on alternant of stream cipher and block cipher. Nonlinear Dyn. 63: pp. 587-597 CrossRef
  3. Sheu, LJ (2011) A speech encryption using fractional chaotic systems. Nonlinear Dyn. 65: pp. 103-108 CrossRef
  4. Wang, Y, Wong, KW, Liao, XF, Xiang, T (2009) A block cipher with dynamic S-boxes based on tent map. Commun. Nonlinear Sci. Numer. Simul. 14: pp. 3089-3099 CrossRef
  5. Xiong, H, Chen, Z, Li, FG (2013) New identity-based three-party authenticated key agreement protocol with provable security. J. Netw. Comput. Appl. 36: pp. 927-932 CrossRef
  6. He, DB, Padhye, S, Chen, JH (2012) An efficient certificateless two-party authenticated key agreement protocol. Comput. Math. Appl. 64: pp. 1914-1926 CrossRef
  7. H?lbl, M, Welzer, T, Brumen, B (2012) An improved two-party identity-based authenticated key agreement protocol using pairings. J. Comput. Syst. Sci. 78: pp. 142-150 CrossRef
  8. Lv, XX, Li, H, Wang, BC (2012) Group key agreement for secure group communication in dynamic peer systems. J. Parallel Distrib. Comput. 72: pp. 1195-1200 CrossRef
  9. He, DB, Chen, JH, Hu, J (2012) An ID-based client authentication with key agreement protocol for mobile client–server environment on ECC with provable security. Inf. Fusion 13: pp. 223-230 CrossRef
  10. Chen, TH, Lee, WB, Chen, HB (2008) A round-and computation-efficient three-party authenticated key exchange protocol. J. Syst. Softw. 81: pp. 1581-1590 CrossRef
  11. Xiao, D, Liao, XF, Deng, SJ (2007) A novel key agreement protocol based on chaotic maps. Inf. Sci. 177: pp. 1136-1142 CrossRef
  12. Han, S (2008) Security of a key agreement protocol based on chaotic maps. Chaos Solitons Fractals 38: pp. 764-768 CrossRef
  13. Xiang, T, Wong, KW, Liao, XF (2009) On the security of a novel key agreement protocol based on chaotic maps. Chaos Solitons Fractals 40: pp. 672-675 CrossRef
  14. Xiao, D, Liao, XF, Deng, SJ (2008) Using time-stamp to improve the security of a chaotic maps-based key agreement protocol. Inf. Sci. 178: pp. 1598-1602 CrossRef
  15. Han, S, Chang, E (2009) Chaotic map based key agreement with/out clock synchronization. Chaos Solitons Fractals 39: pp. 1283-1289 CrossRef
  16. Tseng, H.R., Jan, R.H., Yang, W.: A chaotic maps-based key agreement protocol that preserves user anonymity. In: IEEE International Conference on Communications, 2009, ICC-9, pp. 1-. Dresden, Germany (2009)
  17. Niu, YJ, Wang, XY (2011) An anonymous key agreement protocol based on chaotic maps. Commun. Nonlinear Sci. Numer. Simul. 16: pp. 1986-1992 CrossRef
  18. Yoon, EJ (2012) Efficiency and security problems of anonymous key agreement protocol based on chaotic maps. Commun. Nonlinear Sci. Numer. Simul. 17: pp. 2735-2740 CrossRef
  19. Xue, KP, Hong, PL (2012) Security improvement on an anonymous key agreement protocol ba
• 刊物类别：Engineering
• 刊物主题：Vibration, Dynamical Systems and Control
  Mechanics
  Mechanical Engineering
  Automotive and Aerospace Engineering and Traffic
  
• 出版者：Springer Netherlands
• ISSN：1573-269X

文摘

An authenticated key agreement protocol is a protocol for information security over insecure networks. Due to the excellent properties of chaotic system, chaos-related cryptography has received a certain development, and recently, researchers have presented some three-party authenticated key agreement protocols based on the chaotic maps. Unfortunately, most of the chaotic maps-based key agreement protocols use a password to achieve the key agreement, and this leads to some security loopholes. First, the server has to store a sensitive password table, and it would be dangerous if the server was compromised or the password table was leaked. Besides, the low-entropy passwords are vulnerable to some password-related attacks, such as insider attack and password guessing attacks. In this paper, we design a communication- and computation-efficient chaotic maps-based three-party authenticated key agreement protocol without password and clock synchronization, and formally analyze the security using Burrows–Abadi–Needham logic. In addition to the formal analysis, we also prove that the presented protocol is free from most of the common attacks, and compare the performance and functionality with other related protocols. The result of the analysis and comparisons demonstrate that our protocol is more efficient and practical for real applications.