Research map / Graph learning / Graph algorithms and clustering
Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use kernelization-based IP instead of Greedy | Pure strategy edge blocking · R2000, budget=5 | attacker success rate: 0.521 -> 0.480 | Helped |
| Use kernelization-based IP instead of Greedy | Pure strategy edge blocking · R4000, budget=5 | attacker success rate: 0.376 -> 0.373 | Helped |
| Use kernelization-based IP instead of Greedy | Pure strategy edge blocking · ADS10, budget=5 | attacker success rate: 0.448 -> 0.409 | Helped |
| Use kernelization-based IP instead of Greedy | Pure strategy edge blocking · R2000, budget=10 | attacker success rate: 0.499 -> 0.263 | Helped |
| Use kernelization-based IP instead of Greedy | Pure strategy edge blocking · R4000, budget=10 | attacker success rate: 0.376 -> 0.117 | Helped |
| Use kernelization-based IP instead of Greedy | Pure strategy edge blocking · ADS10, budget=10 | attacker success rate: 0.448 -> 0.315 | Helped |
| Use iterative LP mixed-strategy blocking instead of pure-strategy IP | Edge blocking · R4000, budget=10 | attacker success rate: 0.117 -> 0.033 | Helped |
| Use iterative LP mixed-strategy blocking instead of pure-strategy IP | Edge blocking · ADS10, budget=10 | attacker success rate: 0.315 -> 0.190 | Helped |
| Use iterative LP mixed-strategy blocking instead of pure-strategy IP | Edge blocking · R2000, budget=10 | attacker success rate: 0.263 -> 0.266 | Mixed |
| Use MIP-F approximation for mixed-strategy blocking | Mixed strategy edge blocking · R2000, budget=10 | attacker success rate: 0.263 -> 0.270 | Hurt |
| Use MIP-F approximation for mixed-strategy blocking | Mixed strategy edge blocking · ADS10, budget=5 | attacker success rate: 0.297 -> 0.303 | Hurt |
| Use PPO to search TDCycle decisions | TDCycle · R2000, budget=5 | attacker success rate: 0.521 -> 0.480 | Helped |
Closest papers by meaning
- Limited Query Graph Connectivity Test (AAAI 2024 · similarity 0.83)
- Robustness Inspired Graph Backdoor Defense (ICLR 2025 · similarity 0.82)
- Practicable Black-Box Evasion Attacks on Link Prediction in Dynamic Graphs—a Graph Sequential Embedding Method (AAAI 2025 · similarity 0.81)
- Highly Imperceptible Black-Box Graph Injection Attacks with Reinforcement Learning (AAAI 2025 · similarity 0.80)
- When Agents Go Rogue: Activation-Based Detection of Malicious Behaviors in Multi-Agent Systems (ICML 2026 · similarity 0.80)
- Attack by Yourself: Effective and Unnoticeable Multi-Category Graph Backdoor Attacks with Subgraph Triggers Pool (NeurIPS 2025 · similarity 0.80)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.