Name
Abstract | ||
|---|---|---|
An attack graph represents all known sequences of actions that compromise a system in form of an and-or graph. We assume that each action in the attack graph has a specified cost and probability of success and propose an algorithm for computing an action selection policy minimizing the expected cost of performing an attack. We model the problem as a finite horizon MDP and use forward search with transposition tables and various pruning techniques based on the structure of the attack graph. We experimentally compare the proposed algorithm to a generic MDP solver and a solver transforming the problem to an Unconstrained Influence Diagram showing a substantial runtime improvement. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.3233/978-1-61499-421-3-101 | Frontiers in Artificial Intelligence and Applications |
Keywords | Field | DocType |
optimal policy,attack graph,markov decision process,and-or graph | Computer science,Computer security,Theoretical computer science,Attack graph | Conference |
Volume | ISSN | Citations |
264 | 0922-6389 | 6 |
PageRank | References | Authors |
0.53 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Karel Durkota | 1 | 40 | 4.85 |
| Viliam Lisy | 2 | 27 | 3.41 |