Freenet: A Distributed Anonymous Information Storage and Retrieval System
By Ian Clarke, Oskar Sandberg, Brandon Wiley, Theodore W. Hong. Workshop on Design Issues in Anonymity and Unobservability, 2000
2,346 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/9f4ec57919f892dc1e4b56637b3ef1f34c1b0316
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
- Bryan Ford
- Henry Corrigan-Gibbs
- Charu C. Aggarwal
- Ling Liu
- D. Wallach
- Peter Druschel
- Gene Tsudik
- Johannes Gehrke
In Computer Networks and Communications
- Ion Stoica
- Peter Druschel
- Deborah Estrin
- Hari Balakrishnan
- Antony Ian Taylor Rowstron
- John D. Kubiatowicz
- John Risson
- Tim Moors
Citations in the corpus
- Chord: A scalable peer-to-peer lookup service for internet applications (2001, background): “4 5 6 7 2 [2,3) 3 3 [3,5) 3 5 [5,1) 0 start int.”
- Achieving Efficient Conjunctive Keyword Searches over Encrypted Data (2005, background): “Remote and untrusted storage systems [21,14,13] allow clients with limited resources to store and distribute large amounts of data at low cost.”
- Survey of research towards robust peer-to-peer networks: Search methods (2006, background): “While the Freenet designers considered this as evidence that the system is ''surprisingly robust against quite large failures'' [71], the same datapoint may well be outside meaningful operating bounds.”
- Hashcash - A Denial of Service Counter-Measure (2002, methodology): “No deployment but the analogous client-puzzle system was implemented with TLS in [13] " hashcash throttling of DoS publication floods in anonymous publication systems such as Freenet [14], Publius [15], Tangler [16], " hashcash throttling of service requests in the cryptographic Self-certifying File”
- Wide-area cooperative storage with CFS (2001, methodology): “tella [11], and Freenet [6]) demonstrate the benefits of coop erative storage and serving: fault tolerance, load balance, and the ability to harness idle storage and network resources.”
- Reclaiming space from duplicate files in a serverless distributed file system (2002, methodology): “The resulting increase in available space could benefit server-based distributed file systems such as AFS [20] and Ficus [19], serverless distributed file systems such as xFS [2] and Frangipani [37], content publishing systems such as Publius [38] and Freenet [12], and archival storage systems such ”
- Query-based sampling of text databases (2001, background): “FreeNet [Clarke et al. 2000] is a peer-to-peer search algorithm that passes queries from node to node in a network until either a search horizon is reached or the query is satisfied.”
- Scalable and efficient provable data possession (2008, background): “Consider, for example, the Freenet network [10], or the Cooperative Internet Backup Scheme [24].”
- Dissent in Numbers: Making Strong Anonymity Scale (2012, neutral): “ability of these strong anonymity techniques by at least two orders of magnitude, substantially narrowing the gap compared with relaying approaches [18, 21, 26, 38, 42].”
- Safebook: A privacy-preserving online social network leveraging on real-life trust (2009, background): “Although not designed originally for the purpose of social networking, darknets and related P2P systems [13], [14], [15] aim at anonymous communication through hop-by-hop encryption among trusted users, as in Safebook.”
- Secure data deduplication (2008, background): “Data encryption also provides the storage host with a level of plausible deniability; as there is no clear owner, a node’s operator can claim that they have no knowledge about the plain-text data stored on their node [9].”
- Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems (2001, methodology): “There are currently many projects aimed at constructing peer-to-peer applications and understanding more of the issues and requirements of such applications and systems [1, 2, 5, 8, 10, 15].”
- The Sybil Attack (2002, background): “This paper shows that, without aa logically centralized authority,,Sybil attacks are always possible except under extreme andd unrealistic assumptions of resource parity andd coordinationn amongg entities.”
- The Anatomy of the Grid: Enabling Scalable Virtual Organizations (2001, background): “4 Internet and Peer-to-Peer Computing Peer-to-peer computing (as implemented, for example, in the Napster, Gnutella, and Freenet [24] file sharing systems) and Internet computing (as implemented, for example by the SETI@home, Parabon, and Entropia systems) is an example of the more general (“beyond ”