42
CS 589 Information Risk Management 23 January 2007

CS 589 Information Risk Management 23 January 2007

  • View
    215

  • Download
    2

Embed Size (px)

Citation preview

Page 1: CS 589 Information Risk Management 23 January 2007

CS 589Information Risk Management

23 January 2007

Page 2: CS 589 Information Risk Management 23 January 2007

Today’s Discussion

• Start with risk

• Discuss types of information risk

• Start with systematic, modeling-based framework for assessing alternatives when risks are known

• Continue with the hard part – specification of risk when risks are unknown

Page 3: CS 589 Information Risk Management 23 January 2007

Next Week

• Discuss specification of risks using probability distributions

• Discuss incorporation of this information into a decision tree

• Discuss ways to apply these techniques to Information Risk scenarios

Page 4: CS 589 Information Risk Management 23 January 2007

After Next Week

• Discuss the Expected Utility decision criterion

• Discuss Multiple Objectives and Expected Value and Expected Utility

• Discuss Applications in Information Risk Analysis and Management

Page 5: CS 589 Information Risk Management 23 January 2007

References for Today

• Clemen, R. L. and T. Reilly, Making Hard Decisions. Duxbury, 2001.

• Gaffney Jr., J. E., J. W. Ulvila, “Evaluation of Intrusion Detectors: A Decision Theory Approach”, Proceedings of the IEEE Symposium on Security and Privacy. 2001.

Page 6: CS 589 Information Risk Management 23 January 2007

Risk

• ???

• Chance of something bad happening?

• Having something bad happen?

• Anything else?

Page 7: CS 589 Information Risk Management 23 January 2007

Risk

• The probability of an event occurring combined with the consequences of that event

• Just about everything is risky

• How do we actually measure risk?

Page 8: CS 589 Information Risk Management 23 January 2007

Risk vs Uncertainty

• Uncertainty – We don’t know what the key variables are– We don’t know how they relate to alternatives

• Risk– Specify probability distributions– Connect them with alternatives

• One goal: Uncertainty Risk via Modeling

Page 9: CS 589 Information Risk Management 23 January 2007

Thinking About Risk

• Probabilities and Outcomes

• Which is riskier?– Living near a large power generation station– International flight– Driving to Albuquerque

• We have to define factors, events, outcomes, and associated probabilities

Page 10: CS 589 Information Risk Management 23 January 2007

Dealing with Risk

• Define Risk

• Assess Risk

• Define Alternatives for Handling the Risk

• Evaluate Alternatives

• Evaluate your Evaluation Model

• Sensitivity Analysis

• Implementation

Page 11: CS 589 Information Risk Management 23 January 2007

Evaluation

• Choosing among Alternatives

• Should be Evaluated on the same dimension(s)– Expected Value– Expected Utility– Value at Risk (VAR)– Multiple criteria

• Measurement of Alternatives on criteria dimensions is key – and another modeling issue

Page 12: CS 589 Information Risk Management 23 January 2007

Sensitivity Analysis

• Checking on the evaluation of each alternative by varying individual variables

• Find the variable(s) that have the largest impact(s) on the ordering of alternatives

• Goal: robust solutions

Page 13: CS 589 Information Risk Management 23 January 2007

Visual Representation

• Influence Diagrams– Connect factors, events– Help us define risks– Decomposition

• Decision Trees– Ordering of decisions, risky events– Easy to see and present – and solve

Page 14: CS 589 Information Risk Management 23 January 2007

Visual Representations

• Squares denote Decisions

• Circles denote Risks

• Influence Diagrams – arcs connect decision and risk (aka chance) nodes

• Decision Trees – decision and chance nodes are sequentially ordered from left to right

Page 15: CS 589 Information Risk Management 23 January 2007

A Very Simple Example

• Coin Flip Game

• Decisions: Play/No Play

• Risks: Heads/Tails

• Outcomes Must be Specified

Page 16: CS 589 Information Risk Management 23 January 2007

50.0% 0.5

0 0

TRUE Chance

0 0

50.0% 0.5

0 0

Decision

0

FALSE 0

0 0

Coin Flip

Play

No Play

Heads

Tails

