The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Low-Cost Traffic Analysis of Tor
Abstract
Tor is the second generation onion router supporting the anonymous transport of TCP streams over the Internet. Its low latency makes it very suitable for common tasks, such as Web browsing, but insecure against traffic-analysis attacks by a global passive adversary. We present new traffic-analysis techniques that allow adversaries with only a partial view of the network to infer which nodes are being used to relay the anonymous streams and therefore greatly reduce the anonymity provided by Tor. Furthermore, we show that otherwise unrelated streams can be linked back to the same initiator Our attack is feasible for the adversary anticipated by the Tor designers. Our theoretical attacks are backed up by experiments performed on the deployed, albeit experimental, Tor network. Our techniques should also be applicable to any low latency anonymous network. These attacks highlight the relationship between the field of traffic-analysis and more traditional computer security issues, such as covert channel analysis. Our research also highlights that the inability to directly observe network links does not prevent an attacker from performing traffic-analysis: the adversary can use the anonymising network as an oracle to infer the traffic load on remote nodes in order to perform traffic-analysis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Tor: The Second-Generation Onion Router
Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104
Cited by
A Critical Evaluation of Website Fingerprinting Attacks
Juarez, M., Afroz, S., Acar, G., Diaz, C., & Greenstadt, R. (2014) · Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2660267.2660368 · Cited by 327
Timing Analysis in Low-Latency Mix Networks: Attacks and Defenses
Shmatikov, V., & Wang, M.-H. (2006) · Lecture Notes in Computer Science · doi:10.1007/11863908_2 · Cited by 273
Riffle: An Efficient Communication System With Strong Anonymity
Kwon, A., Lazar, D., Devadas, S., & Ford, B. (2016) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2016-0008 · Cited by 84
Traffic Analysis Attacks on Tor: A Survey
Basyoni, L., Fetais, N., Erbad, A., Mohamed, A., & Guizani, M. (2020) · 2020 IEEE International Conference on Informatics, IoT, and Enabling Technologies (ICIoT) · doi:10.1109/iciot48696.2020.9089497 · Cited by 54
Establishing Trusted I/O Paths for SGX Client Systems With Aurora
Liang, H., Li, M., Chen, Y., Jiang, L., Xie, Z., & Yang, T. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2019.2945621 · Cited by 25
Metadata
- Authors
- Murdoch, S. J., & Danezis, G.
- Venue
- 2005 IEEE Symposium on Security and Privacy (S&P'05)
- Publisher
- IEEE
- Published
- 2005-05-24
- Pages
- 183-195
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2127295197
- Cited by
- 517
- References
- 1
- FWCI
- 15.03
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Low-Cost Traffic Analysis of Tor. https://app.cochat.ai/papers/10.1109/sp.2005.12
- The paper
- Murdoch, S. J., & Danezis, G. (2005). Low-Cost Traffic Analysis of Tor. 2005 IEEE Symposium on Security and Privacy (S&P'05). https://doi.org/10.1109/sp.2005.12
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.