The Free Haven Project: Distributed Anonymous Storage Service

By Roger Dingledine, Michael J. Freedman, David A. Molnar. Workshop on Design Issues in Anonymity and Unobservability, 2000

438 citations recorded by the source corpus.

Subfields: Artificial Intelligence

View Paper: https://www.semanticscholar.org/paper/5704bf95606f234e3487115b1850a0ee88f2ab95

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

Citations in the corpus

The pynchon gate: a secure method of pseudonymous mail retrieval (2005, methodology): “Our design uses a simple distributedtrust private information retrieval protocol to prevent adversaries from linking recipients to their pseudonyms, even when some of the infrastructure has been compromised.”
Adaptive probabilistic search for peer-to-peer networks (2003, methodology): “Freenet [ CSWH01 ] uses a DFS-like search with the exception that nodes forward to neighbors after consulting a routing table from previous searches.”
Locating hidden servers (2006, background): “Both the EFF and Reporters Without Borders have issued guides that describe using hidden services via Tor to protect the safety of dissidents as well as to resist censorship.”
Search and replication in unstructured peer-to-peer networks (2002, methodology): “Freenet [8], Free Haven [ 10 ], Mojo Nation [14] are but a few examples of this rapidly growing list.”
The Sybil Attack (2002, background): “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).”
Mixminion: design of a type III anonymous remailer protocol (2003, methodology): “We would like to use Mixminion as a transport layer for higher-level applications such as anonymous publication systems [ 15 ], but much research remains before we can provide security for users transferring large les over Mixminion.”
A peer-to-peer anonymizing network layer (2002, background): “Haven [ 8 ] and Tangler [27] specifically cite the need for a system like Tarzan for their anonymity”
Choosing reputable servents in a P2P network (2002, background): “INTRODUCTION y e e h e d a e o e e htn h m a h s t d n a hrd b t h n h dhe h e n h a h she h d dyt h e n h g h e t d em hhd b etdha h a pda m m h d e h h e d d e g b h a a a d n e d c o e e h e d a e o e e h R y l y rn h d a radpt n h n h dpt g g e o d t h g ela had b ehm h d e h h e dtt dhd b e…”
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility (2001, background): “In this regard, it is more closely related with projects like OceanStore [20], FarSite [8], FreeHaven [15], and Eternity [5].”
Erasure Coding Vs. Replication: A Quantitative Comparison (2002, background): “FreeHaven [6] is a systemfor anonymouspublishingthatusesaninformationdispersalalgorithm,in a manneranalogous to erasurecodes.”
TrustMe: anonymous management of trust relationships in decentralized P2P systems (2003, background): “Also within the scope of the P2P, the anonymous services provided by Freenet [3] and FreeHaven [6] have received attention.”
PeerDB: a P2P-based system for distributed data sharing (2003, methodology): “As mentioned, P2P technologies have been deployed in many applications [17, 8, 7, 6, 21, 18].”
Wide-area cooperative storage with CFS (2001, methodology): “Fr e Haven [7] uses both cryptography and routing (using re-mail ers [4])”
Glacier: highly durable, decentralized storage despite massive correlated failures (2005, background): “Haven [18], Myriad [13], PASIS [45] and other systems [2] use erasure codes to reduce the storage overhead for the redundant data.”