Towards an Analysis of Onion Routing Security
The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
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
Untraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. L. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,289
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
The dining cryptographers problem: Unconditional sender and recipient untraceability
Chaum, D. (1988) · Journal of Cryptology · doi:10.1007/bf00206326 · Cited by 1,408
Anonymous connections and onion routing
Reed, M. G., Syverson, P. F., & Goldschlag, D. M. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668972 · Cited by 1,063
Self-citationGoldschlag, D., Reed, M., & Syverson, P. (1999) · Communications of the ACM · doi:10.1145/293411.293443 · Cited by 689
Self-citationAnonymous connections and onion routing
Syverson, P. F., Goldschlag, D. M., & Reed, M. G. (2002) · Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097) · doi:10.1109/secpri.1997.601314 · Cited by 629
Self-citationGoldschlag, 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
Self-citationHow to withstand mobile virus attacks (extended abstract)
Ostrovsky, R., & Yung, M. (1991) · Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 · doi:10.1145/112600.112605 · Cited by 465
Onion Routing for Anonymous and Private Internet Connections
Goldschlag, D. M., Reed, M., & Syverson, P. F. (1999) · Cited by 413
Self-citationGulcu, C., & Tsudik, G. (2002) · Proceedings of Internet Society Symposium on Network and Distributed Systems Security · doi:10.1109/ndss.1996.492350 · Cited by 302
Self-citation
Cited by
Tor: The Second-Generation Onion Router
Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104
“Tradeoffs between padding protection and cost were discussed, and traffic shapingalgorithms were theorized [49] to provide good security without expensive padding, but no concrete padding scheme was suggested.”
Self-citationBitcoin and beyond: a technical survey on decentralized digital currencies
Tschorsch, F., & Scheuermann, B. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2535718 · Cited by 1,690
Towards an Information Theoretic Metric for Anonymity
Serjantov, A., & Danezis, G. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36467-6_4 · Cited by 663
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
Mixminion: design of a type III anonymous remailer protocol
Danezis, G., Dingledine, R., & Mathewson, N. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/secpri.2003.1199323 · Cited by 658
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
Inferring the source of encrypted HTTP connections
Liberatore, M., & Levine, B. N. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180437 · Cited by 413
Statistical identification of encrypted Web browsing traffic
Sun, Q., Simon, D. R., Wang, Y.-M., Russell, W., Padmanabhan, V. N., & Qiu, L. (2005) · Proceedings 2002 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.2002.1004359 · Cited by 377
Overlier, L., & Syverson, P. (2006) · 2006 IEEE Symposium on Security and Privacy (S&P'06) · doi:10.1109/sp.2006.24 · Cited by 343
Self-citationLow-resource routing attacks against tor
Bauer, K., McCoy, D., Grunwald, D., Kohno, T., & Sicker, D. (2007) · Proceedings of the 2007 ACM workshop on Privacy in electronic society · doi:10.1145/1314333.1314336 · Cited by 314
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
Enhancing wireless location privacy using silent period
Huang, L., Matsuura, K., Yamane, H., & Sezaki, K. (2005) · IEEE Wireless Communications and Networking Conference, 2005 · doi:10.1109/wcnc.2005.1424677 · Cited by 259
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
Metadata
- Authors
- Syverson, P., Tsudik, G., Reed, M., & Landwehr, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 96-114
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2138719936
- Cited by
- 302
- References
- 18
- FWCI
- 7.15
- 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.