A New Secure Strategy in Small-Scale IEEE 802.11 Wireless Local Area Networks with Web Authentication and Virtual Local Area Network

Full Text (PDF, 254KB), PP.19-25

Views: 0 Downloads: 0

Author(s)

Huiting Liu 1,2,* Hua ZHANG 1 Weilin Xu 1,2 Yigang Yang 1,2 Mengyuan Xu 2

1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications

2. School of Computer, Beijing University of Posts and Telecommunications Beijing, China

* Corresponding author.

DOI: https://doi.org/10.5815/ijcnis.2011.02.03

Received: 11 May 2010 / Revised: 23 Sep. 2010 / Accepted: 5 Dec. 2010 / Published: 8 Mar. 2011

Index Terms

Wireless local area network (WLAN), secure strategy, web authentication, identify theft, virtual local area network (VLAN)

Abstract

As the main secret-key encryption techniques of the wireless local area network (WLAN) have been proven to be unsafe, wireless network security is faced with serious challenges. It is unpractical for home users and small companies to purchase expensive network equipments to improve the network security. Therefore, the secure strategy for wireless network needs to be changed. In this paper, we first introduce secure issues of the main secret-key encryption techniques currently adopted by the most popular commercial wireless routers. Then we describe our initial designs and propose a new strategy for small-scale IEEE 802.11 wireless local area network which can strengthen the network security. The new secure strategy is based on web authentication with unshared key and virtual local area network (VLAN) in wireless network. It can provide protection against practical attacks which are popular nowadays. Moreover, it is simple, easy to use and price moderate. At last, we evaluate the performance of the new secure strategy and give our conclusions.

Cite This Paper

Huiting Liu, Hua Zhang, Weilin Xu, Yigang Yang, Mengyuan Xu, "A New Secure Strategy in Small-Scale IEEE 802.11 Wireless Local Area Networks with Web Authentication and Virtual Local Area Network", International Journal of Computer Network and Information Security(IJCNIS), vol.3, no.2, pp.19-25, 2011. DOI:10.5815/ijcnis.2011.02.03

Reference

[1]E. Tews, R.-P. Weinmann, and A. Pyshki, “Breaking 104—bit WEP in less than 60 seconds,” WISA'07 Proceedings, Springer-Verlag Berlin, Heidelberg, pp. 188-202, 2007.
[2]E. Tews, M. Beck, “Practical attacks against WEP and WPA,” WiSec '09 Proceedings, ACM New York, pp.79-86. 2009
[3]M. Beck, “Enhanced TKIP michael attacks”, unpublished.
[4]Xiaoyun Wang, Dengguo Feng, Xuejia Lai, and Hongbo Yu, “Collisions for hash functions MD4, MD5, HAVAL-128 and RIPEMD,” Crypto 2004, August, 2004, retrieved July 27, 2008, in press.
[5]Xiaoyun Wang and Hongbo Yu, “How to break MD5 and other hash functions,” EUROCRYPT 2005 Proceedings, Springer-Verlag Berlin, Heidelberg, pp.19-35, 2005. Retrieved December 21, 2009.
[6]J. Black, M. Cochran, and T. Highland, “A study of the MD5 attacks: insights and improvements,” FSE 2006 Proceedings, Springer-Verlag Berlin, Heidelberg, pp.262-277, March, 2006. Retrieved July 27, 2008.
[7]M. M. J. Stevens, “On collisions for MD5”, unpublished.
[8]M. Stevens, A. Lenstra, and B. Weger, “Chosen-prefix collisions for MD5 and Applications.”,unpublished.
[9]M. Stevens, A. Lenstra, and B. Weger, “Chosen-Prefix collisions for MD5 and colliding X.509 certificates for different identities”, EUROCRYPT '07 Proceedings, Springer-Verlag Berlin, Heidelberg, pp.1-22, 2007.