DocumentCode
2105149
Title
New client puzzle approach for DoS resistance in ad hoc Networks
Author
Michalas, Antonis ; Komninos, Nikos ; Prasad, Neeli R. ; Oleshchuk, Vladimir A.
Author_Institution
Athens Inf. Technol., Athens, Greece
fYear
2010
fDate
17-19 Dec. 2010
Firstpage
568
Lastpage
573
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.
Keywords
ad hoc networks; security of data; DoS attacks; DoS resistance; ad hoc networks; client puzzle approach; computational problem; denial of service attacks; Ad hoc networks; Computer crime; Cryptography; Equations; Mathematical model; Servers; Client Puzzles; Cryptographic Puzzles; Denial of Service (DoS); Distributed Denial of Service (DDoS);
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and Information Security (ICITIS), 2010 IEEE International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-6942-0
Type
conf
DOI
10.1109/ICITIS.2010.5689528
Filename
5689528
Link To Document