Computing Optimal Attack Strategies Using Unconstrained Influence Diagrams

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00212281" target="_blank" >RIV/68407700:21230/13:00212281 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-642-39693-9_5" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-642-39693-9_5</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-39693-9_5" target="_blank" >10.1007/978-3-642-39693-9_5</a>

Result language
angličtina
Original language name
Computing Optimal Attack Strategies Using Unconstrained Influence Diagrams
Original language description
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. Analysis of attack graphs sometimes requires computing the optimal attack strategy that minimizes the expected cost of the attacker in case of stochastically failing actions. We point out several results in AI literature that are highly relevant to this problem, but remain unnoticed by security literature. We note the problem has been shown to be NP-hard and we present how the problem can be reduced to the problem of solving an unconstrained influence diagram (UID). We use an existing UID solver to assess the scalability of the approach, showing that it can be used to optimally solve attack graphs with up to 20 attack actions.
Czech name
—
Czech description
—

Project
<a href="/en/project/GAP202%2F12%2F2054" target="_blank" >GAP202/12/2054: Security Games in Extensive Form</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)