Coin Flip Game Decision Tree With $0 Outcomes

Page 17: CS 589 Information Risk Management 23 January 2007

If All Outcomes are $0

• We are Indifferent between Play and No Play based on the Expected Value criterion

• We Prefer Play to No Play if

E(Play) > E(No Play)

• Which means that the sum of the outcomes (if we have a fair coin) must be positive

• Generally, Play if

0 TTHH OOOp

Page 18: CS 589 Information Risk Management 23 January 2007

What if we can play twice?

• Sequential decision – we see the result of the first coin flip, and decide to continue

• This leads to the notion of Strategies – we can make a plan contingent upon resolution of risks that are resolved between decision nodes

• Everything is still based on Expected Value

Page 19: CS 589 Information Risk Management 23 January 2007

50.0% 0.25

0 0

TRUE Chance

0 0

50.0% 0.25

0 0

50.0% Decision

0 0

FALSE 0

0 0

TRUE Chance

0 0

50.0% 0.25

0 0

TRUE Chance

0 0

50.0% 0.25

0 0

50.0% Decision

0 0

FALSE 0

0 0

Decision

0

FALSE 0

0 0

Coin Flip

Play

No Play

Heads

Tails

Play

No Play

Heads

Tails

Play

No Play

Heads

Tails

Page 20: CS 589 Information Risk Management 23 January 2007

Suppose

• O(H) = $10, O(T) = -$7

• p(H) = p(T) = .5 (Fair coin)

• We can easily see that we would choose to Play in the one-game case

• What about the 2-game case?

Page 21: CS 589 Information Risk Management 23 January 2007

p(H) 0.5 50.0% 0.25

O(H) 10 10 20

O(T) -7 TRUE Chance

0 11.5

50.0% 0.25

-7 3

50.0% Decision

10 11.5

FALSE 0

0 10

TRUE Chance

0 3

50.0% 0.25

10 3

TRUE Chance

0 -5.5

50.0% 0.25

-7 -14

50.0% Decision

-7 -5.5

FALSE 0

0 -7

Decision

3

FALSE 0

0 0

Coin Flip

Play

No Play

Heads

Tails

Play

No Play

Heads

Tails

Play

No Play

Heads

Tails

Page 22: CS 589 Information Risk Management 23 January 2007

Strategy

• It’s pretty simple – keep playing

• Would you really do this?

• Do you believe this?

• Why or why not??

Page 23: CS 589 Information Risk Management 23 January 2007

Simple Example

• Suppose we are assessing two alternative intrusion detection systems.

• What’s the problem?

• What are the key risks for this decision?

• What are the decisions?

• What are the outcomes?

• How would we measure the outcomes?

• What is the decision criterion?

Page 24: CS 589 Information Risk Management 23 January 2007

Key Point

• The optimal choice will be the one that is associated with the best expected criterion value – such as expected total cost

• This will be determined by how we define the outcomes – in terms of total costs – and probabilities

• When we roll back a decision tree, we assume that the downstream decision is the best one

Page 25: CS 589 Information Risk Management 23 January 2007

Expected Value

• Random Variable with possible discrete

outcomes

X~

nxxx ,...,, 21

n

iii xxpXE

1

~

Page 26: CS 589 Information Risk Management 23 January 2007

Choose System Intrusion

Detection

Respond?

Payoff

Page 27: CS 589 Information Risk Management 23 January 2007

Example

System 1

System 2

Detection

No Detection

Respond

No Response

Respond

No Response

Page 28: CS 589 Information Risk Management 23 January 2007

Outcome 1

Outcome 2

Outcome 3

Outcome 4

Respond

No Response

Intrusion

No Intrusion

Intrusion

No Intrusion

Page 29: CS 589 Information Risk Management 23 January 2007

Outcome 1

Outcome 2

Outcome 3

Outcome 4

Outcome 5

Outcome 6

Outcome 7

Outcome 8

Outcome 9

Outcome 10

Outcome 11

Outcome 12

Outcome 13

Outcome 14

Outcome 15

Outcome 16

Example

System 1

System 2

Detection

No Detection

Respond

No Response

Respond

No Response

Intrusion

No Intrusion

Intrusion

No Intrusion

