A ROBUST AUTHENTICATION SCHEME WITH USER ANONYMITY FOR WIRELESS ENVIRONMENTS

被引:0
作者
Wang, Ren-Chiun [1 ]
Juang, Wen-Shenq [2 ]
Lei, Chin-Laung [1 ]
机构
[1] Natl Taiwan Univ, Dept Elect Engn, Taipei 106, Taiwan
[2] Natl Kaohsiung First Univ Sci & Technol, Dept Informat Management, Kaohsiung 811, Taiwan
来源
INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL | 2009年 / 5卷 / 04期
关键词
Anonymity; Authentication; Password; Logic analysis; Smart card; Wireless communications; CHANNEL; NETWORKS; SECURITY; PROTOCOL; PRIVACY;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Due to the openness of data transmission over wireless environments, the wireless networks are susceptible to various security menaces. Authentication and key agreement become a basic and most important procedure before a mobile user cart obtain the desired services. Apart from the security threats, in a limited bandwidth and the openness wireless environment, low computation and communication cost with privacy should be taken into considerations. Recently, Zhu and Ma proposed art authentication scheme with user anonymity for wireless environments based on hash functions and smart cards. In their scheme, the communication and computation cost is very low. However, Lee et al. pointed out that Zhu and Ma's scheme is vulnerable to several security problems. The perfect backward secrecy and mutual authentication are not provided and the forgery attack cart work in Zhu and Ma's scheme. At the same time, Lee et al. proposed art improvement to solve the above weaknesses and to keep the efficiency. However, in this paper, we show that. Lee et al.'s scheme cannot provide the anonymity for a mobile user and the key agreement procedure is not correct. Also, if a smart card is stolen by art adversary, the adversary could launch the impersonation attack on Lee et al.'s scheme. We then propose a new authentication scheme. Our scheme not only provides more security criteria but, also requires low communication and computation cost. Finally, we use the logic analysis method to prove our scheme.
引用
收藏
页码:1069 / 1080
页数:12
相关论文
共 25 条
[1]  
AZIZ A, 1994, IEEE PERS COMMUN, V1, P24
[2]   PRIVACY AND AUTHENTICATION ON A PORTABLE COMMUNICATIONS-SYSTEM [J].
BELLER, MJ ;
CHANG, LF ;
YACOBI, Y .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1993, 11 (06) :821-829
[3]   A simple logic for authentication protocol design [J].
Buttyan, L ;
Staamann, S ;
Wilhelm, U .
11TH IEEE COMPUTER SECURITY FOUNDATIONS WORKSHOP - PROCEEDINGS, 1998, :153-162
[4]  
Chang YF, 2008, INT J INNOV COMPUT I, V4, P425
[5]   Noncommutative superspace and super Heisenberg group [J].
Chang-Young, Ee ;
Kim, Hoil ;
Nakajima, Hiroaki .
JOURNAL OF HIGH ENERGY PHYSICS, 2008, (04)
[6]  
Chen CY, 2008, INT J INNOV COMPUT I, V4, P1335
[7]  
GO J, 2001, P 2001 S CRYPT INF S, P159
[8]  
Horn G, 1998, LECT NOTES COMPUT SC, V1485, P277, DOI 10.1007/BFb0055870
[9]  
Jan JK, 2001, IEICE T COMMUN, VE84B, P484
[10]   Anonymous channel and authentication in wireless communications [J].
Juang, WS ;
Lei, CL ;
Chang, CY .
COMPUTER COMMUNICATIONS, 1999, 22 (15-16) :1502-1511