DDoS detection and traceback with decision tree and grey relational analysis
International Journal of Ad Hoc and Ubiquitous Computing
Game theoretic resistance to denial of service attacks using hidden difficulty puzzles
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
Review: Analyzing well-known countermeasures against distributed denial of service attacks
Computer Communications
Towards a bayesian network game framework for evaluating DDoS attacks and defense
Proceedings of the 2012 ACM conference on Computer and communications security
Applying Puzzle-Based Learning to Cyber-Security Education
Proceedings of the 2013 on InfoSecCD '13: Information Security Curriculum Development Conference
Hi-index | 0.00 |
In recent years, a number of puzzle-based defense mechanisms have been proposed against flooding denial-of-service (DoS) attacks in networks. Nonetheless, these mechanisms have not been designed through formal approaches and thereby some important design issues such as effectiveness and optimality have remained unresolved. This paper utilizes game theory to propose a series of optimal puzzle-based strategies for handling increasingly sophisticated flooding attack scenarios. In doing so, the solution concept of Nash equilibrium is used in a prescriptive way, where the defender takes his part in the solution as an optimum defense against rational attackers. This study culminates in a strategy for handling distributed attacks from an unknown number of sources.