No Free Lunch in Cyber Security
George Cybenko
gvc@dartmouth.edu
Jeff Hughes
jeff.hughes@tenet3.com MTD Workshop Scottsdale AZ November 3, 2014
No Free Lunch in Cyber Security George Cybenko gvc@dartmouth.edu - - PowerPoint PPT Presentation
No Free Lunch in Cyber Security George Cybenko gvc@dartmouth.edu Jeff Hughes jeff.hughes@tenet3.com MTD Workshop Scottsdale AZ November 3, 2014 Acknowledgements Kate Farris, Ph.D. Student, Dartmouth Dr. Gabriel Stocco*, Microsoft
gvc@dartmouth.edu
jeff.hughes@tenet3.com MTD Workshop Scottsdale AZ November 3, 2014
2
4
Adaptive Defense OODA Loop
Integrated Analysis and Decision Making Control Theoretic Modeling and Analysis Game Theoretic Modeling and Analysis Adversarial Modeling
Networked Information System and Environment
Observations and Measurements Adversary Types and Objectives External Intelligence Attack Strategy Seeds Optimized Defensive Actions Adaptation Mechanisms Optimized Adaptations Tradeoff and Stability Models
Adversarial and Uncertainty Reasoning for Adaptive Cyber Defense
Thrust 1 Thrust 2 Thrust 3 Thrust 4 Thrust 1 Lead: Cybenko Thrust 2 Lead: Wellman Thrust 3 Lead: Jajodia Thrust 4 Lead: Liu
Adversarial and Uncertainty Reasoning for Adaptive Cyber Defense
7
Cybenko & Wellman, 2009 DARPA ISAT Study
8
9
At least 39 documented in this 2013 MIT Lincoln Labs Report >50 today? How can we compare them?
10
Analytics (Math or Data) Testbed Network Simulations Red Teaming Expert Surveys or Elicitations Operational Network Effectiveness
✔ M
Costs
✔ M + D
✕
Performance Costs
✕ ✔
Usability
✕ ✕ ✕ ✕
Security Priority
✔ D ✕ ✕ ✔ ✔ ✕
M – Math based D – Data based Sometimes Bad Good
11
approach to quantifying an MTD approach
estimate metrics through simulation
network and instrumented to estimate metrics during actual runs
network to find and exploit vulnerabilities
descriptions, not simulations or testbeds
12
13
Analytics (Math or Data) Testbed Network Simulations Red Teaming Expert Surveys or Elicitations Operational Network Effectiveness
✔ M
Costs
✔ M + D
✕
Performance Costs
✕ ✔
Usability
✕ ✕ ✕ ✕
Security Priority
✔ D ✕ ✕ ✔ ✔ ✕
M – Math based D – Data based Sometimes Bad Good
competitive exclusion principle. American Naturalist, 104:413–423, 1970.
14
15
16
17
18
Harder
See “QuERIES”, Carin, Cybenko and Hughes, IEEE Computer, August 2008. Cybenko, Hughes http://timreview.ca/arti cle/712, 2013.
α β Time Median m Time to defeat confidentiality by n attackers approaches α Time to defeat availability by n attackers approaches β Time to defeat integrity by n attackers approaches m As the number of replicated Artificial Diversity components or services increases, the time to defeat the different CIA goals fills out the support of f(t) See workshop paper, “No Free Lunch in Cyber Security”
21
22
23
24