Mutual Authentication with Anonymity for Roaming Service with Smart Cards in Wireless Communications

  • Chang-Shiun Liu
  • Li Xu
  • Limei Lin
  • Min-Chi Tseng
  • Shih-Ya Lin
  • Hung-Min SunEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9955)


Most of the mutual authentication protocols with user anonymity proposed for providing secure roaming service through wireless communications are based on smart cards and have to establish public key cryptosystems in advance. To solve this, Guo et al. firstly proposed an efficient mutual authentication protocol with user anonymity using smart card for wireless communications. Unfortunately, we will demonstrate their scheme requires high modular exponential operations for security issues, and does not allow users to change passwords freely. Based on modular square root, we propose an efficient remote user authentication protocol with smart cards for wireless communications. Compared with others, our protocol is more suitable for mobile devices and smart-card users.


Anonymity Roaming service Chaotic map Modular square root 


  1. 1.
    Guo, C., Chang, C.C., Sun, C.Y.: Chaotic maps-based mutual authentication and key agreement using smart cards for wireless communications. J. Inf. Hiding Multimedia Sig. Process. 4(2), 99–109 (2013)Google Scholar
  2. 2.
    He, D., Ma, M., Zhang, Y., Chen, C., Jiajun, B.: A strong user authentication scheme with smart cards for wireless communications. Comput. Commun. 34(3), 367–374 (2011)CrossRefGoogle Scholar
  3. 3.
    Campello de Souzac, R.M., Limaa, J.B., Panariob, D.: Public-key encryption based on chebyshev polynomials over gf(q). Inf. Process. Lett. 111, 51–56 (2010)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Jebek, E.: Integer factoring and modular square roots. J. Comput. Syst. Sci. 82, 380–394 (2016)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Lee, C.C., Hwang, M.S., Liao, I.E.: Security enhancement on a new authentication scheme with anonymity for wireless environments. IEEE Trans. Ind. Electron. 53(5), 1683–1687 (2006)CrossRefGoogle Scholar
  6. 6.
    Rabin, M.O.: Digitalized signatures and public-key functions as intractable as factorization. Technical report, Cambridge, MA, USA (1979)Google Scholar
  7. 7.
    Wang, X., Zhao, J.: An improved key agreement protocol based on chaos. Commun. Nonlinear Sci. Numer. Simul. 15(12), 4052–4057 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Williams, H.C.: A modification of the rsa public-key encryption procedure (corresp.). IEEE Trans. Inf. Theory 26(6), 726–729 (1980)CrossRefzbMATHGoogle Scholar
  9. 9.
    Jing, X., Zhu, W.T., Feng, D.G.: An efficient mutual authentication and key agreement protocol preserving user anonymity in mobile networks. Comput. Commun. 34(3), 319–325 (2011)CrossRefGoogle Scholar
  10. 10.
    Yoon, E.J., Jeon, I.S.: An efficient and secure diffie-hellman key agreement protocol based on chebyshev chaotic map. Commun. Nonlinear Sci. Numer. Simul. 16(6), 2383–2389 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Zhang, L.: Cryptanalysis of the public key encryption based on multiple chaotic systems. Chaos, Solitons Fractals 37(3), 669–674 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Zhou, T., Jing, X.: Provable secure authentication protocol with anonymity for roaming service in global mobility networks. Comput. Netw. 55(1), 205–213 (2011)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Chang-Shiun Liu
    • 1
  • Li Xu
    • 2
  • Limei Lin
    • 2
  • Min-Chi Tseng
    • 1
  • Shih-Ya Lin
    • 1
  • Hung-Min Sun
    • 1
    Email author
  1. 1.Department of Computer ScienceNational Tsing Hua UniversityHsinchuTaiwan
  2. 2.Fujian Provincial Key Laboratory of Network Security and Cryptology, School of Mathematics and Computer ScienceFujian Normal UniversityFuzhouChina

Personalised recommendations