z-logo
open-access-imgOpen Access
Reducing distributed denial of service (DDoS) attacks using client puzzle mechanism
Author(s) -
C. Vasan Sai Krishna,
Y. Bhuvana,
Pradeep Kumar,
R. Murugan
Publication year - 2017
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i1.1.9473
Subject(s) - computer science , denial of service attack , computer network , fat client , botnet , server , computer security , client side , server farm , server side , client–server model , remote evaluation , operating system , client , the internet
In a typical DoS attack, the attacker tries to bring the server down. In this case, the attacker sends a lot of bogus queries to the server to consume its computing power and bandwidth. As the server’s bandwidth and computing power are always greater than attacker’s client machine, He seeks help from a group of connected computers. DDoS attack involves a lot of client machines which are hijacked by the attacker (together called as botnet). As the server handles all these requests sent by the attacker, all its resources get consumed and it cannot provide services. In this project, we are more concerned about reducing the computing power on the server side by giving the client a puzzle to solve. To prevent such attacks, we use client puzzle mechanism. In this mechanism, we introduce a client-side puzzle which demands the machine to perform tasks that require more resources (computation power). The client’s request is not directly sent to the server. Moreover, there will be an Intermediate Server to monitor all the requests that are being sent to the main server. Before the client’s request is sent to the server, it must solve a puzzle and send the answer. Intermediate Server is used to validate the answer and give access to the client or block the client from accessing the server.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here