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

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.

[1]  Jing Xu,et al.  Provable secure authentication protocol with anonymity for roaming service in global mobility networks , 2011, Comput. Networks.

[2]  Cheng-Chi Lee,et al.  Security Enhancement on a New Authentication Scheme With Anonymity for Wireless Environments , 2006, IEEE Transactions on Industrial Electronics.

[3]  Emil Jerábek.  Integer factoring and modular square roots , 2016, J. Comput. Syst. Sci..

[4]  Xing-yuan Wang,et al.  An improved key agreement protocol based on chaos , 2010 .

[5]  Chin-Chen Chang,et al.  Chaotic Maps-Based Mutual Authentication and Key Agreement using Smart Cards for Wireless Communications , 2013, J. Inf. Hiding Multim. Signal Process..

[6]  Chun Chen,et al.  A strong user authentication scheme with smart cards for wireless communications , 2011, Comput. Commun..

[7]  Hugh C. Williams,et al.  A modification of the RSA public-key encryption procedure (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[8]  Linhua Zhang.  Cryptanalysis of the public key encryption based on multiple chaotic systems , 2008 .

[9]  Dengguo Feng,et al.  An efficient mutual authentication and key agreement protocol preserving user anonymity in mobile networks , 2011, Comput. Commun..

[10]  M. Rabin.  DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .

[11]  Eunjun Yoon,et al.  An efficient and secure Diffie–Hellman key agreement protocol based on Chebyshev chaotic map , 2011 .

[12]  Daniel Panario,et al.  Public-key encryption based on Chebyshev polynomials over GF(q) , 2010, Inf. Process. Lett..