Skip to main navigation Skip to search Skip to main content

Practical Anytime Algorithms for Judicious Partitioning of Active Directory Attack Graphs

  • Yumeng Zhang
  • , Max Ward
  • , Hung Nguyen

Research output: Chapter in Book/Conference paper › Conference paper › peer-review

Abstract

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 the attack surface of a Windows Active Directory system. In these high-profile attacks, the attackers first compromise a source (i.e., a compromised user node) and then laterally move to a destination (i.e., a high-privileged admin node). Our aim is to minimize the number of users with a path to the admin. We first prove that the problem is NP-hard. Algorithms for exact optimality usually struggle to converge on graphs that approach real-world network scales and therefore are not practical for usage. In light of this, we study anytime algorithms that return an acceptable result whenever the algorithm is terminated, and can improve optimality by allowing longer computational time. We observe the source connectivity of directed graphs, based on which we propose a novel anytime algorithm-the spiral algorithm. We also develop two Monte Carlo Tree Search (MCTS) algorithms as a baseline to study the performance of typical anytime algorithms for our problem, and show that the spiral algorithm improves the optimality at a significantly faster speed and therefore exhibits better anytime behavior compared with MCTS.

Original languageEnglish
Title of host publicationProceedings of the 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024
EditorsKate Larson
PublisherInternational Joint Conferences on Artificial Intelligence
Pages7074-7081
Number of pages8
ISBN (Electronic)9781956792041
Publication statusPublished - 2024
Event33rd International Joint Conference on Artificial Intelligence - Jeju, Korea, Republic of
Duration: 3 Aug 2024 → 9 Aug 2024

Publication series

NameIJCAI International Joint Conference on Artificial Intelligence
ISSN (Print)1045-0823

Conference

Conference33rd International Joint Conference on Artificial Intelligence
Abbreviated titleIJCAI 2024
Country/TerritoryKorea, Republic of
CityJeju
Period3/08/24 → 9/08/24

Fingerprint

Dive into the research topics of 'Practical Anytime Algorithms for Judicious Partitioning of Active Directory Attack Graphs'. Together they form a unique fingerprint.

Cite this