Peer-to-Peer Information Systems Week 7: Anonymity Part 2

Slides:



Advertisements
Similar presentations
Modelling and Analysing of Security Protocol: Lecture 10 Anonymity: Systems.
Advertisements

Building a Peer-to-Peer Anonymizing Network Layer Michael J. Freedman NYU Dept of Computer Science Public Design Workshop September 13,
Internet Networking Spring 2006 Tutorial 12 Web Caching Protocols ICP, CARP.
Crowds: Anonymity for Web Transactions Paper by: Michael K. Reiter and Aviel D. Rubin, Presented by Eric M. Busse Portions excerpt from Crowds: Anonymity.
Security Awareness: Applying Practical Security in Your World
Responder Anonymity and Anonymous Peer-to-Peer File Sharing. by Vincent Scarlata, Brian Levine and Clay Shields Presentation by Saravanan.
Privacy on the Web Gertzman Lora Krakov Lena. Why privacy? Privacy is the number one consumer issue facing the internet. An eavesdropper (server, service.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #13 Web Caching Protocols ICP, CARP.
Freenet: A Distributed Anonymous Information Storage and Retrieval System Presenter: Chris Grier ECE 598nb Spring 2006.
Protecting Internet Communications: Encryption  Encryption: Process of transforming plain text or data into cipher text that cannot be read by anyone.
Crowds: Anonymity for Web Transactions Michael K. Reiter Aviel D. Rubin Jan 31, 2006Presented by – Munawar Hafiz.
Anonymity – Crowds R. Newman. Topics Defining anonymity Need for anonymity Defining privacy Threats to anonymity and privacy Mechanisms to provide anonymity.
Lecture 14: Anonymity on the Web (cont) Modified from Levente Buttyan, Michael K. Reiter and Aviel D. Rubin.
Anonymity on Web Transaction Department of Computer Science Ball State University Research Methods - CS 689 Uday Adhikari 7 th Dec
Computer Networking P2P. Why P2P? Scaling: system scales with number of clients, by definition Eliminate centralization: Eliminate single point.
Ways to reduce the risks of Crowds and further study of web anonymity By: Manasi N Pradhan.
Peer-to-Peer Information Systems Week 8: Anonymity Old Dominion University Department of Computer Science CS 695 Fall 2004 Michael L. Nelson 10/19/04.
Peer-to-Peer Information Systems Week 13: Trust Old Dominion University Department of Computer Science CS 495/595 Fall 2003 Michael L. Nelson 11/17/03.
1 Anonymity. 2 Overview  What is anonymity?  Why should anyone care about anonymity?  Relationship with security and in particular identification 
Peer-to-Peer Information Systems Week 12: Naming
Network Security Presented by: JAISURYA BANERJEA MBA, 2ND Semester.
Anonymous Communication
Digital Forensics 2 Presented by : J.Silaa Lecture: FCI 30 Aug 2017
CHAPTER 3 Architectures for Distributed Systems
Understanding the OSI Reference Model
Modified from Levente Buttyan, Michael K. Reiter and Aviel D. Rubin
Internet Networking recitation #12
Safety in Numbers: Crowds
Web Programming Assignment #1: Basic BBS Operations
An Introduction to Privacy and Anonymous Communication
Presentation by Theodore Mao CS294-4: Peer-to-peer Systems
Introduction to Digital Libraries Assignment #3
Improving Performance in the Gnutella Protocol
Anonymous Communication
Peer-to-Peer Information Systems Week 6: Performance
Web Server Design Week 13 Old Dominion University
Web Server Design Assignment #2: Conditionals & Persistence
Web Programming Assignment #2: Expanded BBS Features
Web Server Design Week 13 Old Dominion University
Web Programming Assignment #2: Expanded BBS Features
Web Server Design Week 13 Old Dominion University
Peer-to-Peer Information Systems Week 6: Assignment #4
Introduction to Information Retrieval Assignment #3
Introduction to Digital Libraries Assignment #3
Peer-to-Peer Information Systems Week 14: Assignment #6
Product released! Software Released! Now what?.
Web Server Design Week 11 Old Dominion University
BGP Instability Jennifer Rexford
Web Programming Assignment 4 - Extra Credit
Web Programming Assignment 4 - Extra Credit
Peer-to-Peer Information Systems Assignment #3
Peer-to-Peer Information Systems Week 6: Assignment #4
Introduction to Digital Libraries Assignment #2
Web Programming Assignment #1: Basic BBS Operations
Peer-to-Peer Information Systems Week 6: Assignment #3
Introduction to Digital Libraries Assignment #3
Introduction to Digital Libraries Assignment #3
Peer-to-Peer Information Systems Week 12: Naming
Peer-to-Peer Information Systems Assignment #2
Web Server Design Assignment #5 Extra Credit
Peer-to-Peer Information Systems Assignment #6
Web Programming Assignment #1: Basic BBS Operations
Introduction to Digital Libraries Assignment #1
Peer-to-Peer Information Systems Assignment #5
Peer-to-Peer Information Systems Week 12: Assignment #5
Anonymous Communication
Introduction to Digital Libraries Assignment #4
Introduction to Digital Libraries Assignment #2
Web Programming Assignment #3: Admin and User Functions
Chapter 12: Software Support and Maintenance
Presentation transcript:

Peer-to-Peer Information Systems Week 7: Anonymity Part 2 Old Dominion University Department of Computer Science CS 495/595 Fall 2003 Michael L. Nelson <mln@cs.odu.edu> 10/09/03

Crowds Provides anonymous http transactions CACM: http://doi.acm.org/10.1145/293411.293778 ACM TISSEC: http://doi.acm.org/10.1145/290163.290168 Lighter-weight approach than Onion Routing: http://www.onion-router.net  http://doi.acm.org/10.1145/293411.293443

“John Doe” each computer installs a proxy service on their machine proxy runs as “jondo” on initial use, the jondo process randomly chooses another jondo running on another machine pf > 0.50 a system tunable parameter, biased in favor of forwarding eventually, one of the jondo’s will choose to retrieve the object

jondo Maintenance Once a path is set in the original request: the reply is returned along the same path the same path is used for all future requests Each jondon keeps track of jondon-1 and jondon+1 from figure 1, there appears to be 2 different path states stored, even though both will appear the same in traffic analysis: local request recvd request

Paths in a Crowd Figure 1 from CACM, 42(2), Feb 1999

jondo Selection & Communication When a new jondo starts, it contacts a “blender” blender knows the location of all jondos and generates and distributes the keys jondo-jondo communication Communication between jondon and jondon+1 is encrypted with the keys from the blender new paths are recomputed when a new jondo joins this prevents being able to isolate the new path

Anonymity Spectrum Figure 2 & Table 1 from CACM, 42(2), Feb 1999

Limitations Contents are not protected in jondo communication e.g. - not suitable for passing credit card numbers! authors’ recommendation: turn off the proxy for these situations The retrieving jondo’s IP addr is not protected that jondo does have plausible deniability Mobile code still a risk for sender anonymity Retrieval time increases

Potentially More Serious Limitations Encryption distribution limitations Vendors blocking anonymous purchases stolen CC #’s Banning crowds software

Possible Improvements? Remove blender, use multicast to announce new jondos and their public keys? is multicast “good enough”? Periodically re-route requests? e.g., every hour totally re-compute the crowd paths? add new jondos then? Randomly generate noise traffic? on “false” paths even?