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”

Optimal Network Security Hardening Using Attack Graph Games

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00234341" target="_blank" >RIV/68407700:21230/15:00234341 - isvavai.cz</a>

  • Result on the web

    <a href="http://ijcai.org/papers15/Papers/IJCAI15-080.pdf" target="_blank" >http://ijcai.org/papers15/Papers/IJCAI15-080.pdf</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Optimal Network Security Hardening Using Attack Graph Games

  • Original language description

    Preventing 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 who uses limited resource to harden a network and an attacker who follows a multi-stage plan to attack the network. The possible plans of the attacker are compactly represented using attack graphs, while the defender adds fake targets (honeypots) to the network to deceive the attacker. The compact representation of the attacker?s strategies presents a computational challenge and finding the best response of the attacker is NP-hard. We present a solution method that first translates an attack graph into an MDP and solves it using policy search with a set of pruning techniques. We present an empirical evaluation of the model and solution algorithms, evaluating scalability, the types of solutions that are generated for realistic cases, and sensitivity analysis.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Others

  • Publication year

    2015

  • 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

    International Joint Conference on Artificial Intelligence

  • ISBN

    978-1-57735-738-4

  • ISSN

    1045-0823

  • e-ISSN

  • Number of pages

    7

  • Pages from-to

    526-532

  • Publisher name

    AAAI Press

  • Place of publication

    Menlo Park, California

  • Event location

    Buenos Aires

  • Event date

    Jul 25, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article