Paper 2009/350
Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles
Harikrishna Narasimhan, Venkatanathan Varadarajan, and 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.
Metadata
- Available format(s)
-
PDF
- Category
- Applications
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Denial of Service AttackProof-of-WorkHidden Difficulty PuzzleGame Theory
- Contact author(s)
- venk1989 @ gmail com
- History
- 2009-07-21: received
- Short URL
- https://ia.cr/2009/350
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/350,
author = {Harikrishna Narasimhan and Venkatanathan Varadarajan and C. Pandu Rangan},
title = {Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/350},
year = {2009},
url = {https://eprint.iacr.org/2009/350}
}
