This paper presents a mutual authentication and key exchange scheme using bilinear pairings. The proposed scheme is secure against passive attack, forgery attack and ID attack. It provides mutual authentication, implicit key confirmation and partial forward secrecy.
This paper presents a mutual authentication and key exchange scheme using bilinear pairings. The proposed scheme is secure against passive attack, forgery attack and ID attack. It provides mutual authentication, implicit key confirmation and partial forward secrecy.
This paper presents a mutual authentication and key exchange scheme using bilinear pairings. The proposed scheme is secure against passive attack, forgery attack and ID attack. It provides mutual authentication, implicit key confirmation and partial forward secrecy.
A mutual authentication and key exchange scheme from bilinear pairings for
low power computing devices
Yuh-Min Tseng*, Tsu-Yang Wu and Jui-Di Wu
Department of Mathematics, National Changhua University of Education, Chang-Hua City 500, Taiwan, R.O.C. *Corresponding author’s E-mail: ymtseng@cc.ncue.edu.tw
Abstract based on bilinear pairings have been proposed such as
signature schemes [6,7,8] and authenticated key In a client-server network environment, a mutual agreement protocols [9,10,11,12]. authentication and key exchange scheme is an Although ID-based authenticated key agreement important security mechanism to provide two parties protocols [9,10,11,12] can offer mutual authentication with the property that they can authenticate each and key exchange, these protocols did not consider the other’s identity while they may construct a common computational cost on the user side with handheld session key. With rapid growth of mobile wireless devices. The computational cost on both sides in all networks, the computational cost on the client side these authenticated key agreement protocols requires at with low power computing devices is a critical factor least one bilinear pairing operation. But, a bilinear of the security scheme design. This paper presents a pairing operation is more time-consuming than other mutual authentication and key exchange scheme using operations [4,5]. bilinear pairings. Based on the computational Diffie- In 2006, Das et al. [13] proposed an efficient ID- Hellman assumption and the random oracle model, we based remote user authentication scheme with smart show that the proposed scheme is secure against cards using bilinear pairings. Unfortunately, Goriparthi passive attack, forgery attack and ID attack while it et al. [14] showed that their scheme is insecure against provides mutual authentication, implicit key forgery attack resulting in an adversary can always confirmation and partial forward secrecy. A pass the authentication. Recently, Giri and Srivastava performance analysis demonstrates that our scheme is [15] proposed an improved scheme to withstand the well suited for smart cards with limited computing forgery attack. The computational cost required by the capability. Giri-Srivastava scheme is too expensive, especially for smart cards with limited computing capability because 1. Introduction it still requires one bilinear pairing operation. In additions, both schemes do not provide mutual Now, handheld devices are popularly used by authentication and key exchange between the user and people and many mobile applications have rapidly the server. developed such as wireless internet services, mobile In this paper, we propose a mutual authentication access services and mobile e-commerce. If public-key and key exchange scheme using bilinear pairings. based cryptographic schemes are designed for mobile Users with smart cards generate the login messages users with handheld devices or smart cards, the and send them to the server. The smart card is a low computational cost on the user side is a critical issue in power computing device while a server is regarded as practical implementation because of their limited a powerful node. We shift the computational burden to computing capability [1,2,3]. the powerful node and reduce the computational cost Recently, Boneh and Franklin [4,5] proposed a required by smart cards. Based on the computational practical ID-based encryption system based on bilinear Diffie-Hellman assumption [4,5] and the random pairings. Bilinear pairings defined on elliptic curves oracle model [16], we show that the proposed scheme offer an effective approach to reduce the is secure against passive attack, forgery attack and ID computational cost of ID-based cryptographic schemes. attack while it provides implicit key confirmation and Afterwards, many ID-based cryptographic schemes partial forward secrecy. We make a performance
31st Annual International Computer Software and Applications Conference(COMPSAC 2007)
Microsoft Access Guide to Success: From Fundamentals to Mastery in Crafting Databases, Optimizing Tasks, & Making Unparalleled Impressions [III EDITION]