גיא שני

אקדמי בכיר

Ranking vulnerability fixes using planning graph analysis

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.
שפת פרסום אנגלית
כרך 41
סטטוס פרסום פורסם - 2017