• Aucun résultat trouvé

Trawling for Tor Hidden Services: Detection, Measurement, Deanonymization

N/A
N/A
Protected

Academic year: 2021

Partager "Trawling for Tor Hidden Services: Detection, Measurement, Deanonymization"

Copied!
55
0
0

Texte intégral

(1)

Trawling for Tor Hidden Services: Detection, Measurement, Deanonymization

A. Biryukov, I. Pustogarov, R.P. Weinmann University of Luxembourg

[email protected]

(2)

Overview

● Background

● Measuring the popularity of hidden services ● DoSing hidden services.

● Harvesting onion addresses. ● Revealing the guards.

(3)

3

Overview

Background

● Measuring the popularity of hidden services

● DoSing hidden services.

● Harvesting onion addresses.

● Revealing the guards.

(4)

Tor anonymity network

R1

R2 Alice

(5)

5

Server Anonymity

Tor anonymity network

(6)

Server Anonymity

Tor anonymity network

(7)

7

Consensus

(8)

Guards

R1

R2 R3

Alice

(9)

9 Guards R1 R2 R3 Alice Bob

(10)
(11)

11

(12)
(13)

13

(14)
(15)

15

(16)

Tor rendezvous protocol HSDir Storage IP3 IP2 IP1

Step1: Bob picks some introduction points and builds circuits to them.

(17)

18

Tor rendezvous protocol

IP3 IP2 IP1

(18)

Tor rendezvous protocol

IP3 IP2 IP1

Step3: Alice requests introduction points from the database.

She also sets up a rendezvous point.

Alice RP

(19)

20

Tor rendezvous protocol

IP3 IP2 IP1

Step4: Alice sends a message to Bob listing the rendezvous point and asks the introduction points from to deliver it.

(20)

Tor rendezvous protocol

IP3 IP2 IP1

Step5: Alice and Bob

Connect at the Rendezvous point

Alice RP

(21)

22

Tor rendezvous protocol

(22)

Responsible hidden service directories

HSDir Storage

= HSDir = 25 hours of uptime

(23)

24

Responsible hidden service directories

HSDir Storage

= HSDir = 25 hours of uptime

Bob IDs+

(0|1) )

+ + +

(24)

Responsible hidden service directories

HSDir Storage

= HSDir = 25 hours of uptime

(25)

27

Overview

● Background

Measuring the popularity of hidden services DoSing hidden services.

● Harvesting onion addresses.

● Revealing the guards.

(26)

Impersonating Hidden service directory

= HSDir = 25 hours of uptime

Bob IDs+

(27)

29

Impersonating Hidden service directory

= HSDir = 25 hours of uptime

Bob IDs+

(28)

Impersonating Hidden service directory

= HSDir = 25 hours of uptime

Bob IDs+

(29)

32

Impersonating Hidden service directory

● By impersonating 1 directory, we can track the popularity ● By impersonating all 6 directories, we can DoS.

1 second

(30)

Tracking popularity

● We tracked popularity of Skynet C&C,

(31)

34

Overview

● Background

● Measuring the popularity of hidden services

● DoSing hidden services.

Harvesting onion addresses.

● Revealing the guards.

(32)

Shadowing

Authorities

Consensus

(33)
(34)

Shadowing

Authorities

Consensus

(35)
(36)

Collecting onion addresses - Active

(37)

40

Collecting onion addresses

● Naive approach will require

~350 IP addresses.

(38)

Collecting onion addresses

● Naive approach will require

~350 IP addresses.

● Descriptors don't relocate

within 24 hours.

● Prepare shadow HSDir

relays and gradually pull to consensus.

(39)

42

Collecting onion addresses

● Naive approach will require

~350 IP addresses.

● Descriptors don't relocate

within 24 hours.

● Prepare shadow HSDir

relays and gradually pull to consensus.

- Active - Shadow

(40)

Collecting onion addresses

● Naive approach will require

~350 IP addresses.

● Descriptors don't relocate

within 24 hours.

● Prepare shadow HSDir

relays and gradually pull to consensus.

(41)

44

Collecting onion addresses

● Naive approach will require

~350 IP addresses.

● Descriptors don't relocate

within 24 hours.

● Prepare shadow HSDir

relays and gradually pull to consensus.

- Active - Shadow

(42)

Harvest results

● We used 58 IP addresses from Amazon EC2

and spent 57 USD

● We collected 39824 unique onion addresses

in 49 hours (on hidden wikis one can find ~2500 addresses only)

● Some interesting note: 12 onion addresses in

(43)

47

Overview

● Background

● Measuring the popularity of hidden services

● DoSing hidden services.

● Harvesting onion addresses.

Revealing the guards.

(44)

Revealing Guard Nodes

Bob

(45)

50

Revealing Guard Nodes

Bob

(46)
(47)

52

Revealing Guard Nodes

(48)
(49)

54

Opportunistic deanonymisation

Bob

(50)

Opportunistic deanonymisation

Bob

Eve RP Guard

(51)

56

Opportunistic deanonymisation

● Rent a server for 60 USD per month => 0.6%

probability to be chosen as a Guard.

Deanonymisation ~150 hidden services per

month (for 60 USD per month)

● By running 23 such servers, the probability to

deanonymize any long-running hidden

service within 8 months is 99%. (~11 000

(52)

Side effect (flag assignment)

● Large number of shadow relays with bw <= 1 accelerated flag

assignment.

Running Fast

(53)

58

Conclusions

Tracking

Denial of Service

Collecting onion addresses Revealing Guard Nodes

Deanonymisation ● 150 addresses per month (60

USD)

●Any HS (8 months+11000

(54)

Support slide 1

● Triggered

– #8243: Getting the HSDir flag should require more

effort

– #8243: Getting the HSDir flag should require more

effort ● Related

– Changing of the Guards: A Framework for

(55)

60

Support slide 2

● Not included into the presentation

– Finding guard nodes using topological properties

Références

Documents relatifs

ne peroxidase in protecùng mammalian spermatozoa from Joss of moulity caused by spont�ne�us l ipid peroxidaùon. Reacùve oxygen species and human spermatozoa 1. Effects

While expanding a search radius by 7.9 times (producing an average search area of nearly 12000 km 2 and still only successfully retrieving an average of 40% of objects) is

In this paper, we use the reduced complexity algorithm proposed in [8] to optimize the achievable throughput for a given GI length and compare the achieved throughput for different

2.7.I Perception de la lumière rouge : les phytochromes 2.7.2 Rôles biologiques des phytochromes. 2.7.3 Perception de la lumière bleue : cryptochrbmes et

Pour les parents désirants un retour complet sur la journée de leur enfant à l’UAPE, l’équipe éducative demande de venir avant la fermeture de l’institution

Écrivez une fonction Caml schedule_Hu: graph −&gt; int −&gt; unit qui prend en pa- ramètres un graphe G de tâches étiquetées par l’algorithme 3 et un nombre p de processeurs et

She has published extensively on the European common agricultural policy, on food security policies in African countries, on the role of international organizations in global

Alors le Bon Dieu les a chassés du paradis Mais pourquoi y avait-il ce fruit interdit Après tout à qui la faute_?. Oui c'est bien la faute à Eve Lui Adam n'a