Low-resource routing attacks against tor
The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Abstract
Tor has become one of the most popular overlay networks for anonymizing TCP traffic. Its popularity is due in part to its perceived strong anonymity properties and its relatively low latency service. Low latency is achieved through Tor's ability to balance the traffic load by optimizing Tor router selection to probabilistically favor routers with high bandwidth capabilities.
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.
Integrity signals
Registry
Cites
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.
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
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419 · cited 1×
“In a Tor deployment of 60 honest and 6 malicious Tor routers, our attack compromised over 46% of the path-building requests from new clients through the network.”
BackgroundTor: The Second-Generation Onion Router
Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104
Freenet: A Distributed Anonymous Information Storage and Retrieval System
Clarke, I., Sandberg, O., Wiley, B., & Hong, T. W. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_4 · Cited by 2,109
Crowds: anonymity for Web transactions
Reiter, M. K., & Rubin, A. D. (1998) · ACM Transactions on Information and System Security · doi:10.1145/290163.290168 · Cited by 1,770
Secure routing for structured peer-to-peer overlay networks
Castro, M., Druschel, P., Ganesh, A., Rowstron, A., & Wallach, D. S. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844156 · Cited by 743
Tarzan: a peer-to-peer anonymizing network layer
Freedman, M. J., & Morris, R. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586137 · Cited by 663
Low-Cost Traffic Analysis of Tor
Murdoch, S. J., & Danezis, G. (2005) · 2005 IEEE Symposium on Security and Privacy (S&P'05) · doi:10.1109/sp.2005.12 · Cited by 517
Goldschlag, D. M., Reed, M. G., & Syverson, P. F. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61996-8_37 · Cited by 494
Overlier, L., & Syverson, P. (2006) · 2006 IEEE Symposium on Security and Privacy (S&P'06) · doi:10.1109/sp.2006.24 · Cited by 343
Eclipse Attacks on Overlay Networks: Threats and Defenses
Singh, A., Ngan, T.-W., Druschel, P., & Wallach, D. S. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.231 · Cited by 317
Introducing MorphMix: peer-to-peer based anonymous Internet usage with collusion detection
Rennhard, M., & Plattner, B. (2002) · Proceedings of the 2002 ACM workshop on Privacy in the Electronic Society · doi:10.1145/644527.644537 · Cited by 306
Towards an Analysis of Onion Routing Security
Syverson, P., Tsudik, G., Reed, M., & Landwehr, C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_6 · Cited by 302
Hot or not: Revealing hidden services by their clock skew
Murdoch, S. J. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180410 · Cited by 253
Tracking anonymous peer-to-peer VoIP calls on the internet
Wang, X., Chen, S., & Jajodia, S. (2005) · Proceedings of the 12th ACM conference on Computer and communications security · doi:10.1145/1102120.1102133 · Cited by 228
Sampled Traffic Analysis by Internet-Exchange-Level Adversaries
Murdoch, S. J., & Zieliński, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-75551-7_11 · Cited by 167
Location diversity in anonymity networks
Feamster, N., & Dingledine, R. (2004) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1029179.1029199 · Cited by 116
Reliable MIX Cascade Networks through Reputation
Dingledine, R., & Syverson, P. F. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36504-4_18 · Cited by 96
On the Security of the Tor Authentication Protocol
Goldberg, I. (2006) · Lecture notes in computer science · doi:10.1007/11957454_18 · Cited by 53
Cited by
Herrmann, D., Wendolsky, R., & Federrath, H. (2009) · Proceedings of the 2009 ACM workshop on Cloud computing security · doi:10.1145/1655008.1655013 · Cited by 424
Shining Light in Dark Places: Understanding the Tor Network
McCoy, D., Bauer, K., Grunwald, D., Kohno, T., & Sicker, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70630-4_5 · Cited by 292
Self-citationUncovering social network Sybils in the wild
Yang, Z., Wilson, C., Wang, X., Gao, T., Zhao, B. Y., & Dai, Y. (2014) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2556609 · Cited by 290
DiPaola, R. S., & Lattime, E. C. (2007) · Journal of Urology · doi:10.1016/j.juro.2007.08.063 · Cited by 282
Uncovering social network sybils in the wild
Yang, Z., Wilson, C., Wang, X., Gao, T., Zhao, B. Y., & Dai, Y. (2011) · Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference · doi:10.1145/2068816.2068841 · Cited by 164
“To date, researchers have demonstrated the efficacy of Sybil attacks against P2P systems [9], anonymous communication networks [1], and sensor networks [12].”
Background
Metadata
- Authors
- Bauer, K., McCoy, D., Grunwald, D., Kohno, T., & Sicker, D.
- Venue
- Proceedings of the 2007 ACM workshop on Privacy in electronic society
- Publisher
- ACM
- Published
- 2007-10-29
- Pages
- 11-20
- OpenAlex
- W2156410527
- Cited by
- 314
- References
- 18
- FWCI
- 14.31
- 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.