Intrusion

No Intrusion

Intrusion

No Intrusion

Detection

No Detection

Respond

No Response

Respond

No Response

Intrusion

No Intrusion

Intrusion

No Intrusion

Intrusion

No Intrusion

Intrusion

No Intrusion

Page 30: CS 589 Information Risk Management 23 January 2007

What do we need to know?

• Probabilities– P(Detection|An Intrusion) P(D|I)– Associated Info– P(I)– And, finally, P(I|D)

• Outcomes– Individually, these will not be stochastic – for now– They will still lead to an expectation for each

decision node

Page 31: CS 589 Information Risk Management 23 January 2007

Conditional Probability

• P(D|I) and P(D| Not I)

• P(Not D|I) and P(Not D|Not I)

• Where would we get this information?

• What about P(I)?

Page 32: CS 589 Information Risk Management 23 January 2007

Bayes Rule – Simple Version

)()|(

)()|()(

)()(|

|

IPIDP

IPIDPDP

DPIPIDP

DIP

Page 33: CS 589 Information Risk Management 23 January 2007

Interpretation

• Two types of Accuracy

• Two types of Error

)|()|(

)|()|(

IDPIDP

IDPIDP

Page 34: CS 589 Information Risk Management 23 January 2007

Solving the Tree

• Establish the Outcomes

• Compute the Probabilities – the conditionals on the endpoints and others

• Find Expected Values and roll back the tree

Page 35: CS 589 Information Risk Management 23 January 2007

P(I) 0.3 0.953177258 0.285

P(D|I) 0.95 0 0

P(D not|I not) 0.98 TRUE Chance

C(No Intrusion) 0 0 -0.468227425

C(Intrusion) 100 0.046822742 0.014

C(False Positive) 10 -10 -10

0.299 Decision

0 -0.468227425 0.953177258 0

-100 -100

FALSE Chance

0 -95.31772575

0.046822742 0

0 0

TRUE Chance 0 -1.64

0.021398003 0

0 0

FALSE Chance

0 -9.786019971

0.978601997 0

-10 -10

0.701 Decision 0 -2.139800285

0.021398003 0.015

-100 -100

TRUE Chance

0 -2.139800285

0.978601997 0.686

0 0

System 1

Detection

No Detection

Respond

No Response

Intrusion

No Intrusion

Respond

No Response

Intrusion

No Intrusion

Intrusion

No Intrusion

Intrusion

No Intrusion

Page 36: CS 589 Information Risk Management 23 January 2007

Sensitivity Analysis

• What are the strategies given the numbers we used in the example?

• What are the key variables?

• How would we assess the base-case outcome of this example?

Page 37: CS 589 Information Risk Management 23 January 2007

Different Conditional Information

• What if we don’t know P(D|I)?

• We can flip the tree according to what we do know

• Outcomes should remain the same

• And the decision should remain the same

Page 38: CS 589 Information Risk Management 23 January 2007

Another Way – Info Dependent

)()|(

)()|()(

)()()|(

)|(

DPDIP

DPDIPIP

IPDPDIP

IDP

Page 39: CS 589 Information Risk Management 23 January 2007

Modeling

• Decisions, chance events

• Probability distributions for chance events– Lack of data Bayesian methods– Expert(s)– Lots of data Distribution model(s)

• Outcomes– Financial, if possible– Multiple measures/criteria/attributes

Page 40: CS 589 Information Risk Management 23 January 2007

Decision Situation

• In the context of Firm or Organization Goals, Objectives, Strategies

• A complete understanding should lead to a 1-2 sentence Problem Definition– Could be risk-centered– Could be oriented toward larger info issues

• Problem Definition should drive the selection of Alternatives and, to some degree, how they are evaluated

Page 41: CS 589 Information Risk Management 23 January 2007

Information Business Issues

• Integrity and reliability of information stored and used in systems

• Preserve privacy and confidentiality

• Enhance availability of other information systems

Page 42: CS 589 Information Risk Management 23 January 2007

Risk Management

• Process of defining and measuring or assessing risk and developing strategies to mitigate or minimize the risk

• Defining and assessing– Data driven– Other sources

• Developing strategies– Done in context of objectives, goals