The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Timing Analysis in Low-Latency Mix Networks: Attacks and Defenses
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
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
Tor: The Second-Generation Onion Router
Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104
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
Anonymous 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
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
Web MIXes: A System for Anonymous and Unobservable Internet Access
Berthold, O., Federrath, H., & Köpsell, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_7 · Cited by 395
Overlier, L., & Syverson, P. (2006) · 2006 IEEE Symposium on Security and Privacy (S&P'06) · doi:10.1109/sp.2006.24 · Cited by 343
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
Timing Attacks in Low-Latency Mix Systems
Levine, B. N., Reiter, M. K., Wang, C., & Wright, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27809-2_25 · Cited by 277
Traffic Analysis Attacks and Trade-Offs in Anonymity Providing Systems
Back, A., Möller, U., & Stiglic, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45496-9_18 · Cited by 232
An Analysis of the Degradation of Anonymous Protocols.
Wright, M., Adler, M., Levine, B. N., & Shields, C. (2002) · Cited by 195
On Flow Correlation Attacks and Countermeasures in Mix Networks
Zhu, Y., Fu, X., Graham, B., Bettati, R., & Zhao, W. (2005) · Lecture Notes in Computer Science · doi:10.1007/11423409_13 · Cited by 182
Statistical Disclosure Attacks
Danezis, G. (2003) · Springer eBooks · doi:10.1007/978-0-387-35691-4_40 · Cited by 139
Statistical Disclosure or Intersection Attacks on Anonymity Systems
Danezis, G., & Serjantov, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30114-1_21 · Cited by 131
On effectiveness of link padding for statistical traffic analysis attacks
Fu, X., Graham, B., Bettati, R., & Zhao, W. (2004) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2003.1203483 · Cited by 43
Analytical and empirical analysis of countermeasures to traffic analysis attacks
Fu, X., Graham, B., Bettati, R., Zhao, W., & Xuan, D. (2003) · Proceedings of the International Conference on Parallel Processing · doi:10.1109/icpp.2003.1240613 · Cited by 42
Analysis of an anonymity network for web browsing
Rennhard, M., Rafaeli, S., LaurentMathy, Plattner, B., & Hutchison, D. (2003) · IEEE International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE) · doi:10.1109/enabl.2002.1029987 · Cited by 18
Cited by
Deep Fingerprinting: Undermining Website Fingerprinting Defenses with Deep Learning
Sirinam, P., Imani, M., Juarez, M., & Wright, M. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243768 · Cited by 592
Keeping the Smart Home Private with Smart(er) IoT Traffic Shaping
Apthorpe, N., Huang, D. Y., Reisman, D., Narayanan, A., & Feamster, N. (2019) · Proceedings on Privacy Enhancing Technologies · doi:10.2478/popets-2019-0040 · Cited by 192
Metadata
- Authors
- Shmatikov, V., & Wang, M.-H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 18-33
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1567366855
- Cited by
- 273
- References
- 18
- FWCI
- 6.96
- 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.
