DNA-based client puzzle for WLAN association protocol against connection request flooding

In recent past, Wireless Local Area Network (WLAN) has become more popular because of its flexibility. However, WLANs are subjected to different types of vulnerabilities. To strengthen WLAN security, many high security protocols have been developed. But those solutions are found to be ineffective in...

Full description

Saved in:

Bibliographic Details
Main Author:	Ordi, Ali
Format:	Thesis
Language:	English
Published:	2016
Subjects:	TK7885-7895 Computer engineer Computer hardware
Online Access:	http://eprints.utm.my/id/eprint/81856/1/AliOrdiPAIS2016.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.81856
record_format	uketd_dc
spelling	my-utm-ep.818562019-09-29T10:53:56Z DNA-based client puzzle for WLAN association protocol against connection request flooding 2016-05 Ordi, Ali TK7885-7895 Computer engineer. Computer hardware In recent past, Wireless Local Area Network (WLAN) has become more popular because of its flexibility. However, WLANs are subjected to different types of vulnerabilities. To strengthen WLAN security, many high security protocols have been developed. But those solutions are found to be ineffective in preventing Denial of Service (DoS) attacks. A ‘Connection Request Flooding’ DoS (CRF-DoS) attack is launched when an access point (AP) encounters a sudden explosion of connection requests. Among other existing anti CRF-DoS methods, a client puzzle protocol has been noted as a promising and secure potential solution. Nonetheless, so far none of the proposed puzzles satisfy the security requirement of resource-limited and highly heterogeneous WLANs. The CPU disparity, imposing unbearable loads on legitimate users, inefficient puzzle generation and verification algorithms; the susceptibility of puzzle to secondary attacks on legitimate users by embedding fake puzzle parameters; and a notable delay in modifying the puzzle difficulty – these are some drawbacks of currently existing puzzles. To deal with such problems, a secure model of puzzle based on DNA and queuing theory is proposed, which eliminates the above defects while satisfying the Chen puzzle security model. The proposed puzzle (OROD puzzle) is a multifaceted technology that incorporates five main components include DoS detector, queue manager, puzzle generation, puzzle verification, and puzzle solver. To test and evaluate the security and performance, OROD puzzle is developed and implemented in real-world environment. The experimental results showed that the solution verification time of OROD puzzle is up to 289, 160, 9, 3.2, and 2.3 times faster than the Karame-Capkun puzzle, the Rivest time-lock puzzle, the Rangasamy puzzle, the Kuppusamy DLPuz puzzle, and Chen's efficient hash-based puzzle respectively. The results also showed a substantial reduction in puzzle generation time, making the OROD puzzle from 3.7 to 24 times faster than the above puzzles. Moreover, by asking to solve an easy and cost-effective puzzle in OROD puzzle, legitimate users do not suffer from resource exhaustion during puzzle solving, even when under severe DoS attack (high puzzle difficulty). 2016-05 Thesis http://eprints.utm.my/id/eprint/81856/ http://eprints.utm.my/id/eprint/81856/1/AliOrdiPAIS2016.pdf application/pdf en public http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:126329 phd doctoral Universiti Teknologi Malaysia, Advanced Informatics School Advanced Informatics School
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
language	English
topic	TK7885-7895 Computer engineer Computer hardware
spellingShingle	TK7885-7895 Computer engineer Computer hardware Ordi, Ali DNA-based client puzzle for WLAN association protocol against connection request flooding
description	In recent past, Wireless Local Area Network (WLAN) has become more popular because of its flexibility. However, WLANs are subjected to different types of vulnerabilities. To strengthen WLAN security, many high security protocols have been developed. But those solutions are found to be ineffective in preventing Denial of Service (DoS) attacks. A ‘Connection Request Flooding’ DoS (CRF-DoS) attack is launched when an access point (AP) encounters a sudden explosion of connection requests. Among other existing anti CRF-DoS methods, a client puzzle protocol has been noted as a promising and secure potential solution. Nonetheless, so far none of the proposed puzzles satisfy the security requirement of resource-limited and highly heterogeneous WLANs. The CPU disparity, imposing unbearable loads on legitimate users, inefficient puzzle generation and verification algorithms; the susceptibility of puzzle to secondary attacks on legitimate users by embedding fake puzzle parameters; and a notable delay in modifying the puzzle difficulty – these are some drawbacks of currently existing puzzles. To deal with such problems, a secure model of puzzle based on DNA and queuing theory is proposed, which eliminates the above defects while satisfying the Chen puzzle security model. The proposed puzzle (OROD puzzle) is a multifaceted technology that incorporates five main components include DoS detector, queue manager, puzzle generation, puzzle verification, and puzzle solver. To test and evaluate the security and performance, OROD puzzle is developed and implemented in real-world environment. The experimental results showed that the solution verification time of OROD puzzle is up to 289, 160, 9, 3.2, and 2.3 times faster than the Karame-Capkun puzzle, the Rivest time-lock puzzle, the Rangasamy puzzle, the Kuppusamy DLPuz puzzle, and Chen's efficient hash-based puzzle respectively. The results also showed a substantial reduction in puzzle generation time, making the OROD puzzle from 3.7 to 24 times faster than the above puzzles. Moreover, by asking to solve an easy and cost-effective puzzle in OROD puzzle, legitimate users do not suffer from resource exhaustion during puzzle solving, even when under severe DoS attack (high puzzle difficulty).
format	Thesis
qualification_name	Doctor of Philosophy (PhD.)
qualification_level	Doctorate
author	Ordi, Ali
author_facet	Ordi, Ali
author_sort	Ordi, Ali
title	DNA-based client puzzle for WLAN association protocol against connection request flooding
title_short	DNA-based client puzzle for WLAN association protocol against connection request flooding
title_full	DNA-based client puzzle for WLAN association protocol against connection request flooding
title_fullStr	DNA-based client puzzle for WLAN association protocol against connection request flooding
title_full_unstemmed	DNA-based client puzzle for WLAN association protocol against connection request flooding
title_sort	dna-based client puzzle for wlan association protocol against connection request flooding
granting_institution	Universiti Teknologi Malaysia, Advanced Informatics School
granting_department	Advanced Informatics School
publishDate	2016
url	http://eprints.utm.my/id/eprint/81856/1/AliOrdiPAIS2016.pdf
_version_	1747818418679054336

DNA-based client puzzle for WLAN association protocol against connection request flooding

Similar Items