towards efficient traffic-analysis resistant anonymity networks

21
Towards efficient traffic-analysis resistant anonymity networks Stevens Le Blond David Choffnes Wenxuan Zhou Peter Druschel Hitesh

Upload: rio

Post on 23-Feb-2016

48 views

Category:

Documents


0 download

DESCRIPTION

Towards efficient traffic-analysis resistant anonymity networks. Stevens Le Blond David Choffnes Wenxuan Zhou Peter Druschel Hitesh Ballani Paul Francis . Snowden wants to communicate with Greenwald without Alexander to find out. Ed’s IP. Glenn’s IP. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Towards efficient traffic-analysis resistant anonymity networks

Towards efficient traffic-analysis resistant anonymity networks

Stevens Le Blond David Choffnes Wenxuan ZhouPeter Druschel Hitesh Ballani Paul Francis

Page 2: Towards efficient traffic-analysis resistant anonymity networks

2

Snowden wants to communicate with Greenwald without Alexander to find out

Ed’s IP Glenn’s IP

Page 3: Towards efficient traffic-analysis resistant anonymity networks

3

The problem of IP anonymity

Client ServerVPN proxy

Proxies are single point of attack(rogue admin, break in, legal, etc)

Page 4: Towards efficient traffic-analysis resistant anonymity networks

4

Proxy

Traffic analysisOnion routing (Tor)

Onion routing doesn’t resisttraffic analysis (well known)

Page 5: Towards efficient traffic-analysis resistant anonymity networks

5

Outline

1) Overview2) Design3) Evaluation4) Ongoing work

Page 6: Towards efficient traffic-analysis resistant anonymity networks

6

Anonymous Quanta (Aqua)

• k-anonymity: Indistinguishable among k clients

• BitTorrent– Appropriate latency and bandwidth– Many concurrent and correlated flows

Page 7: Towards efficient traffic-analysis resistant anonymity networks

7

Threat model

• Global passive (traffic analysis) attack• Active attack• Edge mixes aren’t compromised

Page 8: Towards efficient traffic-analysis resistant anonymity networks

8

Padding

Constant rate (strawman)

Defeats traffic analysis, but overhead proportionalto peak link payload rate on fully connected network

Page 9: Towards efficient traffic-analysis resistant anonymity networks

9

Outline

1) Overview2) Design– Padding at the core– Padding at the edges– Bitwise unlinkability– Receiver’s anonymity (active attacks)

3) Evaluation4) Ongoing work

Page 10: Towards efficient traffic-analysis resistant anonymity networks

10

Multipath

Multipath reduces thepeak link payload rate

Padding

Page 11: Towards efficient traffic-analysis resistant anonymity networks

11

Variable uniform rate

Reduces overhead by adapting tochanges in aggregate payload traffic

Page 12: Towards efficient traffic-analysis resistant anonymity networks

12

Outline

1) Overview2) Design– Padding at the core– Padding at the edges– Bitwise unlinkability– Receiver’s anonymity (active attacks)

3) Evaluation4) Ongoing work

Page 13: Towards efficient traffic-analysis resistant anonymity networks

13

k-anonymity sets (ksets)

Send ksetRecv kset

Provide k-anonymity by ensuring correlatedrate changes on at least k client links

Padding

Page 14: Towards efficient traffic-analysis resistant anonymity networks

14

Forming efficient ksets

Epochs1 2 3

Peer

s’ ra

tes

1

2

3

Are there temporal and spatialcorrelations among BitTorrent flows?

Page 15: Towards efficient traffic-analysis resistant anonymity networks

15

Outline

1) Overview2) Design– Padding at the core– Padding at the edges– Bitwise unlinkability– Receiver’s anonymity (active attacks)

3) Evaluation4) Ongoing work

Page 16: Towards efficient traffic-analysis resistant anonymity networks

16

Methodology: Trace driven simulations

• Month-long BitTorrent trace with 100,000 users– 20 million flow samples per day– 200 million traceroute measurements

• Models of anonymity systems– Constant-rate: Onion routing v2– Broadcast: P5, DC-Nets– P2P: Tarzan– Aqua

Page 17: Towards efficient traffic-analysis resistant anonymity networks

17

Overhead @ edges

Models

Ove

rhea

d

Much better bandwidth efficiency

Page 18: Towards efficient traffic-analysis resistant anonymity networks

18

Throttling @ edges

Models

Thro

ttlin

g

Efficiently leveragescorrelations in BitTorrent flows

Page 19: Towards efficient traffic-analysis resistant anonymity networks

19

Outline

1) Overview2) Design2) Evaluation3) Ongoing work

Page 20: Towards efficient traffic-analysis resistant anonymity networks

20

Ongoing work

• Prototype implementation

• Aqua for VoIP traffic– “tiny-latency” (RTT <330ms)

• Intersection attacks

• Workload independence

Page 21: Towards efficient traffic-analysis resistant anonymity networks

21

Take home messages• Efficient traffic-analysis resistance by exploiting existing

correlations in BitTorrent traffic

• At core:– Multipath reduces peak payload rate– Variable uniform rate adapts to changes in aggregate payload

traffic

• At edges, ksets: – Provide k-anonymity by sync rate on k client links– Leverage temporal and spatial correlations of BitTorrent flows