Cryptology ePrint Archive: Report 2009/350

Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles

Harikrishna Narasimhan and 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.

Category / Keywords: applications / Denial of Service Attack, Proof-of-Work, Hidden Difficulty Puzzle, Game Theory

Date: received 16 Jul 2009

Contact author: venk1989 at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20090721:193834 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]