New client puzzle approach for DoS resistance in ad hoc Networks

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

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE International Conference on Information Theory and Information Security pp. 568 - 573
Main Authors Michalas, A, Komninos, N, Prasad, N R, Oleshchuk, V A
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2010
Subjects
Ad hoc networks
Client Puzzles
Computer crime
Cryptographic Puzzles
Cryptography
Denial of Service (DoS)
Distributed Denial of Service (DDoS)
Equations
Mathematical model
Servers
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:1424469422
9781424469420
DOI:10.1109/ICITIS.2010.5689528