1
An Analysis of Location-Hiding Using Overlay Networks Ju Wang and Andrew A. Chien Department of Computer Science and Engineering, University of California San Diego Overlay Network for Location- Hiding Summary Communication infrastructure to allow applications to communicate with users without disclosing IP addresses Protect applications from direct attacks Problems Can proxy networks achieve location- hiding? If so, under what circumstances? (feasibility) How long will it take attackers to reveal application location? (metrics) How do properties of defense & proxy networks affect location-hiding? (parametric) – Resource recovery – Proxy network reconfiguration – Correlated host vulnerability Generic Framework for Location- Hiding Resource Pool Application Proxy Network User Attacker Proxy Network Layered View User Edge Proxy Proxy Resource Pool (IP Network) Host Proxy Network Application Attacker Overlay Proxy Network Top View Attack Model Proxies: software components run on hosts Proxies adjacent: iff IP addresses mutually known Proxy Network Topology: adjacency structure Depth: min distance (hops) from edge proxies to app Edge proxies publish their IP addresses Users access applications via edge proxies Goal: reveal application location (IP address) Compromise hosts and reveal (expose) location of adjacent proxies Penetrate proxy network using exposed location information Defense Model Goal: recover compromised hosts, invalidate information attackers have Resource recovery Recover compromised hosts Reactive recovery: detection-triggered – Proactive reset: periodic reload/security patch Proxy network reconfiguration Invalidate information attackers have e.g. proxy migration Compromised Exposed Intact Proxy state transition Hosts w/ similar configurations grouped as domain High correlation inside domain Low correlation across domains e.g. define domain by OS platforms Correlated Vulnerability Compromised Intact Host state transition attack defense Feasibility of Location-Hiding 0 5 10 15 20 10 0 10 5 10 10 10 15 10 20 Proxy N etw ork D epth (d) Tim e to Application Exposure(unit: -1 ) N o R ecovery PerfectR ecovery r =10 0 10 20 30 40 50 0 10 20 30 40 50 60 70 80 90 100 Proxy N etw ork D epth (d) Tim e To Application Exposure (unit: -1 ) PerfectR ecovery, r =0.1 PerfectR ecovery, r =0.5 No reconfiguration Log scale Linear scale 0 5 10 15 20 25 30 35 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Proxy N etw ork D epth P enetration P robability (10 6 tim e steps) N o C orrelation ( dom ains) 2 dom ains 3 dom ains 4 dom ains 8 dom ains r =10 0 s =10 0 v =0.99 0 5 10 15 20 25 30 35 0 50 100 150 200 250 300 350 400 Proxy N etw ork D epth Tim e to A pplication E xposure r =0.10, 0 =0.01, v =0.90 r =0.30, 0 =0.01, v =0.90 This work is supported in part by the National Science Foundation under awards NSF EIA-99-75020 Grads and NSF Cooperative Agreement ANI-0225642 (OptIPuter), NSF CCR-0331645 (VGrADS), NSF NGS-0305390, and NSF Research Infrastructure Grant EIA-0303622. Support from Hewlett-Packard, BigBangwidth, Microsoft, and Intel is also gratefully acknowledged. Application Legitimate User Proxy Network Attacker where ? Stochastic Model Notation Meaning Exam ples* 0 Rate of new vulnerability discovery Bi-weekly v Rate of compromise w/ known bugs ~minute s Rate of proactive resets 0 -relative r True positive ratio of reactive 0.80 d Speed of reactive recovery Real tim e r Rate of proxy migration 10~100x 0 ta shown in examples are inferred from Microsoft Security Bulletin critical vulnerability data, worm propagation speed, Lippmann et al Intrusion detection systems evaluation results, and our prototype proxy network evaluation results. Uncorrelated Vulnerability Theorem I Without proxy network reconfiguration, the expected time to application exposure TdT where T is the expected time to compromise a host, d is proxy network depth. Theorem II Consider a proxy network with random proxy migration rate r ( r 2), the expected time to application exposure T grows exponentially with the proxy network depth d; specifically T. T d r ) ) (( 2 2 T d r ) ) (( 1 Location-Hiding Infeasible w/o Sufficient Reconfiguration Location-Hiding Feasible with Sufficient Reconfiguration Parametric Study 0 10 20 30 40 50 60 70 80 90 100 10 0 10 5 10 10 10 15 10 20 Proxy M igration R ate r (U nit: ) Tim e to Application Exposure (unit: -1 ) PerfectR ecovery N o R ecovery proxy netw ork depth d = 10 migration has qualitative impact • migration rate + proxy network depth exponential improvement • resource recovery limited impact Correlated Vulnerability Correlated host vulnerabilities can make location-hiding infeasible All hosts share similar vulnerabilities (single domain). Even with high migration rates, can’t achieve location-hiding. v the dominant attack rate, is much here than migration rate. Exploiting limited host diversity & intelligent proxy placement achieves location- hiding Interleave proxies on different domains • Proxies migrate inside domain • Design of a generic framework and analytic model for proxy network approaches to location-hiding • Using analytic modeling and simulation techniques, we characterize key properties of proxy network and find - Existing approaches employing static structure are vulnerable to host compromise attacks - Adding proactive defenses employing proxy network reconfiguration and migration makes location-hiding feasible, proxy network depth & reconfiguration rates are critical factors - Correlated host vulnerability can make location-hiding infeasible - By exploiting limited host diversity and intelligent construction of proxy network, negative impact of correlation can be mitigated and location-hiding can be achieved Work in Progress • Impact of overlay topology in location-hiding (SSRS’03) -Using a similar model, we characterize favorable and unfavorable topologies for location-hiding from a graph theoretic perspective -Found high connectivity, a merit in other context, may undermine location-hiding -Popular overlays, e.g. Chord, are unfavorable for location-hiding; low-dimensional CAN and binary de Bruijn graphs are favorable. • Proxy Network DoS Resilience (empirical study) -Simulation testbed: large scale Internet simulator (MicroGrid) -Proxy network working prototype -Real DDoS attack tool (Trinoo) and real application (Apache) -Study impact of attack and effectiveness of proxy network (impact of proxy deployment as well)

An Analysis of Location-Hiding Using Overlay Networks Ju Wang and Andrew A. Chien Department of Computer Science and Engineering, University of California

Embed Size (px)

Citation preview

Page 1: An Analysis of Location-Hiding Using Overlay Networks Ju Wang and Andrew A. Chien Department of Computer Science and Engineering, University of California

An Analysis of Location-Hiding Using Overlay NetworksJu Wang and Andrew A. Chien

Department of Computer Science and Engineering, University of California San Diego

Overlay Network for Location-Hiding

Summary

• Communication infrastructure to allow applications to communicate with users without disclosing IP addresses

• Protect applications from direct attacks

Problems• Can proxy networks achieve location-hiding? If

so, under what circumstances? (feasibility)• How long will it take attackers to reveal

application location? (metrics)• How do properties of defense & proxy networks

affect location-hiding? (parametric)– Resource recovery– Proxy network reconfiguration– Correlated host vulnerability

Generic Framework for Location-Hiding

Resource Pool

ApplicationProxy Network

User

Attacker

Proxy Network Layered View

User Edge Proxy Proxy

Resource Pool

(IP Network)

Host

Proxy Network

Application

Attacker

Overlay

Proxy Network Top View

Attack Model

• Proxies: software components run on hosts

• Proxies adjacent: iff IP addresses mutually known

• Proxy Network Topology: adjacency structure

• Depth: min distance (hops) from edge proxies to app

• Edge proxies publish their IP addresses

• Users access applications via edge proxies

• Goal: reveal application location (IP address)

• Compromise hosts and reveal (expose) location of adjacent proxies

• Penetrate proxy network using exposed location information

Defense Model• Goal: recover compromised hosts, invalidate

information attackers have• Resource recovery

– Recover compromised hosts– Reactive recovery: detection-triggered– Proactive reset: periodic reload/security patch

• Proxy network reconfiguration– Invalidate information attackers have– e.g. proxy migration

CompromisedExposed

Intact

Proxy state transition

• Hosts w/ similar configurations grouped as domain– High correlation inside domain

– Low correlation across domains

• e.g. define domain by OS platforms

Correlated Vulnerability

CompromisedIntact

Host state transition

attackdefense

Feasibility of Location-Hiding

0 5 10 15 2010

0

105

1010

1015

1020

Proxy Network Depth (d)

Tim

e to

App

licat

ion

Exp

osur

e(un

it:

-1)

No RecoveryPerfect Recovery

r=10

0 10 20 30 40 500

10

20

30

40

50

60

70

80

90

100

Proxy Network Depth (d)

Tim

e T

o A

pplic

atio

n E

xpos

ure

(uni

t:

-1)

Perfect Recovery, r=0.1

Perfect Recovery, r=0.5

No reconfiguration

Log scaleLinear scale

0 5 10 15 20 25 30 350

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1

Proxy Network Depth

Pen

etr

atio

n P

rob

ab

ility

(1

06 tim

e s

tep

s)

No Correlation ( domains)2 domains3 domains4 domains8 domains

r=10

0

s=10

0

v=0.99

0 5 10 15 20 25 30 350

50

100

150

200

250

300

350

400

Proxy Network Depth

Tim

e t

o A

pp

licatio

n E

xposu

re

r=0.10,

0=0.01,

v=0.90

r=0.30,

0=0.01,

v=0.90

This work is supported in part by the National Science Foundation under awards NSF EIA-99-75020 Grads and NSF Cooperative Agreement ANI-0225642 (OptIPuter), NSF CCR-0331645 (VGrADS), NSF NGS-0305390, and NSF Research Infrastructure Grant EIA-0303622. Support from Hewlett-Packard, BigBangwidth, Microsoft, and Intel is also gratefully acknowledged.

Application Legitimate User

Proxy Network Attacker

where?

Stochastic Model

Notation Meaning Examples*

0 Rate of new vulnerability discovery Bi-weekly

v Rate of compromise w/ known bugs ~minute

s Rate of proactive resets

0-relativer True positive ratio of reactive

recovery

0.80

d Speed of reactive recovery Real time

r Rate of proxy migration 10~100x0

* Data shown in examples are inferred from Microsoft Security Bulletin critical vulnerability data, worm propagation speed,Lippmann et al Intrusion detection systems evaluation results, and our prototype proxy network evaluation results.

Uncorrelated Vulnerability

Theorem I Without proxy network reconfiguration, the expected time to application exposure TdT where T is the expected time to compromise a host, d is proxy network depth.

Theorem II Consider a proxy network with random proxy migration rate r (r2), the expected time to application exposure T grows exponentially with the proxy network depth d; specifically T.

Theorem I Without proxy network reconfiguration, the expected time to application exposure TdT where T is the expected time to compromise a host, d is proxy network depth.

Theorem II Consider a proxy network with random proxy migration rate r (r2), the expected time to application exposure T grows exponentially with the proxy network depth d; specifically T.

Tdr ))(( 22

Tdr ))(( 1

Location-Hiding Infeasible w/oSufficient Reconfiguration

Location-Hiding Feasible withSufficient Reconfiguration

Parametric Study

0 10 20 30 40 50 60 70 80 90 10010

0

105

1010

1015

1020

Proxy Migration Rate r (Unit: )

Tim

e to

App

licat

ion

Exp

osur

e (u

nit:

-1

)

Perfect RecoveryNo Recovery

proxy network depth d = 10

• migration has qualitative impact

• migration rate + proxy network depth exponential improvement

• resource recovery limited impact

Correlated Vulnerability

Correlated host vulnerabilities can make location-hiding infeasible

All hosts share similar vulnerabilities (single domain).Even with high migration rates, can’t achieve location-hiding.v the dominant attack rate, is much here than migration rate.

Exploiting limited host diversity & intelligent proxy placement achieves location-hiding

• Interleave proxies on different domains

• Proxies migrate inside domain

• Design of a generic framework and analytic model for proxy network approaches to location-hiding

• Using analytic modeling and simulation techniques, we characterize key properties of proxy network and find

- Existing approaches employing static structure are vulnerable to host compromise attacks

- Adding proactive defenses employing proxy network reconfiguration and migration makes location-hiding feasible, proxy network depth & reconfiguration rates are critical factors

- Correlated host vulnerability can make location-hiding infeasible

- By exploiting limited host diversity and intelligent constructionof proxy network, negative impact of correlation can be mitigatedand location-hiding can be achieved

Work in Progress

• Impact of overlay topology in location-hiding (SSRS’03)

-Using a similar model, we characterize favorable and unfavorable topologies for location-hiding from a graph theoretic perspective

-Found high connectivity, a merit in other context, may underminelocation-hiding

-Popular overlays, e.g. Chord, are unfavorable for location-hiding;low-dimensional CAN and binary de Bruijn graphs are favorable.

• Proxy Network DoS Resilience (empirical study)

-Simulation testbed: large scale Internet simulator (MicroGrid)

-Proxy network working prototype

-Real DDoS attack tool (Trinoo) and real application (Apache)

-Study impact of attack and effectiveness of proxy network (impact of proxy deployment as well)