The Community for Technology Leaders
Green Image
Issue No. 04 - April (2013 vol. 24)
ISSN: 1045-9219
pp: 672-680
Chun-I Fan , Dept. of Comput. Sci. & Eng., Nat. Sun Yat-sen Univ., Kaohsiung, Taiwan
Yi-Hui Lin , Dept. of Comput. Sci. & Eng., Nat. Sun Yat-sen Univ., Kaohsiung, Taiwan
Ruei-Hau Hsu , Dept. of Comput. Sci. & Eng., Nat. Sun Yat-sen Univ., Kaohsiung, Taiwan
It is necessary to authenticate users who attempt to access resources in Wireless Local Area Networks (WLANs). Extensible Authentication Protocol (EAP) is an authentication framework widely used in WLANs. Authentication mechanisms built on EAP are called EAP methods. The requirements for EAP methods in WLAN authentication have been defined in RFC 4017. To achieve user efficiency and robust security, lightweight computation and forward secrecy, excluded in RFC 4017, are desired in WLAN authentication. However, all EAP methods and authentication protocols designed for WLANs so far do not satisfy all of the above properties. This manuscript will present a complete EAP method that utilizes stored secrets and passwords to verify users so that it can 1) fully meet the requirements of RFC 4017, 2) provide for lightweight computation, and 3) allow for forward secrecy. In addition, we also demonstrate the security of our proposed EAP method with formal proofs.
wireless LAN, cryptographic protocols, RFC 4017, EAP method, user efficient authentication protocol, forward secure authentication protocol, IEEE 802.11 wireless LAN, Wireless Local Area Network, Extensible Authentication Protocol, stored secret, user verification, Authentication, Protocols, Servers, Cryptography, Wireless LAN, Privacy, lightweight computation, Wireless local area networks (WLANs), extensible authentication protocol (EAP), forward secrecy, passwords, authentication

Yi-Hui Lin, Chun-I Fan and Ruei-Hau Hsu, "Complete EAP Method: User Efficient and Forward Secure Authentication Protocol for IEEE 802.11 Wireless LANs," in IEEE Transactions on Parallel & Distributed Systems, vol. 24, no. , pp. 672-680, 2013.
183 ms
(Ver 3.3 (11022016))