Freenet: A Distributed Anonymous Information Storage and Retrieval System Josh Colvin CIS 590, Fall 2011.

Slides:

Advertisements

Similar presentations

Performance in Decentralized Filesharing Networks Theodore Hong Freenet Project.

Advertisements

Peer-to-peer and agent-based computing Freenet. peer-to-peer and agent-based computing 2 Plan of lecture Freenet Architecture –Goals and Properties Searching.

Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.

Scalable Content-Addressable Network Lintao Liu

Peer-to-Peer Systems Chapter 25. What is Peer-to-Peer (P2P)? Napster? Gnutella? Most people think of P2P as music sharing.

Freenet A Distributed Anonymous Information Storage and Retrieval System Ian Clarke Oskar Sandberg Brandon Wiley Theodore W.Hong.

Outline for today Structured overlay as infrastructures Survey of design solutions Analysis of designs.

Peer to Peer File Sharing Huseyin Ozgur TAN. What is Peer-to-Peer?  Every node is designed to(but may not by user choice) provide some service that helps.

FreeNet: A Distributed Anonymous Information Storage and Retrieval System Ian Clark, Oskar Sandberg, Brandon Wiley and Theodore Hong.

P2P: Advanced Topics Filesystems over DHTs and P2P research Vyas Sekar.

Spring 2003CS 4611 Peer-to-Peer Networks Outline Survey Self-organizing overlay network File system on top of P2P network Contributions from Peter Druschel.

Chord and CFS Philip Skov Knudsen Niels Teglsbo Jensen Mads Lundemann

Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems Presented by: Lin Wing Kai.

1 Unstructured Routing : Gnutella and Freenet Presented By Matthew, Nicolai, Paul.

Protecting Free Expression Online with Freenet Presented by Ho Tsz Kin I. Clarke, T. W. Hong, S. G. Miller, O. Sandberg, and B. Wiley 14/08/2003.

A Scalable Content- Addressable Network Sections: 3.1 and 3.2 Καραγιάννης Αναστάσιος Α.Μ. 74.

Gnutella, Freenet and Peer to Peer Networks By Norman Eng Steven Hnatko George Papadopoulos.

Object Naming & Content based Object Search 2/3/2003.

Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.

Freenet A Distributed Anonymous Information Storage and Retrieval System I Clarke O Sandberg I Clarke O Sandberg B WileyT W Hong.

Wide-area cooperative storage with CFS

Or, Providing Scalable, Decentralized Location and Routing Network Services Tapestry: Fault-tolerant Wide-area Application Infrastructure Motivation and.

1 Peer-to-Peer Networks Outline Survey Self-organizing overlay network File system on top of P2P network Contributions from Peter Druschel.

1 Freenet  Addition goals to file location: -Provide publisher anonymity, security -Resistant to attacks – a third party shouldn’t be able to deny the.

Hashing it Out in Public Common Failure Modes of DHT-based Anonymity Schemes Andrew Tran, Nicholas Hopper, Yongdae Kim Presenter: Josh Colvin, Fall 2011.

Freenet: A Distributed Anonymous Information Storage and Retrieval System Presentation by Theodore Mao CS294-4: Peer-to-peer Systems August 27, 2003.

F REENET UDAYA S PISIPATI 02/26/08. C ONTENTS  Introduction  Design goals  Architecture  Basic model  Keys in searching  Retrieving data  Storing.

INTRODUCTION TO PEER TO PEER NETWORKS Z.M. Joseph CSE 6392 – DB Exploration Spring 2006 CSE, UT Arlington.

Freenet. Anonymity  Napster, Gnutella, Kazaa do not provide anonymity  Users know who they are downloading from  Others know who sent a query  Freenet.

Peer-to-Peer Computing CS587x Lecture Department of Computer Science Iowa State University.

Introduction to Peer-to-Peer Networks. What is a P2P network A P2P network is a large distributed system. It uses the vast resource of PCs distributed.

Content Overlays (Nick Feamster). 2 Content Overlays Distributed content storage and retrieval Two primary approaches: –Structured overlay –Unstructured.

1 1.Freenet Architecture a)Goals b)Properties 2.Searching a network a)Searching/Routing algorithm b)Adaptive behaviour c)Differences with other algorithms.

Chord & CFS Presenter: Gang ZhouNov. 11th, University of Virginia.

Systems Analysis and Design in a Changing World, 6th Edition 1 Chapter 12 - Databases, Controls, and Security.

