CSE 592 INTERNET CENSORSHIP (FALL 2015) LECTURE 19 PHILLIPA GILL - STONY BROOK U.

Slides:



Advertisements
Similar presentations
Tor: The Second-Generation Onion Router
Advertisements

1 Dissent: Accountable, Anonymous Communication Joan Feigenbaum Joint work with Bryan Ford, Henry Corrigan-Gibbs, Yixuan.
CSE 461 Section. “Transport Layer Security” protocol Standard protocol for encrypting Internet traffic Previously known as SSL (Secure Sockets Layer),
Modelling and Analysing of Security Protocol: Lecture 10 Anonymity: Systems.
The Dining Cryptographer Problem Security Presentation Nitesh Patel 2005h425.
The Sniper Attack: Anonymously Deanonymizing and Disabling the Tor Network Rob Jansen et. al NDSS 2014 Presenter: Yue Li Part of slides adapted from R.
Predicting Tor Path Compromise by Exit Port IEEE WIDA 2009December 16, 2009 Kevin Bauer, Dirk Grunwald, and Douglas Sicker University of Colorado Client.
Lecture 9 Page 1 CS 236 Online Denial of Service Attacks that prevent legitimate users from doing their work By flooding the network Or corrupting routing.
Rumor Riding, IEEE ICNP2006, Jinsong Han & Yunhao Liu, HKUST, Nov 12 1 Rumor Riding Anonymizing Unstructured Peer- to-Peer System Jinsong Han and Yunhao.
How Much Anonymity does Network Latency Leak? Paper by: Nicholas Hopper, Eugene Vasserman, Eric Chan-Tin Presented by: Dan Czerniewski October 3, 2011.
Towards efficient traffic-analysis resistant anonymity networks Stevens Le Blond David Choffnes Wenxuan Zhou Peter Druschel Hitesh Ballani Paul Francis.
Hang with Your Buddies to Resist Intersection Attacks David Wolinsky, Ewa Syta, Bryan Ford Yale University.
On Traffic Analysis in Tor Guest Lecture, ELE 574 Communications Security and Privacy Princeton University April 3 rd, 2014 Dr. Rob Jansen U.S. Naval Research.
Building a Peer-to-Peer Anonymizing Network Layer Michael J. Freedman NYU Dept of Computer Science Public Design Workshop September 13,
Criticisms of I3 Zhichun Li. General Issues Functionality Security Performance Practicality If not significant better than existing schemes, why bother?
PSMC Proxy Server-based Multipath Connection CS 526 Advanced Networking - Richard White.
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.
CMSC 414 Computer and Network Security Lecture 21 Jonathan Katz.
Pseudo Trust: Zero-Knowledge Based Authentication in Anonymous Peer-to-Peer Protocols Li Lu, Lei Hu State Key Lab of Information Security, Graduate School.
Modelling and Analysing of Security Protocol: Lecture 9 Anonymous Protocols: Theory.
Security in Wireless Sensor Networks Perrig, Stankovic, Wagner Jason Buckingham CSCI 7143: Secure Sensor Networks August 31, 2004.
Anonymous Communication 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.
Aaron Johnson U.S. Naval Research Laboratory CSci 6545 George Washington University 11/18/2013.
Class 13 Introduction to Anonymity CIS 755: Advanced Computer Security Spring 2014 Eugene Vasserman
On the Anonymity of Anonymity Systems Andrei Serjantov (anonymous)
A Tale of Research: From Crowds to Deeper Understandings Matthew Wright Jan. 25, : Adv. Network Security.
Privacy and Anonymity CS432 - Security in Computing Copyright © 2005, 2006 by Scott Orr and the Trustees of Indiana University.
Privacy-Preserving P2P Data Sharing with OneSwarm -Piggy.
Ryan Lackey Dynamic Locations: Secure Mobile Services Discovery and Dynamic Group Membership Ryan Lackey
Privacy Enhancing Technologies Spring What is Privacy? “The right to be let alone” Confidentiality Anonymity Access Control Most privacy technologies.
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.
Privacy in Content Oriented Networking: Threats and countermeasures Abdelberi Chaabane, Emiliano De Cristofaro, Mohamed Ali Kaafar, and Ersin Uzun.
Class 8 Introduction to Anonymity CIS 755: Advanced Computer Security Spring 2015 Eugene Vasserman
Securing Distributed Sensor Networks Udayan Kumar Subhajit Sengupta Sharad Sonapeer.
Ahmed Osama Research Assistant. Presentation Outline Winc- Nile University- Privacy Preserving Over Network Coding 2  Introduction  Network coding 
Class 16 Deniable Authentication CIS 755: Advanced Computer Security Spring 2014 Eugene Vasserman
Networking Fundamentals. Basics Network – collection of nodes and links that cooperate for communication Nodes – computer systems –Internal (routers,
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
CSE 592 INTERNET CENSORSHIP (FALL 2015) LECTURE 20 PHILLIPA GILL - STONY BROOK U.
CSE 592 INTERNET CENSORSHIP (FALL 2015) LECTURE 22 PHILLIPA GILL - STONY BROOK U.
Wireless Security Rick Anderson Pat Demko. Wireless Medium Open medium Broadcast in every direction Anyone within range can listen in No Privacy Weak.
CS 6204, Spring 2005 Dining Cryptographers, Glenn Fink1 Dining Cryptographers Paper by David Chaum (1988) Presentation by Glenn Fink.
CSE 592 INTERNET CENSORSHIP (FALL 2015) LECTURE 16 PHILLIPA GILL - STONY BROOK U.
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
Traffic Correlation in Tor Source and Destination Prediction PETER BYERLEY RINDAL SULTAN ALANAZI HAFED ALGHAMDI.
CMSC 414 Computer and Network Security Lecture 20 Jonathan Katz.
Effects of Adding Arbitrary Physical Nodes(APNs) to a Mobile Ad-Hoc Network (MANET)Utilizing a Anonymous Routing Protocol.
TRUST Self-Organizing Systems Emin G ü n Sirer, Cornell University.
@Yuan Xue CS 285 Network Security Fall 2012 Yuan Xue.
11 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
NETWORK SECURITY HERD: A SCALABLE, TRAFFIC ANALYSIS RESISTANT ANONYMITY NETWORK FOR VOIP SYSTEMS JINGTAO YAO JIAJUN LI ACM HORNORED CLASS.
1Security for Service Providers – Dave Gladwin – Newport Networks – SIP ’04 – 22-Jan-04 Security for Service Providers Protecting Service Infrastructure.
Aaron Johnson Rob Jansen Aaron D. Jaggard Joan Feigenbaum
CS590B/690B Detecting Network Interference
CS590B/690B Detecting Network Interference (FALL 2016)
CS590B/690B Detecting Network Interference (Fall 2016)
I know what you are Sharing
Outline Basics of network security Definitions Sample attacks
Anonymous Communication
Protocols for Anonymous Communication
Plethora: Infrastructure and System Design
An Introduction to Privacy and Anonymous Communication
0x1A Great Papers in Computer Security
Outline Basics of network security Definitions Sample attacks
Anonymous Communication
Outline Network characteristics that affect security
Outline Basics of network security Definitions Sample attacks
SPINE: Surveillance protection in the network Elements
Presentation transcript:

CSE 592 INTERNET CENSORSHIP (FALL 2015) LECTURE 19 PHILLIPA GILL - STONY BROOK U.

WHERE WE ARE Last time: Mitigating timing attacks (Astoria) Today: Finish up mitigating timing attacks (LASTor) Other approaches to anonymity systems; Dissent Aqua Administravia: Mark update on Piazza.

THE DISSENT PROJECT Goal: rethink the foundations of anonymity Offer quantifiable and measurable anonymity Build on primitives offering provable security Don't just patch specific vulnerabilities, butrearchitect to address whole attack classes Not a drop-in replacement for onion routing, but offers some systematic defense against all 5 classes of vulnerabilities ACKs:

ACKs:

ACKs:

ACKs:

DINING CRYPTOGRAPHERS (DC-NETS) 3 cryptographers eating dinner and the waiter informs them that the meal has been paid by someone Cryptographers want to know if it was one of them or the NSA They respect each others right to make an anonymous payment … … but want to know if the NSA paid Solution: 2 stage protocol 1.Each pair of cryptographers exchanges a secret (e.g., flip a coin behind a menu) 2.Announce a bit; XOR of bits shared with neighbors (if they did not pay) or the opposite of this (if they did pay)

EXAMPLE OF DINING CRYPTOGRAPHERS

ACKs:

ACKs:

ACKs:

ACKs:

ACKs:

ACKs:

ACKs:

ACKs:

ACKs:

ACKs:

ACKs:

ACKs:

ACKs:

ACKs:

ACKs:

ACKs:

ACKs:

TOWARDS EFFICIENT TRAFFIC- ANALYSIS RESISTANT ANONYMITY NETWORKS Stevens Le Blond David Choffnes Wenxuan Zhou Peter Druschel Hitesh Ballani Paul Francis

29 Snowden wants to communicate with Greenwald without Alexander to find out Ed’s IP Glenn’s IP

THE PROBLEM OF IP ANONYMITY Client Server 30 VPN proxy Proxies are single point of attack (rogue admin, break in, legal, etc)

31 Proxy Traffic analysis Onion routing (Tor) Onion routing doesn’t resist traffic analysis (well known)

OUTLINE 32

ANONYMOUS QUANTA (AQUA) k-anonymity: Indistinguishable among k clients BitTorrent Appropriate latency and bandwidth Many concurrent and correlated flows 33

34 Threat model Global passive (traffic analysis) attack Active attack Edge mixes aren’t compromised

Padding 35 Constant rate (strawman) Defeats traffic analysis, but overhead proportional to peak link payload rate on fully connected network

OUTLINE 36

37 Multipath Multipath reduces the peak link payload rate Padding

VARIABLE UNIFORM RATE 38 Reduces overhead by adapting to changes in aggregate payload traffic

OUTLINE 39

K-ANONYMITY SETS (KSETS) 40 Send ksetRecv kset Provide k-anonymity by ensuring correlated rate changes on at least k client links Padding

FORMING EFFICIENT KSETS 41 Epochs Peers’ rates Are there temporal and spatial correlations among BitTorrent flows?

OUTLINE 42

METHODOLOGY: TRACE DRIVEN SIMULATIONS Month-long BitTorrent trace with 100,000 users 20 million flow samples per day 200 million traceroute measurements Models of anonymity systems Constant-rate: Onion routing v2 Broadcast: P5, DC-Nets P2P: Tarzan Aqua 43

EDGES 44 Models Overhead Much better bandwidth efficiency

EDGES 45 Models Throttling Efficiently leverages correlations in BitTorrent flows

OUTLINE 46

ONGOING WORK 47 Prototype implementation Aqua for VoIP traffic “tiny-latency” (RTT <330ms) Intersection attacks Workload independence

TAKE HOME MESSAGES Efficient traffic-analysis resistance by exploiting existing correlations in BitTorrent traffic At core: Multipath reduces peak payload rate Variable uniform rate adapts to changes in aggregate payload traffic At edges, ksets: Provide k-anonymity by sync rate on k client links Leverage temporal and spatial correlations of BitTorrent flows 48

HANDS ON ACTIVITY (Try at home ) Dissent source code is publicly available: Try downloading/installing/running the system 49