Statistical Disclosure or Intersection Attacks on Anonymity Systems
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
AR/VR devices can act as hardware wallets that allow performing P2P transactions on digital tokens.
“AR/VR devices act as hardware wallets that allow for performing P2P transactions on digital tokens [111].”
From A Review on the Application of Blockchain to the Next Generation of Cybersecure Industry 4.0 Smart Factories (2019) · cites this paper as [111]
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot the international journal of robotics research and application · doi:10.1108/ir.1999.04926fae.001 · Cited by 39,228 · see citing works
Untraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,299 · see citing works
Anonymous connections and onion routing
Reed, M., Syverson, P. F., & Goldschlag, D. M. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668972 · Cited by 1,111 · see citing works
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 669 · see citing works
Self-citationAnonymous connections and onion routing
Syverson, P. F., Goldschlag, D. M., & Reed, M. (2002) · Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy · doi:10.1109/secpri.1997.601314 · Cited by 631 · see citing works
Stop- and- Go-MIXes Providing Probabilistic Anonymity in an Open System
Kesdoğan, D., Egner, J., & Büschkes, R. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49380-8_7 · Cited by 284 · see citing works
From a Trickle to a Flood: Active Attacks on Several Mix Types
Serjantov, A., Dingledine, R., & Syverson, P. F. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36415-3_3 · Cited by 166 · see citing works
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 155 · see citing works
Statistical Disclosure Attacks
Danezis, G. (2003) · Springer eBooks · doi:10.1007/978-0-387-35691-4_40 · Cited by 138 · see citing works
Self-citationAnonymous Connections and Onion Routing
Reed, M. G., Syverson, P. F., & Goldschlag, D. M. (1998) · doi:10.21236/ada465335 · Cited by 124 · see citing works
Mix-Networks with Restricted Routes
Danezis, G. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-40956-4_1 · Cited by 105 · see citing works
Self-citationCovert channels and anonymizing networks
Moskowitz, I. S., Newman, R. E., Crepeau, D. P., et al. (2003) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1005140.1005153 · Cited by 80 · see citing works
Díaz, C., & Serjantov, A. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-40956-4_2 · Cited by 46 · see citing works
Self-citationProbabilistic treatment of MIXes to hamper traffic analysis
Agrawal, D., Kesdoğan, D., & Penz, S. (2004) · Proceedings - International Conference on Data Engineering · doi:10.1109/secpri.2003.1199324 · Cited by 33 · see citing works
On the Anonymity of Timed Pool Mixes
Serjantov, A., & Newman, R. E. (2003) · Springer eBooks · doi:10.1007/978-0-387-35691-4_41 · Cited by 31 · see citing works
Self-citationMichael, P. (1999) · Euromoney eBooks · Cited by 19 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
A Review on the Use of Blockchain for the Internet of Things
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2018) · IEEE Access · doi:10.1109/access.2018.2842685 · Cited by 1,078 · see citing works
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2019) · IEEE Access · doi:10.1109/access.2019.2908780 · Cited by 321 · see citing works
- Authors
- Danezis, G., & Serjantov, A.
- Affiliations
- University of Cambridge (GB)
- ORCID
- Danezis, George
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2004
- Pages
- 293-308
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1484474218
- Cited by
- 131
- References
- 16
- Citations by year
- 2026: 2 · 2025: 4 · 2024: 6 · 2023: 5 · 2022: 4 · 2021: 3 · 2020: 11 · 2019: 2 · 2018: 12 · 2017: 6 · 2016: 5 · 2015: 10 · 2014: 6 · 2013: 7 · 2012: 7
- FWCI
- 3.46
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Keywords
- anonymity, anonymity networks, intersection attacks, information leakage
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
