Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs

DOI10.1016/j.ejor.2019.04.035zbMath1430.90510OpenAlexW2943011553WikidataQ127974335 ScholiaQ127974335MaRDI QIDQ1999634

MHR (Arman) Khouzani, Pasquale Malacaria, Zhengliang Liu

Publication date: 27 June 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.04.035

zbMATH Keywords

multi-objective optimisationcomputing sciencecyber-securityprobabilistic attack graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29)

Related Items (4)

Multivariate dependence among cyber risks based on \(L\)-hop propagation ⋮ Evolutionary dynamics of the interdependent security games on complex network ⋮ Counterfactual regret minimization for integrated cyber and air defense resource allocation ⋮ Structural models for fog computing based Internet of things architectures with insurance and risk management applications

Uses Software

• RRE

Cites Work

• Unnamed Item
• Unnamed Item
• Infrastructure security games
• Optimal selection of IT security safeguards from an existing knowledge base
• Methods for removing links in a network to minimize the spread of infections
• Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model
• DAG-based attack and defense modeling: don't miss the forest for the attack trees
• A computational approach to determine damage in infrastructure networks from outage reports
• Matching interdiction
• The multi-terminal maximum-flow network-interdiction problem
• Interdiction problems on planar graphs
• The k most vital arcs in the shortest path problem
• A framework for secure IT operations in an uncertain and changing environment
• Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
• Deterministic network interdiction
• The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
• A survey of recent developments in multiobjective optimization
• On the Stackelberg strategy in nonzero-sum games
• Finding the n Most Vital Links in Flow Networks
• Shortest-path network interdiction
• Two-Person Zero-Sum Games for Network Interdiction
• Multicriteria Optimization

This page was built for publication: Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs