The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Crowds: anonymity for Web transactions
Abstract
In this paper we introduce a system called Crowds for protecting users' anonymity on the world-wide-web. Crowds, named for the notion of “blending into a crowd,” operates by grouping users into a large and geographically diverse group (crowd) that collectively issues requests on behalf of its members. Web servers are unable to learn the true source of a request because it is equally likely to have originated from any member of the crowd, and even collaborating crowd members cannot distinguish the originator of a request from a member who is merely forwarding the request on behalf of another. We describe the design, implementation, security, performance, and scalability of our system. Our security analysis introduces degrees of anonymity as an important tool for describing and proving anonymity properties.
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
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
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
Fail-stop processors: an approach to designing fault-tolerant computing systems
Schlichting, R. D., & Schneider, F. B. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357369.357371 · Cited by 769
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
Gulcu, C., & Tsudik, G. (2002) · Proceedings of Internet Society Symposium on Network and Distributed Systems Security · doi:10.1109/ndss.1996.492350 · Cited by 302
Intrusion tolerance in distributed computing systems
Deswarte, Y., Blain, L., & Fabre, J.-C. (2002) · Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1991.130780 · Cited by 233
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
Networks without user observability
Pfitzmann, A., & Waidner, M. (1987) · Computers & Security · doi:10.1016/0167-4048(87)90087-3 · Cited by 164
A secure group membership protocol
Reiter, M. K. (1996) · IEEE Transactions on Software Engineering · doi:10.1109/32.481515 · Cited by 156
Self-citationHow to make personalized web browsing simple, secure, and anonymous
Gabber, E., Gibbons, P. B., Matias, Y., & Mayer, A. J. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63594-7_64 · Cited by 155
Increasing availability and security of an authentication service
Gong, L. (1993) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.223866 · Cited by 115
How to Break the Direct RSA-Implementation of Mixes
Pfitzmann, B., & Pfitzmann, A. (2007) · Springer eBooks · doi:10.1007/3-540-46885-4_37 · Cited by 114
ISDN-MIXes: Untraceable Communication with Small Bandwidth Overhead
Pfitzmann, A., Pfitzmann, B., & Waidner, M. (1991) · Kommunikation in Verteilten Systemen · Cited by 91
Distributing trust with the Rampart toolkit
Reiter, M. K. (1996) · Communications of the ACM · doi:10.1145/227210.227228 · Cited by 88
Self-citation
Cited by
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
Tor: The Second-Generation Onion Router
Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104
Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking
Gruteser, M., & Grunwald, D. (2003) · Proceedings of the 1st international conference on Mobile systems, applications and services · doi:10.1145/1066116.1189037 · Cited by 2,275
Wide-area cooperative storage with CFS
Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., & Stoica, I. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502054 · Cited by 1,428
Ariadne: a secure on-demand routing protocol for ad hoc networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2002) · Proceedings of the 8th annual international conference on Mobile computing and networking · doi:10.1145/570645.570648 · Cited by 1,298
Metadata
- Authors
- Reiter, M. K., & Rubin, A. D.
- Venue
- ACM Transactions on Information and System Security
- Published
- 1998-11
- Volume
- 1
- Issue
- 1
- Pages
- 66-92
- ISSN
- 1094-9224 (ISSN-L)
- 1557-7406
- OpenAlex
- W1978884755
- Cited by
- 1,770
- References
- 17
- FWCI
- 28.01
- Type
- journal article
- 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.