All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Computing Optimal Policies for Attack Graphs with Action Failures and Costs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00219325" target="_blank" >RIV/68407700:21230/14:00219325 - isvavai.cz</a>

  • Result on the web

    <a href="http://ebooks.iospress.nl/publication/37199" target="_blank" >http://ebooks.iospress.nl/publication/37199</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.3233/978-1-61499-421-3-101" target="_blank" >10.3233/978-1-61499-421-3-101</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Computing Optimal Policies for Attack Graphs with Action Failures and Costs

  • Original language description

    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 actionselection 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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/VG20122014079" target="_blank" >VG20122014079: Behavioral Detection of Advanced Persistent Threats in Computer Networks</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2014

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Frontiers in Artificial Intelligence and Applications

  • ISBN

    978-1-61499-420-6

  • ISSN

    0922-6389

  • e-ISSN

  • Number of pages

    10

  • Pages from-to

    101-110

  • Publisher name

    IOS Press

  • Place of publication

    Amsterdam

  • Event location

    Praha

  • Event date

    Aug 18, 2014

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article

    000350218400011