Welcome to the resource topic for 2009/350
Title:
Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles
Authors: Harikrishna Narasimhan, Venkatanathan Varadarajan, C. Pandu Rangan
Abstract:Denial of Service (DoS) vulnerabilities are one of the major concerns in today’s Internet. Client-puzzles offer a good mechanism to defend servers against DoS attacks. In this paper, we introduce the notion of hidden puzzle difficulty, where the attacker cannot determine the difficulty of the puzzle without expending a minimal amount of computational resource. Game theory is used to develop defense mechanisms, which make use of such puzzles. New puzzles that satisfy the requirements of the defense mechanisms have been proposed. We also show that our defense mechanisms are more effective than the ones proposed in the earlier work by Fallah.
ePrint: https://eprint.iacr.org/2009/350
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .