CoChat
Cited by 501

The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.

Website fingerprinting in onion routing based anonymization networks

Panchenko, Andriy, Niessen, Lukas, Zinnen, Andreas, Engel, Thomas · 2011 · Proceedings of the 10th annual ACM workshop on Privacy in the electronic society

Abstract

Low-latency anonymization networks such as Tor and JAP claim to hide the recipient and the content of communications from a local observer, i.e., an entity that can eavesdrop the traffic between the user and the first anonymization node. Especially users in totalitarian regimes strongly depend on such networks to freely communicate. For these people, anonymity is particularly important and an analysis of the anonymization methods against various attacks is necessary to ensure adequate protection. In this paper we show that anonymity in Tor and JAP is not as strong as expected so far and cannot resist website fingerprinting attacks under certain circumstances. We first define features for website fingerprinting solely based on volume, time, and direction of the traffic. As a result, the subsequent classification becomes much easier. We apply support vector machines with the introduced features. We are able to improve recognition results of existing works on a given state-of-the-art dataset in Tor from 3% to 55% and in JAP from 20% to 80%. The datasets assume a closed-world with 775 websites only. In a next step, we transfer our findings to a more complex and realistic open-world scenario, i.e., recognition of several websites in a set of thousands of random unknown websites. To the best of our knowledge, this work is the first successful attack in the open-world scenario. We achieve a surprisingly high true positive rate of up to 73% for a false positive rate of 0.05%. Finally, we show preliminary results of a proof-of-concept implementation that applies camouflage as a countermeasure to hamper the fingerprinting attack. For JAP, the detection rate decreases from 80% to 4% and for Tor it drops from 55% to about 3%.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2046556.2046570

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 6

  1. 10.5555/345662 · doi:10.5555/345662
  2. 10.1007/11423409_3 · doi:10.1007/11423409_3
  3. 10.5555/1251375.1251396 · doi:10.5555/1251375.1251396
  4. 10.5555/2074158.2074196 · doi:10.5555/2074158.2074196
  5. C. J. van Rijsbergen . Information Retrieval. Butterworths , 2 nd edition, 1979 . C. J. van Rijsbergen. Information Retrieval. Butterworths, 2nd edition, 1979.
  6. V. Vapnik and A. Chervonenkis . Theory of Pattern Recognition {in Russian}. Nauka , 1974 . (German Translation: Vapnik, Vladimir and Chervonenkis, Alexey : Theorie der Zeichenerkennung, Akademie-Verlag , 1979). V. Vapnik and A. Chervonenkis. Theory of Pattern Recognition {in Russian}. Nauka, 1974. (German Translation: Vapnik, Vladimir and Chervonenkis, Alexey: Theorie der Zeichenerkennung, Akademie-Verlag, 1979).

Cited by

See all 501

Metadata

Authors
Panchenko, A., Niessen, L., Zinnen, A., & Engel, T.
Venue
Proceedings of the 10th annual ACM workshop on Privacy in the electronic society
Publisher
ACM
Published
2011-10-17
Pages
103-114
OpenAlex
W2135579486
Cited by
501
References
21
FWCI
14.82
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.