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

详细信息    查看全文

• 关键词：Anonymity ; Roaming service ; Chaotic map ; Modular square root
• 刊名：Lecture Notes in Computer Science
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：9955
• 期：1
• 页码：47-61
• 全文大小：576 KB
• 参考文献：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)
  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)CrossRef
  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)CrossRef MathSciNet
  4.Jebek, E.: Integer factoring and modular square roots. J. Comput. Syst. Sci. 82, 380–394 (2016)CrossRef MathSciNet
  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)CrossRef
  6.Rabin, M.O.: Digitalized signatures and public-key functions as intractable as factorization. Technical report, Cambridge, MA, USA (1979)
  7.Wang, X., Zhao, J.: An improved key agreement protocol based on chaos. Commun. Nonlinear Sci. Numer. Simul. 15(12), 4052–4057 (2010)CrossRef MATH MathSciNet
  8.Williams, H.C.: A modification of the rsa public-key encryption procedure (corresp.). IEEE Trans. Inf. Theory 26(6), 726–729 (1980)CrossRef MATH
  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)CrossRef
  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)CrossRef MATH MathSciNet
  11.Zhang, L.: Cryptanalysis of the public key encryption based on multiple chaotic systems. Chaos, Solitons Fractals 37(3), 669–674 (2008)CrossRef MATH MathSciNet
  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)CrossRef MATH
  
• 作者单位：Chang-Shiun Liu (17)
  Li Xu (18)
  Limei Lin (18)
  Min-Chi Tseng (17)
  Shih-Ya Lin (17)
  Hung-Min Sun (17)
  
  17. Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan
  18. Fujian Provincial Key Laboratory of Network Security and Cryptology, School of Mathematics and Computer Science, Fujian Normal University, Fuzhou, Fujian, China
  
• 丛书名：Network and System Security
• ISBN：978-3-319-46298-1
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349
• 卷排序：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.