The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Towards Measuring Anonymity
Open accessOverview
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
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
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
Anonymity, Unobservability, and Pseudonymity — A Proposal for Terminology
Pfitzmann, A., & Köhntopp, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_1 · Cited by 763
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
Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems
Raymond, J.-F. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_2 · Cited by 422
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
Anonymous Web transactions with Crowds
Reiter, M. K., & Rubin, A. D. (1999) · Communications of the ACM · doi:10.1145/293411.293778 · Cited by 286
(2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4 · Cited by 285
An Analysis of the Degradation of Anonymous Protocols.
Wright, M., Adler, M., Levine, B. N., & Shields, C. (2002) · Cited by 195
The 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
Anonymous 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
Cited by
Robust De-anonymization of Large Sparse Datasets
Narayanan, A., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.33 · Cited by 2,372
Evaluating user privacy in bitcoin
Androulaki, E., Karame, G. O., Roeschlin, M., Scherer, T., & Capkun, S. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39884-1_4 · Cited by 700
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
Privacy in electronic commerce and the economics of immediate gratification
Acquisti, A. (2004) · Proceedings of the 5th ACM conference on Electronic commerce · doi:10.1145/988772.988777 · Cited by 561
Mixcoin: Anonymity for Bitcoin with Accountable Mixes
Bonneau, J., Narayanan, A., Miller, A., Clark, J., Kroll, J. A., & Felten, E. W. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-45472-5_31 · Cited by 441
Metadata
- Authors
- Díaz, C., Seys, S., Claessens, J., & Preneel, B.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2003
- Pages
- 54-68
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2162297215
- Cited by
- 728
- References
- 15
- FWCI
- 20.13
- Type
- conference paper
- Language
- en
- Open access
- green
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.