Efficient three-party authenticated key agreements based on Chebyshev chaotic map-based Diffie–Hellman assumption
- 188 Downloads
An efficient and secure three-party authenticated key agreement protocol is proposed to enable two users to establish a common secret key for exchanging confidential and authenticated information with the help of a trusted server. The proposed protocol only employs extended chaotic maps and hash operations, i.e., it does not require a server public key, symmetric cryptosystems, time-consuming modular exponential computations, or time-consuming modular exponential computations and scalar multiplications on elliptic curve. A round-efficient version of the proposed protocol is also implemented by rearranging and sending the messages in parallel. The session security of the proposed protocol is based on the Chebyshev chaotic map-based Diffie–Hellman assumption. Compared to related chaotic map-based approaches, the proposed protocol not only requires lower computational cost, but also has fewer transmissions.
KeywordsChebyshev chaotic maps Network protocols Authentication Network security
The authors would like to thank the editor and the anonymous referees for their valuable comments. This research was financially/partially supported by Ministry of Science and Technology of the Republic of China, Taiwan, under Contract No. MOST 103-2221-E-320 -003 and TCRPP103008. Ted Knoy is appreciated for his editorial assistance.
- 1.Bellovin, S. M., Merritt, M.: Encrypted key exchange: password-based protocols secure against dictionary attacks. In: Proceedings of the IEEE Symposium on Research in Security and Privacy, pp. 72–84 (1992)Google Scholar
- 2.Gong, L.: Optimal authentication protocols resistant to password guessing attacks. In: Proceedings of the 8th IEEE Computer Security Foundation Workshop, pp. 24–29 (1995)Google Scholar
- 10.Lee, T.F., Sung, M.J.: Communication-efficient AUTHMAC_DH protocols. Comput. Stand. Interfaces 30, 71–77 (2008)Google Scholar
- 13.Kocarev, L., Tasev, Z.: Public-key encryption based on Chebyshev maps. In: Proceedings of the International Symposium on Circuits and Systems, vol. 3, pp. III-28–III-31 (2003)Google Scholar
- 28.Tseng, H., Jan R., Yang, W.: A chaotic maps-based key agreement protocol that preserves user anonymity. In: IEEE International Conference on Communications (ICC09), pp. 1–6 (2009)Google Scholar
- 33.Chen, T., Wang, B., Tu, T., Wang, C.: A security-enhanced key agreement protocol based on chaotic maps. Secur. Commun. Netw. (2012). doi: 10.1002/sec.537
- 34.Lai, H., Xiao, J., Li, L., Yang, Y.: Applying semigroup property of enhanced Chebyshev polynomials to anonymous authentication protocol. Math. Probl. Eng. (2012). doi: 10.1155/2012/454823
- 38.Hu, X., Zhang, Z.: Cryptanalysis and enhancement of a chaotic maps-based three-party password authenticated key exchange protocol. Nonlinear Dyn. (2014). doi: 10.1007/s11071014-1515-x
- 41.Stallings, W.: Cryptography and Network Security: Principles and Practice, 2nd edn. Prentice Hall, Upper Saddle River (1999)Google Scholar