Ranking vulnerability fixes using planning graph analysis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


During the past years logical attack graphs were used to find the most critical vulnerabilities and devise efficient hardening strategies for organizational networks. Most techniques for ranking vulnerabilities either do not scale well, eg brute-force attack plan enumeration, or are not well suited for the analysis of logical attack graphs, eg centrality measures.
Original languageEnglish
Title of host publicationIWAISe: First International Workshop on Artificial Intelligence in Security
StatePublished - 2017


Dive into the research topics of 'Ranking vulnerability fixes using planning graph analysis'. Together they form a unique fingerprint.

Cite this