Name
Abstract | ||
|---|---|---|
The website fingerprinting attack aims to infer the content of encrypted and anonymized connections by analyzing traffic patterns such as packet sizes, their order, and direction. Although it has been shown that no existing fingerprinting method scales in Tor when applied in realistic settings, the case of Tor hidden (onion) services has not yet been considered in such scenarios. Recent works claim the feasibility of the attack in the context of hidden services using limited datasets.
In this work, we propose a novel two-phase approach for fingerprinting hidden services that does not rely on malicious Tor nodes. In our attack, the adversary merely needs to be on the link between the client and the first anonymization node. In the first phase, we detect a connection to a hidden service. Once a hidden service communication is detected, we determine the visited hidden service (phase two) within the hidden service universe. To estimate the scalability of our and other existing methods, we constructed the most extensive and realistic dataset of existing hidden services. Using this dataset, we show the feasibility of phase one of the attack and establish that phase two does not scale using existing classifiers. We present a comprehensive comparison of the performance and limits of the state-of-the-art website fingerprinting attacks with respect to Tor hidden services.
|
Year | Venue | Field |
|---|---|---|
2017 | WPES@CCS | Web privacy,Internet privacy,Traffic analysis,Public records,Computer security,Computer science,Network packet,Encryption,Adversary,Onion routing,Scalability |
DocType | ISBN | Citations |
Conference | 978-1-4503-5175-1 | 0 |
PageRank | References | Authors |
0.34 | 18 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andriy Panchenko | 1 | 309 | 23.05 |
| Asya Mitseva | 2 | 9 | 3.25 |
| Martin Henze | 3 | 295 | 24.86 |
| Fabian Lanze | 4 | 52 | 4.66 |
| Klaus Wehrle | 5 | 1062 | 105.97 |
| Thomas Engel | 6 | 455 | 42.34 |