Freenet: A Distributed Anonymous Information Storage and Retrieval System Presenter: Chris Grier ECE 598nb Spring 2006.

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

Freenet File sharing for a political world. Freenet: A Distributed Anonymous Information Storage and Retrieval System I. Clarke, O. Sandberg, B. Wiley,

Using the Small-World Model to Improve Freenet Performance Hui Zhang Ashish Goel Ramesh Govindan USC.

1 Distributed Hash Tables (DHTs) Lars Jørgen Lillehovde Jo Grimstad Bang Distributed Hash Tables (DHTs)

A Scalable Content-Addressable Network (CAN) Seminar “Peer-to-peer Information Systems” Speaker Vladimir Eske Advisor Dr. Ralf Schenkel November 2003.

Peer-To-Peer Networks BitTorrent vs. FreeNet Presentation By Bishara Khleif Comp 529.

Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan Presented.

1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.

Scalable Content- Addressable Networks Prepared by Kuhan Paramsothy March 5, 2007.

The new protocol of freenet Taken from Ian Clarke and Oskar Sandberg (The Freenet Project)

Freenet “…an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity.

Freenet Ubiquitous Computing - Assignment Guided By: Prof. Niloy Ganguly Department of Computer Science and Engineering Submitted By: o Parin Deepak Cheda.

Computer Networking P2P. Why P2P? Scaling: system scales with number of clients, by definition Eliminate centralization: Eliminate single point.

1. Efficient Peer-to-Peer Lookup Based on a Distributed Trie 2. Complex Queries in DHT-based Peer-to-Peer Networks Lintao Liu 5/21/2002.

Bruce Hammer, Steve Wallis, Raymond Ho

Freenet: Anonymous Storage and Retrieval of Information

Company LOGO Freenet By Yogesh Kalyani. OUTLINE  Introducing P2P  Overview of Freenet  Key’s  Protocol  Security Analysis  Improvement  Strength.

A Key Management Scheme for Distributed Sensor Networks Laurent Eschaenauer and Virgil D. Gligor.

P2P Search COP P2P Search Techniques Centralized P2P systems  e.g. Napster, Decentralized & unstructured P2P systems  e.g. Gnutella.

Large Scale Sharing Marco F. Duarte COMP 520: Distributed Systems September 19, 2004.

Freenet A Distributed Anonymous Information System and Retrieval System I. Clarke, O. Sandberg, B. Wiley, W. Hong ECE 6102 Presented By: Kaushik Chowdhury.

P2P Networking: Freenet Adriane Lau November 9, 2004 MIE456F.

TRUST Self-Organizing Systems Emin G ü n Sirer, Cornell University.

Dependable and Secure Data Storage and Retrieval in Wireless, Mobile Networks ISTI – CNR Pisa IS-MANET – WP4.

ANONYMOUS STORAGE AND RETRIEVAL OF INFORMATION Olufemi Odegbile.

Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M

A Scalable, Content-Addressable Network

Presentation by Theodore Mao CS294-4: Peer-to-peer Systems

Unstructured Routing : Gnutella and Freenet

Chord and CFS Philip Skov Knudsen

A Scalable, Content-Addressable Network

InfoShare A Distributed P2P Information Storage & Retrieval System

Presentation transcript:

Freenet: A Distributed Anonymous Information Storage and Retrieval System Josh Colvin CIS 590, Fall 2011

What are the goals of Freenet? Anonymity Repudiability Resilience Efficiency Decentralization

Locating Files File Keys – Keyword-signed key (KSK) – Signed-subspace key (SSK) – Content-hash key (CHK) Issues

Architecture Nodes – Data stores – Routing table Requests – File key – Hops-to-live

Data Retrieval A B E D F C

Data Storage Similar algorithm used in retrieval Promotes efficiency and redundancy Protects against attacks

Data Management Data permanency – Dropping unused data Datastore encryption

Network Expansion Adding new nodes Distribution complications Registering in routing tables

Performance Analysis Convergence – Increases as the network operates – Average path length decreases Scalability – Pathlength scales logarithmically – Projected median of ~30 hops at 1,000,000 nodes Fault-Tolerance – Median path length <20 at 30% node failure

Security Primary goal is protecting anonymity Specific threats – File Modification Infeasible for SSK or CHK data – Denial of service attack Hash Cash Datastore partitioning

Goals Recap Anonymity Repudiability Resilience Efficiency Decentralization

Questions?