The paper introduces the Adaptive Path Removal problem for Active Directory attack graphs, claims #P-hardness, and shows a restricted dynamic programming heuristic outperforms the approximation algorithm on synthetic and real graphs.
However, instead of solving the problem optimally using Dynamic Programming, we employ a model-free reinforcement learning approach to approximate learn the query policy
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Adaptive Wizard for Removing Cross-Tier Misconfigurations in Active Directory
The paper introduces the Adaptive Path Removal problem for Active Directory attack graphs, claims #P-hardness, and shows a restricted dynamic programming heuristic outperforms the approximation algorithm on synthetic and real graphs.