National Changhua University of Education Institutional Repository : Item 987654321/12165

English | 正體中文 | 简体中文 | Items with full text/Total items : 6507/11669
Visitors : 29961550 Online Users : 467

RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope Adv. Search

Login ‧ Upload ‧ Help ‧ About ‧ Administer

NCUEIR > College of Science > math > Periodical Articles > Item 987654321/12165

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/12165

Title:	A Pairing-Based User Authentication Scheme for Wireless Clients with Smart Cards
Authors:	Tseng, Yuh-Min;Wu, Tsu-Yang;Wu, Jui-Di
Contributors:	數學系
Keywords:	Authentication;Wireless client;Identity-based;Smart card;Bilinear pairing
Date:	2008-04
Issue Date:	2012-07-03T03:45:03Z
Publisher:	IOS Press Amsterdam
Abstract:	With rapid growth of mobile wireless networks, handheld devices are popularly used by people and many mobile applications have been rapidly developed. Considering the limited computing capability of smart cards or mobile devices, the security scheme design suitable for these mobile devices is a nontrivial challenge. A user authentication scheme is a mechanism to authenticate a remote user over an open network. In 2006, Das et al. proposed an identity (ID)-based remote user authentication scheme with smart cards using bilinear pairings. Unfortunately, their scheme is insecure against forgery attack. Recently, Giri and Srivastava proposed an improved scheme to overcome the forgery attack. The computational cost required by the Giri-Srivastava scheme is expensive, especially for smart cards with limited computing capability. In addition, the Giri-Srivastava scheme is unable to be used for a multi-server environment. This paper presents an efficient and secure ID-based remote user authentication scheme using bilinear pairings. Based on the computational Diffie-Hellman assumption, we show that the proposed scheme is secure against existential forgery on adaptively chosen-message and ID attack in the random oracle model. As compared with the recently proposed pairing-based authentication schemes, our scheme has better performance in term of the computational cost and it is suitable for a multi-server environment in distributed networks. Performance analysis and experimental data of related pairing operations on smartcards are given to demonstrate that our scheme is well suited for mobile devices with limited computing capability.
Relation:	Informatica, 19(2): 285-302
Appears in Collections:	[math] Periodical Articles

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	636	View/Open

Loading...