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

Slides:



Advertisements
Similar presentations
Performance in Decentralized Filesharing Networks Theodore Hong Freenet Project.
Advertisements

Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.
Scalable Content-Addressable Network Lintao Liu
Operating Systems Lecture 10 Issues in Paging and Virtual Memory Adapted from Operating Systems Lecture Notes, Copyright 1997 Martin C. Rinard. Zhiqing.
Modelling and Analysing of Security Protocol: Lecture 10 Anonymity: Systems.
Node Lookup in Peer-to-Peer Network P2P: Large connection of computers, without central control where typically each node has some information of interest.
Denial-of-Service Resilience in Peer-to-Peer Systems D. Dumitriu, E. Knightly, A. Kuzmanovic, I. Stoica and W. Zwaenepoel Presenter: Yan Gao.
Peer to Peer (P2P) Networks and File sharing. By: Ryan Farrell.
Freenet A Distributed Anonymous Information Storage and Retrieval System Ian Clarke Oskar Sandberg Brandon Wiley Theodore W.Hong.
Internet Networking Spring 2006 Tutorial 12 Web Caching Protocols ICP, CARP.
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.
Goal: To build a ubiquitous and robust storage infrastructure Requirement: Scalability, availability, performance, robustness Solution: Dynamic object.
FreeNet: A Distributed Anonymous Information Storage and Retrieval System Ian Clark, Oskar Sandberg, Brandon Wiley and Theodore Hong.
1 Unstructured Routing : Gnutella and Freenet Presented By Matthew, Nicolai, Paul.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #13 Web Caching Protocols ICP, CARP.
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.
Gnutella, Freenet and Peer to Peer Networks By Norman Eng Steven Hnatko George Papadopoulos.
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.
Domain Name System: DNS
Improving Data Access in P2P Systems Karl Aberer and Magdalena Punceva Swiss Federal Institute of Technology Manfred Hauswirth and Roman Schmidt Technical.
Peer-to-Peer Networks Slides largely adopted from Ion Stoica’s lecture at UCB.
1 Freenet  Addition goals to file location: -Provide publisher anonymity, security -Resistant to attacks – a third party shouldn’t be able to deny the.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Application Layer Functionality and Protocols Network Fundamentals – Chapter.
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.
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.
1 Napster & Gnutella An Overview. 2 About Napster Distributed application allowing users to search and exchange MP3 files. Written by Shawn Fanning in.
Research on cloud computing application in the peer-to-peer based video-on-demand systems Speaker : 吳靖緯 MA0G rd International Workshop.
Chapter 16 – DNS. DNS Domain Name Service This service allows client machines to resolve computer names (domain names) to IP addresses DNS works at the.
Slicing the Onion: Anonymity Using Unreliable Overlays Sachin Katti Jeffrey Cohen & Dina Katabi.
Survey of Peer to Peer Technologies Authors: Bratislav Milić, Jelena Krunić, Veljko Milutinović,
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.
Vulnerabilities in peer to peer communications Web Security Sravan Kunnuri.
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.
Using the Small-World Model to Improve Freenet Performance Hui Zhang Ashish Goel Ramesh Govindan USC.
Freenet: A Distributed Anonymous Information Storage and Retrieval System Josh Colvin CIS 590, Fall 2011.
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.
P2PComputing/Scalab 1 Gnutella and Freenet Ramaswamy N.Vadivelu Scalab.
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.
IT 606 Computer Networks (CN). 1.Evolution of Computer Networks & Application Layer. 2.Transport Layer & Network Layer. 3.Routing & Data link Layer. 4.Physical.
ADVANCED COMPUTER NETWORKS Peer-Peer (P2P) Networks 1.
Peer to Peer Network Design Discovery and Routing algorithms
LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan M. Frans Kaashoek David Karger Robert Morris Ion Stoica MIT LCS.
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.
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
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.
CS Spring 2010 CS 414 – Multimedia Systems Design Lecture 24 – Introduction to Peer-to-Peer (P2P) Systems Klara Nahrstedt (presented by Long Vu)
Distributed Web Systems Peer-to-Peer Systems Lecturer Department University.
CS 268: Lecture 22 (Peer-to-Peer Networks)
Vocabulary Prototype: A preliminary sketch of an idea or model for something new. It’s the original drawing from which something real might be built or.
CHAPTER 3 Architectures for Distributed Systems
Vocabulary Prototype: A preliminary sketch of an idea or model for something new. It’s the original drawing from which something real might be built or.
EE 122: Peer-to-Peer (P2P) Networks
CS 268: Peer-to-Peer Networks and Distributed Hash Tables
Presentation by Theodore Mao CS294-4: Peer-to-peer Systems
Unstructured Routing : Gnutella and Freenet
Freenet.
Presentation transcript:

