Anonymous Communication -- a brief survey

Slides:



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

Computer Science 1 CSC 774 Advanced Network Security Enhancing Source-Location Privacy in Sensor Network Routing (ICDCS ’05) Brian Rogers Nov. 21, 2005.
Enhancing Source-Location Privacy in Sensor Network Routing P.Kamat, Y. Zhang, W. Trappe, C. Ozturk In Proceedings of the 25th IEEE International Conference.
Source-Location Privacy Protection in Wireless Sensor Network Presented by: Yufei Xu Xin Wu Da Teng.
Defending Against Traffic Analysis Attacks in Wireless Sensor Networks Security Team
Security and Privacy Issues in Wireless Communication By: Michael Glus, MSEE EEL
How Much Anonymity does Network Latency Leak? Paper by: Nicholas Hopper, Eugene Vasserman, Eric Chan-Tin Presented by: Dan Czerniewski October 3, 2011.
Reusable Anonymous Return Channels
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Dynamic Anonymity Emin İslam Tatlı, Dirk Stegemann, Stefan Lucks University of Mannheim, Germany.
Network Layer and Transport Layer.
Edith C. H. Ngai1, Jiangchuan Liu2, and Michael R. Lyu1
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
CSCE 715 Ankur Jain 11/16/2010. Introduction Design Goals Framework SDT Protocol Achievements of Goals Overhead of SDT Conclusion.
Building a Peer-to-Peer Anonymizing Network Layer Michael J. Freedman NYU Dept of Computer Science Public Design Workshop September 13,
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
Explorations in Anonymous Communication Andrew Bortz with Luis von Ahn Nick Hopper Aladdin Center, Carnegie Mellon University, 8/19/2003.
Crowds: Anonymity for Web Transactions Paper by: Michael K. Reiter and Aviel D. Rubin, Presented by Eric M. Busse Portions excerpt from Crowds: Anonymity.
Xinwen Fu Anonymous Communication & Computer Forensics Computer & Network Forensics.
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.
Analysis of Onion Routing Presented in by Jayanthkumar Kannan On 10/8/03.
Modelling and Analysing of Security Protocol: Lecture 9 Anonymous Protocols: Theory.
Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
Freenet A Distributed Anonymous Information Storage and Retrieval System I Clarke O Sandberg I Clarke O Sandberg B WileyT W Hong.
Tarzan: A Peer-to-Peer Anonymizing Network Layer Michael J. Freedman, NYU Robert Morris, MIT ACM CCS 2002
Learning Routing Paths in Anonymous Wireless Protocols Yu Jin Nishith Pathak.
1 Chapter 13: Representing Identity What is identity Different contexts, environments Pseudonymity and anonymity.
Anonymous Communication Luis von Ahn Andrew Bortz Nick Hopper The Aladdin Center Carnegie Mellon University.
K-Anonymous Message Transmission Luis von Ahn Andrew Bortz Nick Hopper The Aladdin Center Carnegie Mellon University.
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
Class 13 Introduction to Anonymity CIS 755: Advanced Computer Security Spring 2014 Eugene Vasserman
Toward Prevention of Traffic Analysis Fengfeng Tu 11/26/01.
On the Anonymity of Anonymity Systems Andrei Serjantov (anonymous)
Mobile IP: Introduction Reference: “Mobile networking through Mobile IP”; Perkins, C.E.; IEEE Internet Computing, Volume: 2 Issue: 1, Jan.- Feb. 1998;
CSCI 5234 Web Security1 Privacy & Anonymity in the WWW Ch. 12, Oppliger.
Communications and Networks Chapter 8. 2 Introduction We live in a truly connected society. Increased connectivity potentially means increased productivity,
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.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks Authors: A. Boukerche, K. El-Khatib, L. Xu, L. Korba.
Denial of Service (DoS) Attacks in Green Mobile Ad–hoc Networks Ashok M.Kanthe*, Dina Simunic**and Marijan Djurek*** MIPRO 2012, May 21-25,2012, Opatija,
Anonymity on the Internet Presented by Randy Unger.
Mobile Traffic Sensor Network versus Motion-MIX: Tracing and Protecting Mobile Wireless Nodes JieJun Kong Dapeng Wu Xiaoyan Hong and Mario Gerla.
Crowds: Anonymity for Web Transactions Michael K. Reiter Aviel D. Rubin Jan 31, 2006Presented by – Munawar Hafiz.
Lecture 14: Anonymity on the Web (cont) Modified from Levente Buttyan, Michael K. Reiter and Aviel D. Rubin.
Network Security Lecture 20 Presented by: Dr. Munam Ali Shah.
Fast Handoff for Seamless wireless mesh Networks Yair Amir, Clauiu Danilov, Michael Hilsdale Mobisys’ Jeon, Seung-woo.
Survey on Privacy-Related Technologies Presented by Richard Lin Zhou.
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
Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.
Lecture 13: Anonymity on the Web Modified from Levente Buttyan, Michael K. Reiter and Aviel D. Rubin.
Anonymity - Background R. Newman. Topics Defining anonymity Need for anonymity Defining privacy Threats to anonymity and privacy Mechanisms to provide.
1 Privacy Aware Incentive Mechanism to Collect Mobile Data While Preventing Duplication Junggab Son*, Donghyun Kim*, Rasheed Hussain**, Sung-Sik Kwon*,
Effects of adding Arbitrary Physical Nodes to a Mobile Ad-Hoc Network Utilizing an Anonymity System By Ian Cavitt.
Ways to reduce the risks of Crowds and further study of web anonymity By: Manasi N Pradhan.
Anonymous Health Information Exchange (HIE) Transfer with Credibility Check against Fraud through Chaum Mixes and Crowds. By: Aaron Silcott.
Modified Onion Routing GYANRANJAN HAZARIKA AND KARAN MIRANI.
1 Anonymous Communications CSE 5473: Network Security Lecture due to Prof. Dong Xuan Some material from Prof. Joan Feigenbaum.
1 Anonymity. 2 Overview  What is anonymity?  Why should anyone care about anonymity?  Relationship with security and in particular identification 
Introduction Wireless devices offering IP connectivity
Anonymous Communication
Digital Forensics 2 Presented by : J.Silaa Lecture: FCI 30 Aug 2017
An Introduction to Privacy and Anonymous Communication
0x1A Great Papers in Computer Security
Anonymous Communication
Anonymous Communication
Presentation transcript:

