[PDF][PDF] Optimal network security hardening using attack graph games

K Durkota, V Lisy, B Bošansky, C Kiekintveld - Proceedings of IJCAI, 2015 - nms.kcl.ac.uk
Preventing the attacks in a computer network is the core problem in network security. We
introduce a new game-theoretic model of the interaction between a network administrator …

Computing optimal attack strategies using unconstrained influence diagrams

V Lisý, R Píbil - Intelligence and Security Informatics: Pacific Asia …, 2013 - Springer
Attack graphs are a formalism for capturing the most important ways to compromise a
system. They are used for evaluating risks and designing appropriate countermeasures …

On the complexity of general solution dags

J Iša, Z Reitermanová, O Sýkora - … International Conference on …, 2009 - ieeexplore.ieee.org
The General Solution DAGs (GS-DAGs) are a method used to solve the Unconstrained
Influence Diagrams (UIDs). In the first part of this paper, we determine the strict upper bound …

Herněteoretický přístup k optimalizaci konfigurací

K Durkota - 2018 - dspace.cvut.cz
he current development of computer networks brings convenience and comfort to the users.
Unfortunately, the computer networks are increasingly attacked, which poses security threats …

Game Theoretic Approach to Security Configuration Problems

K Durkota - 2018 - search.proquest.com
The current development of computer networks brings convenience and comfort to the
users. Unfortunately, the computer networks are increasingly attacked, which poses security …

Cost-sensitive classification with unconstrained influence diagrams

J Iša, Z Reitermanová, O Sýkora - … Conference on Current Trends in Theory …, 2012 - Springer
In this paper, we deal with an enhanced problem of cost-sensitive classification, where not
only the cost of misclassification needs to be minimized, but also the total cost of tests and …