Freenet File sharing for a political world

Freenet: A Distributed Anonymous Information Storage and Retrieval System I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong

Reasons for development “The importance of the Free flow of information” Censorship by governments Restrictions due to copyright enforcement Napster lawsuits

Freenet Philosophy Communication is what makes us human Knowledge is good Democracy assumes a well informed population Censorship and freedom cannot coexist Anonymity is necessary to defeat censorship

Design Goals Anonymity for both producers and consumers of information Deniability for storers of information Resistance to attempts by 3 rd parties to deny particular information Efficient dynamic storage and routing Decentralization of all network features

Freenet as a layer 3/4 system Freenet is a network layer system that sits on top of TCP It does not provide any applications File-sharing, chatting, ing, and web- browsing have been built on top Routing similar to IP using RIP Unlike IP, all data sent must be stored on Freenet: no non-persistent transfers

The key idea Freenet files are stored and located by keys The keys are usually hashes of the files they represent (160-bit SHA1) called CHK Keys can be KSK which are stored and retrieved based on a text string Third type of key SSK, similar to a website. Key that is generated from combining a subspace hash with a text description.

Examples of three type of keys /TFE//thelist.html I,OejC1NKzRVt1GkRpcW0f4Q (06 Amerika - America.mp3) of-war

How a file is retrieved Obtain or calculate the binary key Check local datastore for key Send data-request to neighboring nodes Receive either data-reply or request-failed messages Message propagates as long as hops-to-live is positive

Middle nodes for a transfer Nodes not originally requesting or replying for a data transfer are middles nodes Middle nodes have routing tables that know where a specific hash-prefix might be found If the table entry returns not found, then try other connected nodes Similar to DNS recursive method, but willing to try other possibilities as well

Diagram of file transfer Strt End 1

Diagram of file transfer Strt End 1 2

Diagram of file transfer Strt End 1 2 3

Diagram of file transfer Strt End

Diagram of file transfer Strt End

Diagram of file transfer Strt End

Diagram of file transfer Strt End

Diagram of file transfer Strt End

Diagram of file transfer Strt End

Diagram of file transfer Strt End

Diagram of file transfer Strt End

Diagram of file transfer Strt End

Diagram of file transfer Strt End New Route Created

Failed file transfer Time to report this error message: ~ 5 minutes

Successful file transfer Time to report this page: ~ 2 minutes

Storing data The first step is to attempt the retrieval of the key to be stored When the retrieve fails (it should), the data is sent along the retrieval path up to a certain HTL and inserted into every node’s datastore Nodes along this path can decide randomly to claim ownership of the new data to maintain anonymity

Adding a new node A node must have the address of one other node to join Then generates a random seed for itself Contacts neighbor and announces itself Neighbor contacts all neighbors with the announcement, etc. Some form of cryptography verifies that nodes do not modify announcement

Managing data Clearly a node’s data store is finite Uses LRU cache policy to decide when to delete keys Keys never requested eventually disappear from Freenet entirely Keys frequently requested are stored in many nodes to provide redundancy

Performance Freenet is not designed to be efficient The number of hops to frequent data is designed to decrease over time Designed to scale to millions of nodes Large amount of interconnectivity allows failure of many nodes Possible denial of service attacks

Current Implementation Freenet engine and web-proxy are written in java and bundled for Windows and UNIX Large CPU usage, engine needs almost 100 threads, 50+ TCP connections to work well Applications add significant CPU and threads These restrictions cause most Freenet users to not be online very often

What is available on Freenet? Copyrighted music, movies, software Underage pornography Plans for and accounts of federal crimes Anti-government writings Anything else that is illegal in any country A few mirrors of legal data

Conclusion Freenet is an excellent way to store data while remaining anonymous Significant work has been done to have fault- tolerance, intelligent routing Efficiency is not a top priority The system could be usable today, yet too many transient nodes