Anonymous Communication -- a brief survey Pan Wang North Carolina State University

Outline Why anonymous communication Definitions of anonymities Traffic analysis attacks Some anonymous communication protocols for Internet Some anonymous communication schemes for MANET and sensor networks Potential research problems

Why Anonymous Communication Privacy issue Some covert missions may require anonymous communication In hostile environments, end-hosts may need hidden their communications to against being captured

Anonymity in terms of unlinkability* Sender anonymity A particular message is not linkable to any sender and that to a particular sender, no message is linkable Recipient anonymity A particular message cannot be linked to any recipient and that to a particular recipient, no message is linkable Relationship anonymity The sender and the recipient cannot be identified as communicating with each other, even though each of them can be identified as participating in some communication. A. Pfizmann and M. Waidner, Networks without User Observability. Computers & Security 6/2 (1987) 158-166

Traffic Analysis Attacks against an Anonymous Communication System Contextual attacks Communication pattern attacks Packet counting attacks Intersection attack Brute force attack Node flushing attack Timing attacks Massage tagging attack On flow marking attack

Some Anonymous Communication Protocols for Internet Mix-NET Feb 1981, D. Chaum Crowd June 1997, Michael K. Reiter and Aviel D. Rubin Tarzan Nov 2002, Michael J. Freedman and Robert Morris K-Anonymous Message Transmission Oct, 2003, Luis von Ahn, Andrew Bortz and Nicholas J. Hopper

Mix-NET* Basic idea: Traffic sent from sender to destination should pass one or more Mixes Mix relays data from different end-to-end connections, reorder and re-encrypt the data So, incoming and outgoing traffic cannot be related *D. Chaum, Untraceable Electric Mail, Return Address and Digital Pseudonyms, Communication of A.C.M 24.2 (Feb 1981), 84-88

Mix-NET (cont-1)

Mix-NET (cont-2) Trust one mix server: the entire Mix-NET provides anonymity

Crowds* P2P anonymizer network for Web Transactions Uses a trusted third party (TTP) as centralized crowd membership server (“blender”) Provides sender anonymity and relationship anonymity *M. Reiter and A. Rubin, Crowd: Anonymity for Web Transactions. ACM Transactions on Information and System Security, 1(1) June 1998

Crowd (cont) A nodes decide randomly whether to forward the request to another node or to send it to the server Webserver

Tarzan* All nodes act as relays, Mix-net encoding Each node selects a set of mimics Tunneling data traffic through mimics Exchanging cover traffic with mimics Constant packet sending rate and uniformed packet size Network address translator Anonymity against corrupt relays and global eavesdropping M. Freedman and R. Morris, Tarzan: A Peer-to-Peer Anonymizing Network Layer, CCS 2002, Washington DC

Tarzan (cont-1) User PNAT

Tunnel Private Address Tarzan (Cont-2) User Tunnel Private Address Public Alias Address Real IP PNAT

k-Anonymous Message Transmission* Based on secure multiparty sum protocol Local group broadcast The adversaries, trying to determine the sender/receiver of a particular message, cannot narrow down its search to a set of k suspects Robust against selective non-participations L.Ahn, A.Bortz and N.Hopper, k-Anonymous Message Transmission, CCS 2003, Washington DC

k-Anonymous Message Transmission (cont) Group-D Group-S

Some anonymous communication schemes for MANET and sensor networks Anonymous on demand routing (ANODR) Jun 2003, Jiejun Kong and Xiaoyan Hong Phantom flooding protocol Jun 2005, Pandurang Kamat, Yanyong Zhang, Wade Trappe and Celal Ozturk

ANODR* Assuming salient adversaries Broadcast with trapdoor Route pseudonym J.Kong and X.Hong, ANODR: Anonymous On Demand Routing with Untraceable for Mobile Ad-hoc Networks, MobiHoc, 2003, Annapolis, MD

ANODR (cont)

Source-Location Privacy in Sensor network Network model: A sensor reports its measurement to a centralized base station (sink) Attack model: Adversaries may use RF localization to hop-by-hop traceback to the source’s location Why location privacy

Phantom Flooding Protocol* Random work plus local broadcast P. Kamat, et. al., Enhancing Source-Location Privacy in Sensor Network Routing, ICDCS 2005, Columbus, OH

Potential Research Problems Anonymity vs accountability Detect malicious users Efficiency vs anonymity More?

Questions?