| Mission |
| Members |
| Research |
| Publications |
| Teaching |
| Industrial connections |
| Activity reports |
| Contact information |
| Miscellaneous |
| Meeting information |
| Webmail |
| magyar · english |
A game based analysis of the client puzzle approach to defend against DoS attacks
Proceedings of SoftCOM 2003 11. International conference on software, telecommunications and computer networks, Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, University of Split, 2003, pp. 763-767, Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, University of Split.
abstract DoS attacks are aimed at the loss of or the reduction in availability, which is one of the most important general security requirements in computer networks. A promising approach proposed to alleviate the problem of DoS attacks is to use client puzzles. In this paper, we study this approach using the apparatus of game theory. In our analysis, we derive the optimal strategy for the attacked server (e.g., a web server on the Internet) in all conceivable cases. We also present two new client puzzles as examples.