1 / 14

Freenet: A Distributed Anonymous Information Storage and Retrieval System

Freenet: A Distributed Anonymous Information Storage and Retrieval System. Ian Clarke, Oskar Sandberg, Brandon Wiley,Theodore W. Hong Presented by Zhengxiang Pan Jan. 30. Design Goals. Anonymity for both producers and consumers of information Deniability for storers of information

dasha
Download Presentation

Freenet: A Distributed Anonymous Information Storage and Retrieval System

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Freenet: A Distributed Anonymous Information Storage and Retrieval System Ian Clarke, Oskar Sandberg, Brandon Wiley,Theodore W. Hong Presented by Zhengxiang Pan Jan. 30

  2. Design Goals • Anonymity for both producers and consumers of information • Deniability for storers of information • Resistance to attempts by third parties to deny access to information • Efficient dynamic storage and routing of information • Decentralization of all network functions

  3. Architecture -overview • A cooperative distributed file system • Location independence • Transparent lazy replication • Local datastore & dynamic routing table • No privilege • No hierarchy • No central point

  4. Architecture –Keys and Searching • KSK: keyword-signed key • Easy to remember • Problematic flat global namespace • SSK: signed-subspace key • Personal namespace • Manage directory • CHK: content-hash key • Pseudo-unique file key • Useful for updating and splitting

  5. Architecture –Retrieving data

  6. Architecture –Storing data • Calculate file key • Send insert message like request • If “all clear” send the data to insert • Stored in each node alone the path • Each node add entry to routing table associating the key and the data source (can be random decided)

  7. Architecture –others • Managing data • LRU: Least Recently Used Cache • Routing table entries: in same fashion but will be kept longer • Encrypted contents • Adding nodes • Find existing nodes by out-of-band means • New-node announcement • Consistent random key for new node in routing table

  8. Protocol details • Flexible in transport mechanism • Node address e.g. tcp/192.168.1.1:19114 • 64-bit transaction ID • Hops-to-live & depth

  9. Performance analysis -convergence Time evolution of the request pathlength

  10. Performance analysis -scalability Request pathlength VS network size

  11. Performance analysis –fault tolerance Change in request pathlength under network failure

  12. Performance analysis –small world model Distribution of link number among Freenet nodes

  13. Security • Anonymity of requestors and inserters • Key anonymity: vulnerable to dictionary attack • Sender anonymity: local eavesdrop • Anonymity of storer: encrypted contents • Malicious modification: keys • Denial-of-service: a large number of junk files

  14. More ? • http://www.freenetproject.org/

More Related