Universiti Teknologi Malaysia Institutional Repository

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

Ordi, Ali (2016) DNA-based client puzzle for WLAN association protocol against connection request flooding. PhD thesis, Universiti Teknologi Malaysia, Advanced Informatics School.

[img]
Preview
PDF
523kB

Official URL: http://dms.library.utm.my:8080/vital/access/manage...

Abstract

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).

Item Type:Thesis (PhD)
Additional Information:Thesis (Ph.D) - Universiti Teknologi Malaysia, 2016; Supervisors : Dr. Mazdak Zamani, Prof. Dr. Norbik Bashah Idris
Subjects:T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK7885-7895 Computer engineer. Computer hardware
Divisions:Advanced Informatics School
ID Code:81856
Deposited By: Fazli Masari
Deposited On:29 Sep 2019 18:53
Last Modified:29 Sep 2019 18:53

Repository Staff Only: item control page