A Heuristic Approach to Minimum-Cost Network Hardening Using Attack Graph

Abstract

Network hardening answers the following critical question in defending against multi-step intrusions: Which vulnerabilities must be removed in order to prevent any attacker from reaching the given goal conditions. Existing approaches usually derive a logic proposition to represent the negation of the goal conditions in terms of initially satisfied… (More)
DOI: 10.1109/NTMS.2008.ECP.9

Topics

4 Figures and Tables

Slides referencing similar topics