Tools for generating and analyzing attack graphs
From MaRDI portal
Recommendations
Cited in
(17)- Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem
- New insights into approaches to evaluating intention and path for network multistep attacks
- Models and methods for solving the problem of network vulnerability
- A review of attack graph and attack tree visual syntax in cyber security
- Minimum label \(s\)-\(t\) cut has large integrality gaps
- Supervisory control of discrete-event systems under attacks
- Indices of power in optimal IDS default configuration: theory and examples
- Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model
- scientific article; zbMATH DE number 7300343 (Why is no real title available?)
- From attack graph analysis to attack function analysis
- Gradient visualization for general characterization in profiling attacks
- Approximation and hardness results for label cut and related problems
- Solving the minimum labeling global cut problem by mathematical programming
- A short proof and experimental study of the approximation algorithm for label s-t cut
- Consistency checking problems: a gateway to parameterized sample complexity
- A short proof and experimental study of the approximation algorithm for label s-t Cut
- A model of the behavior of network objects in distributed computer systems
This page was built for publication: Tools for generating and analyzing attack graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311297)