CMSC 414 Computer and Network Security Lecture 21 Jonathan Katz.

Slides:



Advertisements
Similar presentations
Mobile IP Outline Intro to mobile IP Operation Problems with mobility.
Advertisements

CMSC 414 Computer (and Network) Security Lecture 22 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 26 Jonathan Katz.
Modelling and Analysing of Security Protocol: Lecture 10 Anonymity: Systems.
How Much Anonymity does Network Latency Leak? Paper by: Nicholas Hopper, Eugene Vasserman, Eric Chan-Tin Presented by: Dan Czerniewski October 3, 2011.
CMSC 414 Computer (and Network) Security Lecture 26 Jonathan Katz.
CSCE 715 Ankur Jain 11/16/2010. Introduction Design Goals Framework SDT Protocol Achievements of Goals Overhead of SDT Conclusion.
Secure Shell – SSH Tam Ngo Steve Licking cs265. Overview Introduction Brief History and Background of SSH Differences between SSH-1 and SSH- 2 Brief Overview.
Building a Peer-to-Peer Anonymizing Network Layer Michael J. Freedman NYU Dept of Computer Science Public Design Workshop September 13,
1 Modeling and Analysis of Anonymous-Communication Systems Joan Feigenbaum WITS’08; Princeton NJ; June 18, 2008 Acknowledgement:
CMSC 414 Computer and Network Security Lecture 21 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 6 Jonathan Katz.
CMSC 414 Computer (and Network) Security Lecture 21 Jonathan Katz.
Confidentiality using Symmetric Encryption traditionally symmetric encryption is used to provide message confidentiality consider typical scenario –workstations.
CMSC 414 Computer and Network Security Lecture 19 Jonathan Katz.
CMSC 414 Computer (and Network) Security Lecture 16 Jonathan Katz.
The Case for Network-Layer, Peer-to-Peer Anonymization Michael J. Freedman Emil Sit, Josh Cates, Robert Morris MIT Lab for Computer Science IPTPS’02March.
Responder Anonymity and Anonymous Peer-to-Peer File Sharing. by Vincent Scarlata, Brian Levine and Clay Shields Presentation by Saravanan.
CMSC 414 Computer and Network Security Lecture 2 Jonathan Katz.
Analysis of Onion Routing Presented in by Jayanthkumar Kannan On 10/8/03.
CMSC 414 Computer and Network Security Lecture 16 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 19 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 18 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 26 Jonathan Katz.
CMSC 414 Computer and Network Security Lecture 23 Jonathan Katz.
Tarzan: A Peer-to-Peer Anonymizing Network Layer Michael J. Freedman, NYU Robert Morris, MIT ACM CCS 2002
CS335 Networking & Network Administration Tuesday, April 20, 2010.
CMSC 414 Computer and Network Security Lecture 22 Jonathan Katz.
CMSC 414 Computer (and Network) Security Lecture 25 Jonathan Katz.
Anonymity on the Web: A Brief Overview By: Nipun Arora uni-na2271.
0x1A Great Papers in Computer Security Vitaly Shmatikov CS 380S
Anonymizing Network Technologies Some slides modified from Dingledine, Mathewson, Syverson, Xinwen Fu, and Yinglin Sun Presenter: Chris Zachor 03/23/2011.
Towards an Analysis of Onion Routing Security Syverson, Tsudik, Reed, and Landwehr PET 2000 Presented by: Adam Lee 1/26/2006 Syverson, Tsudik, Reed, and.
Preventing Active Timing Attacks in Low- Latency Anonymous Communication The 10 th Privacy Enhancing Technologies Symposium July 2010 Joan Feigenbaum Yale.
Tor (Anonymity Network) Scott Pardue. Tor Network  Nodes with routers within the network (entry, middle, exit)  Directory servers  Socket Secure (SOCKS)
Network Redundancy Multiple paths may exist between systems. Redundancy is not a requirement of a packet switching network. Redundancy was part of the.
A Tale of Research: From Crowds to Deeper Understandings Matthew Wright Jan. 25, : Adv. Network Security.
CSE 486/586, Spring 2012 CSE 486/586 Distributed Systems Case Study: TOR Anonymity Network Bahadir Ismail Aydin Computer Sciences and Engineering University.
Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms David Chaum CACM Vol. 24 No. 2 February 1981 Presented by: Adam Lee 1/24/2006 David.
An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks Authors: A. Boukerche, K. El-Khatib, L. Xu, L. Korba.
1 Lecture 14: Real-Time Communication Security real-time communication – two parties interact in real time (as opposed to delayed communication like )
 Network Segments  NICs  Repeaters  Hubs  Bridges  Switches  Routers and Brouters  Gateways 2.
Network Security Lecture 20 Presented by: Dr. Munam Ali Shah.
CMSC 414 Computer and Network Security Lecture 5 Jonathan Katz.
Chapter 15 – Part 2 Networks The Internal Operating System The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.
R. Newman Anonymity - Background. Defining anonymity Defining anonymity Need for anonymity Need for anonymity Defining privacy Defining privacy Threats.
Class 8 Introduction to Anonymity CIS 755: Advanced Computer Security Spring 2015 Eugene Vasserman
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.
OSI Model. Switches point to point bridges two types store & forward = entire frame received the decision made, and can handle frames with errors cut-through.
Mobile IP Outline Intro to mobile IP Operation Problems with mobility.
Anonymity - Background R. Newman. Topics Defining anonymity Need for anonymity Defining privacy Threats to anonymity and privacy Mechanisms to provide.
CSE 592 INTERNET CENSORSHIP (FALL 2015) LECTURE 22 PHILLIPA GILL - STONY BROOK U.
IPSec and TLS Lesson Introduction ●IPSec and the Internet key exchange protocol ●Transport layer security protocol.
Onion Routing R. Newman. Topics Defining anonymity Need for anonymity Defining privacy Threats to anonymity and privacy Mechanisms to provide anonymity.
Supplemental Information on TOR (The Onion Router) CEH ed 8, Rev 4 CS3695 – Network Vulnerability Assessment & Risk Mitigation–
CMSC 414 Computer and Network Security Lecture 20 Jonathan Katz.
Modified Onion Routing GYANRANJAN HAZARIKA AND KARAN MIRANI.
Networking Components Quick Guide. Hubs Device that splits a network connection into multiple computers Data is transmitted to all devices attached Computers.
1 Anonymous Communications CSE 5473: Network Security Lecture due to Prof. Dong Xuan Some material from Prof. Joan Feigenbaum.
K. Salah1 Security Protocols in the Internet IPSec.
1 Anonymity. 2 Overview  What is anonymity?  Why should anyone care about anonymity?  Relationship with security and in particular identification 
Modified Onion Routing GYANRANJAN HAZARIKA AND KARAN MIRANI.
CMSC 414 Computer and Network Security Lecture 2 Jonathan Katz.
Onions and Garlic: the protocols of I2P
CS590B/690B Detecting Network Interference (Fall 2016)
Anonymous Communication
0x1A Great Papers in Computer Security
Anonymous Communication
Anonymous Communication
Anonymous Communication
Presentation transcript:

CMSC 414 Computer and Network Security Lecture 21 Jonathan Katz

Administrative items  Midterm next week –Based on everything from last midterm through today  Discussion of HW2…

Anonymous communication

Anonymizers  Single anonymizer proxy…  How to achieve bidirectional communication –Note: one side need not know the other  Anonymizers already exist! – –http

Anonymizers  Issues/drawbacks? –Robustness –Useful for hiding the source from the destination; less useful for preventing full-fledged traffic analysis… Unless encryption is used, which it typically would not be  Possible attacks –Latency vs. timing correlation 0-latency solution using spurious messages? –One user sending multiple messages to the same server –Message sizes –Replay attacks

Onion routing  Use multiple servers…  Send “onions”; strip off a layer at each hop –Only the initiator knows the entire route!  Bidirectional communication? –Routing tables –Reply onions (pre-compute keying material)  Security issues? –Payload sizes? (Use random padding) –Forward secrecy –Is it suspicious to contact an onion router?

Peer-to-peer anonymizers  Every node can act as an onion router!  Why does this improve anonymity?

Tor  All nodes also act as proxies  Negotiate pairwise keys between links –Forward secrecy  Routes maintained for ~10 minutes, then refreshed  Even the initiator does not know the path

Mix Nets  Useful as a tool within specific protocols –Primarily voting  Each mix-net server receives a set of encrypted votes, “randomizes” and permutes them, and forwards then along to the next server –How to prove correctness?

Covert channels  Anonymous communication is also possible using covert channels –May not even leak the fact that communication is happening at all! –May be a route for communication that is disallowed  Examples –Sending a print job –TCP timestamps/sequence numbers –Timeslicing

Steganography  E.g., embed messages into low-order bits of images  More securely, use rejection sampling on any source

Kleptography  Embed a covert channel (into crypto software/hardware) that leaks the secret key!  Known to be possible for standard crypto algorithms…