The Free Haven Project: Distributed Anonymous Storage Service
The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
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
Chor, B., Kushilevitz, E., Goldreich, O., & Sudan, M. (1998) · Journal of the ACM · doi:10.1145/293347.293350 · Cited by 1,612
Why Johnny can't encrypt: a usability evaluation of PGP 5.0
Whitten, A., & Tygar, J. D. (1999) · USENIX Security Symposium · Cited by 1,528
A Randomized Protocol for Signing Contracts
Even, S., Goldreich, O., & Lempel, A. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_19 · Cited by 1,450
The dining cryptographers problem: Unconditional sender and recipient untraceability
Chaum, D. (1988) · Journal of Cryptology · doi:10.1007/bf00206326 · Cited by 1,408
Efficient dispersal of information for security, load balancing, and fault tolerance
Rabin, M. O. (1989) · Journal of the ACM · doi:10.1145/62044.62050 · Cited by 1,365
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
Publicly Verifiable Secret Sharing
Stadler, M. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_17 · Cited by 531
Canetti, R., Dwork, C., Naor, M., & Ostrovsky, R. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052229 · Cited by 348
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
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
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Goldreich, O. (1999) · Algorithms and Combinatorics · doi:10.1007/978-3-662-12521-2 · Cited by 265
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
Jakobsson, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054145 · Cited by 181
Privacy-enhancing technologies for the Internet
Goldberg, I., Wagner, D., & Brewer, E. (2002) · Proceedings IEEE COMPCON 97. Digest of Papers · doi:10.1109/cmpcon.1997.584680 · Cited by 180
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
ISDN-MIXes: Untraceable Communication with Small Bandwidth Overhead
Pfitzmann, A., Pfitzmann, B., & Waidner, M. (1991) · Kommunikation in Verteilten Systemen · Cited by 121
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 117
Publius: A Robust, Tamper-Evident, Censorship-Resistant, and Source-Anonymous Web Publishing System
Waldman, M., Rubin, A. D., & Cranor, L. F. (2000) · USENIX Security Symposium · Cited by 89
Cited by
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Rowstron, A., & Druschel, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45518-3_18 · Cited by 7,276
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
“Many systems [3, 4, 8, 10 , 17, 18, 29, 34, 36] replicate computational or storage tasks among several remote sites to protect against integrity violations (data loss).”
BackgroundTor: The Second-Generation Onion Router
Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104
“Tor’s rendezvous points enable connections between mutually anonymous entities; they are a building block for location-hidden servers, which are needed by Eternity and Free Haven.”
Self-citationFreenet: 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
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
Rowstron, A., & Druschel, P. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502053 · Cited by 1,218
Metadata
- Authors
- Dingledine, R., Freedman, M. J., & Molnar, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 67-95
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1580004440
- Cited by
- 336
- References
- 21
- FWCI
- 21.22
- 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.