Attack Tree Analysis and Probability Calculation
What you'll learn: How to systematically break down complex attack scenarios into logical trees and calculate the probability of successful exploitation for quantitative risk assessment.
What Are Attack Trees?
Attack trees are hierarchical diagrams that model how an attacker might achieve a specific goal. The root node represents the attacker's ultimate objective (e.g., "Steal customer database"), while child nodes represent the sub-goals or steps needed to accomplish it. Each branch represents an alternative attack path.
Think of an attack tree like a chess game plan: the top is "Checkmate," and below are all the different move sequences that could achieve it. Unlike chess, we can assign probabilities to each move succeeding.
Building the Tree
Start with the attacker's goal at the top. Break it down using AND gates (all child conditions must succeed) or OR gates (any one child condition suffices). For example:
Steal Database (Root)
├─ OR ─┐
├─ Exploit Web Vulnerability (P=0.15)
├─ Phish Database Admin (P=0.30)
└─ Physical Access + Theft (P=0.05)
Calculating Path Probabilities
For OR gates, calculate the probability that at least one path succeeds:
- Combined probability = 1 - (1-P₁)(1-P₂)(1-P₃)...
For AND gates, multiply probabilities (all must succeed):
- Combined probability = P₁ × P₂ × P₃...
In the example above, the overall attack success probability is approximately 1 - (0.85)(0.70)(0.95) ≈ 0.44 or 44%.
These probability-weighted paths feed directly into your quantitative risk calculations (like ALE) by providing realistic likelihood estimates based on attack feasibility rather than abstract risk scores.
Key Takeaway: Attack trees decompose complex threats into analyzable paths with calculable probabilities, transforming subjective threat assessments into quantitative risk metrics that support data-driven security investment decisions.