The Community for Technology Leaders
Green Image
Issue No. 05 - Sept.-Oct. (2016 vol. 31)
ISSN: 1541-1672
pp: 24-30
Karel Durkota , Czech Technical University
Viliam Lisy , Czech Technical University and University of Alberta
Christopher Kiekintveld , University of Texas at El Paso
Branislav Bosansky , Czech Technical University
Michal Pechoucek , Czech Technical University
ABSTRACT
The increasing complexity of securing modern computer networks makes decision support systems an important tool for administrators. A challenge many existing tools fail to address is that attackers react strategically to new security measures, adapting their behaviors in response. Game theory provides a methodology for making decisions that takes into account these reactions, rather than assuming static attackers. The authors present an overview of how game theory can be used to inform one type of security decision: how to optimally place honeypots in a network. They demonstrate this approach on a realistic case study and present initial validation results based on a study comparing their approach with human decision makers.
INDEX TERMS
Network security, Databases, Game theory, Computational modeling, Communication networks, Knowledge engineering
CITATION

K. Durkota, V. Lisy, C. Kiekintveld, B. Bosansky and M. Pechoucek, "Case Studies of Network Defense with Attack Graph Games," in IEEE Intelligent Systems, vol. 31, no. 5, pp. 24-30, 2016.
doi:10.1109/MIS.2016.74
301 ms
(Ver 3.3 (11022016))