Max Ward — accepted AI-conference papers

2024

Practical Anytime Algorithms for Judicious Partitioning of Active Directory Attack Graphs

IJCAI 2024poster

Given a directed graph, a set of source nodes, a target node and a budget, we study the problem of maximizing the number of source nodes disconnected from the target node by removing edges not exceeding the budget. Our model is mainly motivated by a cyber security use case where we need to minimize…

Cited by 0 Source ↗PDF ↗code ↗Scholar ↗

2023

Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs

Mingyu Guo, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen

AAAI 2023technical

Active Directory (AD) is the default security management system for Windows domain networks. An AD environment naturally describes an attack graph where nodes represent computers/accounts/security groups, and edges represent existing accesses/known exploits that allow the attacker to gain access fr…

Cited by 17 Source ↗PDF ↗Scholar ↗