The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Timing Attacks in Low-Latency Mix Systems
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×
“One approach would be to create fake users, generally an easy task [9], and each such user F can generate traffic through paths that include attacker mixes as M 1 and M F h .”
BackgroundUntraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. L. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,289
Measurement study of peer-to-peer file sharing systems:
Saroiu, S., Gummadi, P. K., & Gribble, S. D. (2001) · SPIE Proceedings · doi:10.1117/12.449977 · Cited by 1,905
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
End-to-end packet delay and loss behavior in the internet
Bolot, J.-C. (1993) · Conference proceedings on Communications architectures, protocols and applications · doi:10.1145/166237.166265 · Cited by 729
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
Rodrigues, R., & Druschel, P. (2010) · Communications of the ACM · doi:10.1145/1831407.1831427 · Cited by 562
Stop- and- Go-MIXes Providing Probabilistic Anonymity in an Open System
Kesdogan, D., Egner, J., & Büschkes, R. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49380-8_7 · Cited by 285
ISDN-Mixes: Untraceable Communication with Very Small Bandwidth Overhead
Pfitzmann, A., Pfitzmann, B., & Waidner, M. (1991) · Informatik-Fachberichte · doi:10.1007/978-3-642-76462-2_32 · Cited by 216
An Analysis of the Degradation of Anonymous Protocols.
Wright, M., Adler, M., Levine, B. N., & Shields, C. (2002) · Cited by 195
Self-citationThe Disadvantages of Free MIX Routes and How to Overcome Them
Berthold, O., Pfitzmann, A., & Standtke, R. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44702-4_3 · Cited by 177
From a Trickle to a Flood: Active Attacks on Several Mix Types
Serjantov, A., Dingledine, R., & Syverson, P. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36415-3_3 · Cited by 166
Acquisti, A., Dingledine, R., & Syverson, P. F. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45126-6_7 · Cited by 159
Project “anonymity and unobservability in the Internet”
Berthold, O., Federrath, H., & Köhntopp, M. (2000) · Computers, Freedom and Privacy · doi:10.1145/332186.332211 · Cited by 138
Jakobsson, M. (1999) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/301308.301333 · Cited by 128
Defending anonymous communications against passive logging attacks
Wright, M., Adler, M., Levine, B. N., & Shields, C. (2004) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/secpri.2003.1199325 · Cited by 126
Self-citationAnonymous Connections and Onion Routing
Reed, M. G., Syverson, P. F., & Goldschlag, D. M. (1998) · Defense Technical Information Center (DTIC) · doi:10.21236/ada465335 · Cited by 126
Cryptographic defense against traffic analysis
Rackoff, C., & Simon, D. R. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167260 · Cited by 104
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 95
Cited by
Smart Cities: A Survey on Data Management, Security, and Enabling Technologies
Gharaibeh, A., Salahuddin, M. A., Hussini, S. J., Khreishah, A., Khalil, I., Guizani, M., & Al-Fuqaha, A. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2736886 · Cited by 628
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
Self-citationOverlier, L., & Syverson, P. (2006) · 2006 IEEE Symposium on Security and Privacy (S&P'06) · doi:10.1109/sp.2006.24 · Cited by 343
Privacy in the Smart City—Applications, Technologies, Challenges, and Solutions
Eckhoff, D., & Wagner, I. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2748998 · Cited by 287
Metadata
- Authors
- Levine, B. N., Reiter, M. K., Wang, C., & Wright, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2004
- Pages
- 251-265
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1869319442
- Cited by
- 277
- References
- 19
- FWCI
- 8.89
- 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.