Anonymous Web transactions with Crowds
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
The article presents a system called Crowds that enables the retrieval of information over the Web without revealing so much potentially private information to several parties. The goal of Crowds is to make browsing anonymous, so that information about either the user or what information he or she retrieves is hidden from Web servers and other parties. It prevents a Web server from learning any potentially identifying information about the user, including even the user's Internet protocol address or domain name. Crowds also prevents Web servers from learning a variety of other information, such as the page that referred the user to its site or the user's computing platform. Crowds provides users with the ability to retrieve Web content anonymously. It offers strong anonymity properties that are well suited for Web transactions and does so in the face of a broader range of adversaries than proxy-based anonymizers do. It provides complementary protections when the party of concern can directly monitor messages from the user's machine.
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
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
Self-citationDynamic Host Configuration Protocol
Droms, R. (1993) · doi:10.17487/rfc1531 · Cited by 1,025
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
How 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 163
Privacy on the line: the politics of wiretapping and encryption
Diffie, W., & Landau, S. (1998) · Choice Reviews Online · doi:10.5860/choice.35-6456 · Cited by 148
Cited by
Freenet: A Distributed Anonymous Information Storage and Retrieval System
Clarke, I., Sandberg, O., Wiley, B., & Hong, T. W. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_4 · Cited by 2,109
A survey of peer-to-peer content distribution technologies
Androutsellis-Theotokis, S., & Spinellis, D. (2004) · ACM Computing Surveys · doi:10.1145/1041680.1041681 · Cited by 1,425
Díaz, C., Seys, S., Claessens, J., & Preneel, B. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36467-6_5 · Cited by 728
The Social Cost of Cheap Pseudonyms
Friedman*, E. J., & Resnick, P. (2001) · Journal of Economics & Management Strategy · doi:10.1111/j.1430-9134.2001.00173.x · Cited by 536
Spiekermann, S., & Cranor, L. F. (2009) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2008.88 · Cited by 424
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
Verhagen, T., van Nes, J., Feldberg, F., & van Dolen, W. (2014) · Journal of Computer-Mediated Communication · doi:10.1111/jcc4.12066 · Cited by 403
Protecting free expression online with Freenet
Clarke, I., Miller, S. G., Hong, T. W., Sandberg, O., & Wiley, B. (2002) · IEEE Internet Computing · doi:10.1109/4236.978368 · Cited by 401
The Social Cost of Cheap Pseudonyms
Friedman, E. J., & Resnick, P. (2001) · Journal of Economics & Management Strategy · doi:10.1162/105864001300122476 · Cited by 377
Eclipse Attacks on Overlay Networks: Threats and Defenses
Singh, A., Ngan, T.-W., Druschel, P., & Wallach, D. S. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.231 · Cited by 317
Addressing privacy requirements in system design: the PriS method
Kalloniatis, C., Kavakli, E., & Gritzalis, S. (2008) · Requirements Engineering · doi:10.1007/s00766-008-0067-3 · Cited by 269
Riffle: An Efficient Communication System With Strong Anonymity
Kwon, A., Lazar, D., Devadas, S., & Ford, B. (2016) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2016-0008 · Cited by 84
Metadata
- Authors
- Reiter, M. K., & Rubin, A. D.
- Venue
- Communications of the ACM
- Published
- 1999-02
- Volume
- 42
- Issue
- 2
- Pages
- 32-48
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2009172815
- Cited by
- 286
- References
- 6
- FWCI
- 13.02
- Type
- journal article
- Language
- en
- Open access
- bronze
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.