New client puzzle approach for DoS resistance in ad hoc networks

Michalas, A., Komninos, N., Prasad, N. R. & Oleshchuk, V. A. (2010). New client puzzle approach for DoS resistance in ad hoc networks. Proceedings 2010 IEEE International Conference on Information Theory and Information Security, ICITIS 2010, pp. 568-573. doi: 10.1109/ICITIS.2010.5689528

[img]
Preview
Text - Accepted Version
Download (495kB) | Preview

Abstract

In this paper we propose a new client puzzle approach to prevent Denial of Service (DoS) attacks in ad hoc networks. Each node in the network first solves a computational problem and with the solution has to create and solve a client puzzle. By combining computational problems with puzzles, we improve the efficiency and latency of the communicating nodes and resistance in DoS attacks. Experimental results show the effectiveness of our approach.

Item Type: Article
Additional Information: © 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
Uncontrolled Keywords: Cryptographic puzzles, client puzzles, Denial of Service (DoS), Distributed Denial of Service (DDoS)
Subjects: Q Science > QA Mathematics > QA76 Computer software
Divisions: School of Informatics > Informatics and Interdisciplinary Centre for Information Leadership
School of Informatics > Centre for Software Reliability
URI: http://openaccess.city.ac.uk/id/eprint/2486

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics