Mixminion: Design of a Type III Anonymous Remailer Protocol George Danezis Roger Dingledine Nick Mathewson Presented By Michael LeMay.

Slides:



Advertisements
Similar presentations
1 Security for Ad Hoc Network Routing. 2 Ad Hoc Networks Properties Mobile Wireless communication Medium to high bandwidth High variability of connection.
Advertisements

SPATor: Improving Tor Bridges with Single Packet Authorization Paper Presentation by Carlos Salazar.
Chris Karlof and David Wagner
Tor: The Second-Generation Onion Router
BASIC CRYPTOGRAPHY CONCEPT. Secure Socket Layer (SSL)  SSL was first used by Netscape.  To ensure security of data sent through HTTP, LDAP or POP3.
Modelling and Analysing of Security Protocol: Lecture 10 Anonymity: Systems.
Computer Science 1 CSC 774 Advanced Network Security Enhancing Source-Location Privacy in Sensor Network Routing (ICDCS ’05) Brian Rogers Nov. 21, 2005.
Security and Privacy Issues in Wireless Communication By: Michael Glus, MSEE EEL
Project in Computer Security Integrating TOR’s attacks into the I2P darknet Chen Avnery Amihay Vinter.
How Much Anonymity does Network Latency Leak? Paper by: Nicholas Hopper, Eugene Vasserman, Eric Chan-Tin Presented by: Dan Czerniewski October 3, 2011.
Message Splitting Against the Partial Adversary Andrei Serjantov The Free Haven Project (UK) Steven J Murdoch University of Cambridge Computer Laboratory.
Reusable Anonymous Return Channels
Forensic Dead-Ends: Tracing Anonymous R er Abusers Len Sassaman The Shmoo Group
CSCE 715 Ankur Jain 11/16/2010. Introduction Design Goals Framework SDT Protocol Achievements of Goals Overhead of SDT Conclusion.
K. Salah 1 Chapter 31 Security in the Internet. K. Salah 2 Figure 31.5 Position of TLS Transport Layer Security (TLS) was designed to provide security.
SUMP: A Secure Unicast Messaging Protocol for Wireless Ad Hoc Sensor Networks Jeff Janies, Chin-Tser Huang, Nathan L. Johnson.
CMSC 414 Computer (and Network) Security Lecture 16 Jonathan Katz.
Analysis of Onion Routing Presented in by Jayanthkumar Kannan On 10/8/03.
ITIS 6200/8200. time-stamping services Difficult to verify the creation date and accurate contents of a digital file Required properties of time-stamping.
Securing TCP/IP Chapter 6. Introduction to Transmission Control Protocol/Internet Protocol (TCP/IP) TCP/IP comprises a suite of four protocols The protocols.
Security in Wireless Sensor Networks Perrig, Stankovic, Wagner Jason Buckingham CSCI 7143: Secure Sensor Networks August 31, 2004.
1 Chapter 13: Representing Identity What is identity Different contexts, environments Pseudonymity and anonymity.
Network Security. Contents Security Requirements and Attacks Confidentiality with Conventional Encryption Message Authentication and Hash Functions Public-Key.
A distributed Search Service for Peer-to-Peer File Sharing in Mobile Applications From U. of Dortmund, Germany.
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.
Aaron Johnson U.S. Naval Research Laboratory CSci 6545 George Washington University 11/18/2013.
Toward Prevention of Traffic Analysis Fengfeng Tu 11/26/01.
On the Anonymity of Anonymity Systems Andrei Serjantov (anonymous)
Privacy and Anonymity CS432 - Security in Computing Copyright © 2005, 2006 by Scott Orr and the Trustees of Indiana University.
SSL and https for Secure Web Communication CSCI 5857: Encoding and Encryption.
Provable Unlinkability Against Traffic Analysis Amnon Ta-Shma Joint work with Ron Berman and Amos Fiat School of Computer Science, Tel-Aviv 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.
Anonymity on the Internet Presented by Randy Unger.
Connecting The Network Layer to Data Link Layer. ARP in the IP Layer The Address Resolution Protocol (ARP) The Address Resolution Protocol (ARP) Part.
Lecture 14 ISAKMP / IKE Internet Security Association and Key Management Protocol / Internet Key Exchange CIS CIS 5357 Network Security.
Crowds: Anonymity for Web Transactions Michael K. Reiter Aviel D. Rubin Jan 31, 2006Presented by – Munawar Hafiz.
Network Security Lecture 20 Presented by: Dr. Munam Ali Shah.
CSC 382: Computer SecuritySlide #1 CSC 382: Computer Security Identity.
R. Newman Anonymity - Background. Defining anonymity Defining anonymity Need for anonymity Need for anonymity Defining privacy Defining privacy Threats.
Network Security David Lazăr.
Class 8 Introduction to Anonymity CIS 755: Advanced Computer Security Spring 2015 Eugene Vasserman
The Second-Generation Onion Router
Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs Presented by Zhongming Zheng.
X.509 Topics PGP S/MIME Kerberos. Directory Authentication Framework X.509 is part of the ISO X.500 directory standard. used by S/MIME, SSL, IPSec, and.
Freenet “…an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity.
Security fundamentals Topic 5 Using a Public Key Infrastructure.
Anonymity - Background R. Newman. Topics Defining anonymity Need for anonymity Defining privacy Threats to anonymity and privacy Mechanisms to provide.
PGP & IP Security  Pretty Good Privacy – PGP Pretty Good Privacy  IP Security. IP Security.
IPSec and TLS Lesson Introduction ●IPSec and the Internet key exchange protocol ●Transport layer security protocol.
Ways to reduce the risks of Crowds and further study of web anonymity By: Manasi N Pradhan.
The Silk Road: An Online Marketplace
Onion Routing R. Newman. Topics Defining anonymity Need for anonymity Defining privacy Threats to anonymity and privacy Mechanisms to provide anonymity.
Mix networks with restricted routes PET 2003 Mix Networks with Restricted Routes George Danezis University of Cambridge Computer Laboratory Privacy Enhancing.
Firewalls A brief introduction to firewalls. What does a Firewall do? Firewalls are essential tools in managing and controlling network traffic Firewalls.
Modified Onion Routing GYANRANJAN HAZARIKA AND KARAN MIRANI.
ROGER DINGLEDINE, NICK MATHEWSON, PAUL SYVERSON THE FREE HAVEN PROJECT &NAVAL RESEARCH LAB PRESENTED BY: COREY WHITE Tor: The Second-Generation Onion Router.
1 Anonymous Communications CSE 5473: Network Security Lecture due to Prof. Dong Xuan Some material from Prof. Joan Feigenbaum.
@Yuan Xue CS 285 Network Security Secure Socket Layer Yuan Xue Fall 2013.
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.
SESSION HIJACKING It is a method of taking over a secure/unsecure Web user session by secretly obtaining the session ID and masquerading as an authorized.
Towards Measuring Anonymity
0x1A Great Papers in Computer Security
Free-route Mixes vs. Cascades
Anonymous Communications
Modeling Entropy in Onion Routing Networks
Presentation transcript:

Mixminion: Design of a Type III Anonymous R er Protocol George Danezis Roger Dingledine Nick Mathewson Presented By Michael LeMay

Introduction Direct descendant of previous generations: –Type I r er: Cypherpunk/Chaumian Mixes (previous presentation) –Type II r er: Mixmaster Doesn’t support anonymous replies Sender can select route Integrated message pool support Constant message size Replay attack prevention Smarter reordering Cover traffic (in theory) –Type III r er: Mixminion

Assumptions & Requirements Designed for high latency traffic ( , not web browsing) Prevent acquisition of any information not believed a priori by adversary Adversary capabilities: –Observe all traffic –Generate, modify, delay, or delete traffic –Operate mixes and compromise other mixes Adversary wishes: –Identify sender or recipient of particular message –Trace a sender forward (or recipient backward) to its messages

Further Objectives Hide number of hops [1-32] from intermediaries Hide position in network from intermediaries Be simple to deploy Only require forward senders to install extra software –Provide gateways to reply to anonymous senders Provide good anonymity for intermittently connected users (dial-up, etc.) Provide no backward compatibility except encapsulation of Type II traffic

Single-Use Reply Blocks Nym-linkage attack possible in simple scheme: Hi, I’m Bob. Hi, I’m Charlie. Good to hear from you, Charlie. Likewise. – Charlie Bob = Charlie

Single-Use Reply Blocks (cont.) Unique seed prevents nym-linkage: Hi, I’m Bob. Hi, I’m Charlie. Good to hear from you, Charlie. She’s onto me

Crossover Routing Route broken into two “legs,” with a header for each Second header encrypted HdrA HdrB

Variable Anonymity Various anonymity levels for different messages: Sender Onion Sender Onion Random Data Single-Use Reply Block Single-Use Reply Block Sender Onion ForwardDirect Reply Anonymized Reply SndAnonymousNon-anon.Anonymous RcvNon-anon.Anonymous

Path Selection Conventional wisdom says senders should choose many different paths through mixes to enhance anonymity If any entire path compromised, anonymity compromised as well If single path is used, passive adversary sees flood of traffic Best approach: use small number of paths and spread out transmissions

Tagging Attacks Allows tracking of individual messages: Msg

Tagging Prevention Routing potentially separated into two phases After first header is processed, second header is decrypted and substituted for first Decryption key derived from hash of payload If payload tagged, decryption fails and message rendered non-routable

Multiple-message Tagging Adversary can operate crossover point to track streams of messages, some of which are tagged Adversary confirms that tagged messages are dropped, and then re-tags other messages and observes their routes. Can be prevented by choosing multiple crossover points, to decrease probability that adversary owns them all.

Link Construction Older r ers used SMTP transports Uses TLS tunnels with ephemeral keys Provides forward anonymity for messages Heartbeat signal could be used to prevent malicious delays Traffic analysis still possible This violates fundamental principle, infrastructure reuse, is it worth it?

Key Rotation Mixes rotate public keys to prevent replay attacks –Chaum suggested timestamps, but this allows message tracking via delays –Mixmaster caches recent message IDs, but must expire them after awhile Cache message IDs for current key Around key transition, adversary can partition senders by their knowledge of new key

Trickle Attack Directories provide information about available mixes: M N P A B Old Directory Includes M New Directory Excludes M Only Alice would still be using M…

Timed Dynamic-pool Batching Messages batched and delayed for fixed period, or until enough messages arrive Only delivers constant proportion of batch each time, randomly composed Difficult to fill buffer and deterministically flush out particular message

Dummy Traffic Dummy traffic core component of other anonymity protocols, but is actually not well understood Dummy traffic only used between mixes, to make it more difficult to track flushed messages

Exit Policies & Abuse Unsolved problem –Opt-in and opt-out requests can both be forged, causing harassment or DoS, resp. –Number of exit nodes and potential for abuse directly related –Number of exit nodes and maximum degree of anonymity directly related Compromise –Each message includes secret allowing opt-out Should recipients opt-in to receive anonymous messages?

Delivery Methods Configurable: –Type II r er –SMTP –Local mailbox Capabilities indicated in directory Individual sender preference for particular method may allow adversary to defeat anonymity (partitioning attack) Active attackers can advertise rare and valuable delivery option on compromised node Should exit nodes provide single option instead?

Nym Management Fresh single-use reply block required for each message sent to nym Two main management strategies: –Nym owner supplies plenty of SURBs a priori, and nymserver forwards messages immediately –Nym owner connects to nymserver periodically and supplies batches of SURBs until all queued messages have been forwarded Mail may be encrypted using nym-owner’s public key, to reduce impact of server compromise