CSE 461: Privacy Ben Greenstein Jeremy Elson TAs: Ivan and Alper.

Slides:



Advertisements
Similar presentations
SPATor: Improving Tor Bridges with Single Packet Authorization Paper Presentation by Carlos Salazar.
Advertisements

Secure Mobile IP Communication
Expressive Privacy Control with Pseudonyms Seungyeop Han, Vincent Liu, Qifan Pu, Simon Peter, Thomas Anderson, Arvind Krishnamurthy, David Wetherall University.
Improving Wireless Privacy with an Identifier-Free Link Layer Protocol Ben Greenstein, Damon McCoy, Jeffrey Pang, Tadayoshi Kohno, Srinivasan Seshan, and.
Socket Layer Security. In this Presentation: need for web security SSL/TLS transport layer security protocols HTTPS secure shell (SSH)
CMSC 414 Computer and Network Security Lecture 26 Jonathan Katz.
Topic 8: Secure communication in mobile devices. Choice of secure communication protocols, leveraging SSL for remote authentication and using HTTPS for.
BASIC CRYPTOGRAPHY CONCEPT. Secure Socket Layer (SSL)  SSL was first used by Netscape.  To ensure security of data sent through HTTP, LDAP or POP3.
More on SSL/TLS. Internet security: TLS TLS is one of the more prominent internet security protocols. TLS is one of the more prominent internet security.
15-1 Last time Internet Application Security and Privacy Public-key encryption Integrity.
Part 5:Security Network Security (Access Control, Encryption, Firewalls)
1 Tryst: Making Local Service Discovery Confidential Jeffrey Pang Ben Greenstein Srinivasan Seshan David Wetherall.
Srinivasan Seshan (and many collaborators) Carnegie Mellon University 1.
Feb 25, 2003Mårten Trolin1 Previous lecture More on hash functions Digital signatures Message Authentication Codes Padding.
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.
بسم الله الرحمن الرحيم NETWORK SECURITY Done By: Saad Al-Shahrani Saeed Al-Smazarkah May 2006.
Mar 5, 2002Mårten Trolin1 Previous lecture More on hash functions Digital signatures Message Authentication Codes Padding.
By: Bryan Carey Randy Cook Richard Jost TOR: ANONYMOUS BROWSING.
Link Setup Time (ms) Details : How do sender and receiver synchronize i ? Discovery/binding messages: infrequent and narrow interface  short term linkability.
Introduction to Management Information Systems Chapter 5 Data Communications and Internet Technology HTM 304 Fall 07.
CMSC 414 Computer and Network Security Lecture 26 Jonathan Katz.
Improving Wireless Privacy with an Identifier-Free Link Layer Protocol Ben Greenstein et.al. MobiSys’08 Presented by Seo Bon Keun.
CMSC 414 Computer and Network Security Lecture 22 Jonathan Katz.
1 Chapter 13: Representing Identity What is identity Different contexts, environments Pseudonymity and anonymity.
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.
15-744: Computer Networking L-23 Privacy. 2 Overview Routing privacy Web Privacy Wireless Privacy.
Computer Science Public Key Management Lecture 5.
FIREWALL TECHNOLOGIES Tahani al jehani. Firewall benefits  A firewall functions as a choke point – all traffic in and out must pass through this single.
1 Lecture 18: Security issues specific to security key management services –privacy –integrity/authentication –nonrepudiation/plausible deniability.
OSI Model Routing Connection-oriented/Connectionless Network Services.
8: Network Security8-1 Security in the layers. 8: Network Security8-2 Secure sockets layer (SSL) r Transport layer security to any TCP- based app using.
January 2009Prof. Reuven Aviv: Firewalls1 Firewalls.
Anonymous routing and mix nets (Tor) Yongdae Kim Significant fraction of these slides are borrowed from CS155 at Stanford 1.
8-1Network Security Chapter 8 roadmap 8.1 What is network security? 8.2 Principles of cryptography 8.3 Message integrity, authentication.
1 Lecture 14: Real-Time Communication Security real-time communication – two parties interact in real time (as opposed to delayed communication like )
FIREWALLS Vivek Srinivasan. Contents Introduction Need for firewalls Different types of firewalls Conclusion.
Privacy: anonymous routing, mix nets (Tor), and user tracking.
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.
23-1 Last time □ P2P □ Security ♦ Intro ♦ Principles of cryptography.
1 Security Protocols in the Internet Source: Chapter 31 Data Communications & Networking Forouzan Third Edition.
R. Newman Anonymity - Background. Defining anonymity Defining anonymity Need for anonymity Need for anonymity Defining privacy Defining privacy Threats.
V0.0CPSC415 Biometrics and Cryptography1 Placement of Encryption Function Lecture 3.
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.
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.
Wireless Security Rick Anderson Pat Demko. Wireless Medium Open medium Broadcast in every direction Anyone within range can listen in No Privacy Weak.
Individual Project 1 Sarah Pritchard. Fran, a customer of your company, would like to visit your company’s website from her home computer… How does your.
Chapter 14 Network Encryption
Group 9 Chapter 8.3 – 8.6. Public Key Algorithms  Symmetric Key Algorithms face an inherent problem  Keys must be distributed to all parties but kept.
Improving Wireless Privacy with an Identifier-Free Link Layer Protocol Ben Greenstein, Damon McCoy, Yoshi Kohno, Jeffrey Pang, Srini Seshan, and David.
Doc.: IEEE /1022r0 Submission September 2008 Greenstein (Intel) et al. Slide 1 SlyFi: Enhancing Privacy by Concealing Link Layer Identifiers.
Authentication has three means of authentication Verifies user has permission to access network 1.Open authentication : Each WLAN client can be.
Traffic Correlation in Tor Source and Destination Prediction PETER BYERLEY RINDAL SULTAN ALANAZI HAFED ALGHAMDI.
K. Salah1 Security Protocols in the Internet IPSec.
@Yuan Xue CS 285 Network Security Secure Socket Layer Yuan Xue Fall 2013.
@Yuan Xue Case Study (Mid-term question) Bob sells BatLab Software License Alice buys BatLab Credit card information Number of.
1 Anonymity. 2 Overview  What is anonymity?  Why should anyone care about anonymity?  Relationship with security and in particular identification 
Benjamin Knapic Nicholas Johnson.  “Tor is free software and an open network that helps you defend against a form of network surveillance that threatens.
anonymous routing and mix nets (Tor)
Anonymous Communication
What's the buzz about HORNET?
0x1A Great Papers in Computer Security
Anonymous Communication
Public-Key, Digital Signatures, Management, Security
Anonymous Communication
Chapter 8 roadmap 8.1 What is network security?
Presentation transcript:

CSE 461: Privacy Ben Greenstein Jeremy Elson TAs: Ivan and Alper

Administrivia Ivan has extended office hours tomorrow Short final review on Wednesday Project due this Friday Final exam on 12/11

“Privacy is for old people. This is the MySpace generation. People publish every detail of their lives for all the world to see.” – Mary Baker, HP

Lesson 1: You won’t realize privacy is important until you’re ruined by the release of personal information – This is dumb – Drunk Rob on MySpace

Consequence Ok, so let’s presume you don’t deliberately put yourself at risk…

Let’s say you’re careful Assumptions – You don’t publish information about yourself – You use best practices of security whenever available – SSL/TLS-enabled Web pages – WPA2 with RADIUS-based authentication (enterprise)

Threat 1: Big Business Web Server Learns who you are, where you are Collects all information that you tell it Sometimes Maliciously

Less obvious threat…

Threat doesn’t have to be intentional

Threat 2: Mercenary ISP ISPs track customer browsing habits – Sell information to advertisers – Embed targeted ads in web pages (1.3%) [Web Tripwires: Reis et al., 2008] Example: MetroFi (free wireless) Technologies used for tracking at ISP – NebuAd, Phorm, Front Porch – Bring together advertisers, publishers, and ISPs At ISP: inject targeted ads into non-SSL pages Tracking technologies at enterprise networks: – Vontu (semantec), Tablus (RSA), Vericept

E.g., NebuAd’s Platform

E.g., Phorm

Threat 3: Overeager Governments EU directive 2006/24/EC: 3 year data retention – For ALL traffic, requires EU ISPs to record: Sufficient information to identify endpoints (both legal entities and natural persons) Session duration … but not session contents – Make available to law enforcement … but penalties for transfer or other access to data For info on US privacy on the net: – “privacy on the line” by W. Diffie and S. Landau

Threat 4: Untrustworthy Neighbors Can learn who you are and where you go, what you do, etc.

Tracking Example MAC: 01:34:4F:88:7A:FEProbe: SSID = VALLEY_HIGH MAC: 54:CC:F2:B8:77:10 MAC: 24:AB:87:11:62:99 Probe: SSID = VALLEY_HIGH

E.g., Bonjour jill yetman’s iBook G4 [00:17:f2:c8:46:8e]._workstation._tcp.local Gary Yngve’s MacBook Pro._postgresql._tcp.local Benjamin Melton’s MacBook Pro._afpovertcp._tcp.local Chantri Polprasert’s Computer [00:17:f2:f2:23:59]._workstation._tcp.local Marianne Keddington-Lang’s MacBook._smb._tcp.local Darin Travis’ Computer [00:19:e3:45:0b:43]._workstation._tcp.local Jackson Douglas’ iBook [00:03:93:a6:2f:36]._workstation._tcp.local Cheryl West’s Laptop._afpovertcp._tcp.local Andrew Hard’s Computer [00:17:f2:32:9f:ee]._workstation._tcp.local Rosslyn Luke’s Library._daap._tcp.local

What are the defenses? Tor + Privoxy SlyFi Awareness?

TOR: For anonymous Web browsing Why? – Discuss health issues and financial matters anonymously, conceal interactions with gambling sites – Bypass Internet censorship in parts of the world – Law enforcement Two goals: – Hide user identity from target web site – Hide browsing pattern from employer or ISP

Part 1: network-layer privacy Goals: Hide user’s IP address from target web site Hide browsing destinations from network

1 st attempt: anonymizing proxy anonymizer.com ? URL=target User 1 User 2 User 3 anonymizer.com Web 1 Web 2 Web 3 SSL HTTP

Anonymizing proxy: security Monitoring ONE link: eavesdropper gets nothing Monitoring TWO links: – Eavesdropper can do traffic analysis – More difficult if lots of traffic through proxy Trust: proxy is a single point of failure – Can be corrupt or subpoenaed Example: The Church of Scientology vs. anon.penet.fi Protocol issues: – Long-lived cookies make connections to site linkable

How proxy works Proxy rewrites all links in response from web site – Updated links point to anonymizer.com Ensures all subsequent clicks are anonymized Proxy rewrites/removes cookies and some HTTP headers Proxy IP address: – if a single address, could be blocked by site or ISP – anonymizer.com consists of >20,000 addresses Globally distributed, registered to multiple domains Note: chinese firewall blocks ALL anonymizer.com addresses Other issues: attacks (click fraud) through proxy

2 nd Attempt: MIX nets Goal: no single point of failure

E pk 2 ( R 3, E pk 3 ( R 6, MIX nets [C’81] Every router has public/private key pair – Sender knows all public keys To send packet: – Pick random route: R 2  R 3  R 6  srvr – Prepare onion packet: R3R3 R5R5 R4R4 R1R1 R2R2 R6R6 E pk 6 ( srvr, msg) msg srvr packet =

Eavesdropper’s view at a single MIX Eavesdropper observes incoming and outgoing traffic Crypto prevents linking input/output pairs Assuming enough packets in incoming batch If variable length packets then must pad all to max len Note: router is stateless user 1 user 2 user 3 RiRi batch

Performance Main benefit: – Privacy as long as at least one honest router on path Problems: – High latency (lots of public key ops) Inappropriate for interactive sessions May be OK for (e.g. Babel system) – No forward security How does server respond? – hint: user includes “response onion” in forward packet R3R3 R2R2 R6R6 srvr

3 rd Attempt: Tor MIX circuit-based method Goals:privacy as long as one honest router on path, and reasonable performance

The Tor design Trusted directory contains list of Tor routers User’s machine preemptively creates a circuit – Used for many TCP streams – New circuit is created once a minute R1R1 R2R2 R3R3 R4R4 srvr 1 srvr 2 R5R5 R6R6 one minute later stream 1 stream 2

Creating circuits R1R1 R2R2 TLS encrypted Create C 1 D-H key exchange K1K1 K1K1 Relay C 1 Extend R 2 D-H key exchange K2K2 K2K2 Extend R 2

Once circuit is created User has shared key with each router in circuit Routers only know ID of successor and predecessor R1R1 R2R2 R3R3 R4R4 K 1, K 2, K 3, K 4 K1K1 K2K2 K3K3 K4K4

Sending data R1R1 R2R2 Relay C 1 Begin site:80 Relay C 2 Begin site:80 TCP handshake Relay C 1 data HTTP GET Relay C 2 data HTTP GET HTTP GET K1K1 K2K2 resp Relay C 2 data resp Relay C 1 data resp

Properties Performance: – Fast connection time: circuit is pre-established – Traffic encrypted with AES: no pub-key on traffic Tor crypto: – provides end-to-end integrity for traffic – Forward secrecy via TLS Downside: – Routers must maintain state per circuit – Each router can link multiple streams via CircuitID all steams in one minute interval share same CircuitID

Privoxy Tor only provides network level privacy – No application-level privacy e.g. mail progs add “From: -addr” to outgoing mail Privoxy: – Web proxy for browser-level privacy – Removes/modifies cookies – Other web page filtering

SlyFi: A link layer with better privacy Why? – Easy for eavesdropper to track and profile users via their wireless transmissions Two goals: – Conceal all identifiers from 3 rd parties – Make the protocol efficient – Who: Ben Greenstein, Damon McCoy, Jeffrey Pang, Tadayoshi Kohno, Srinivasan Seshan, and David Wetherall – The paper itself:

Our Wireless World

Best Security Practices SSID: Bob’s Network Key: 0x … Username: Alice Key: 0x348190… Bootstrap Out-of-band (e.g., password, WiFi Protected Setup) Confidentiality Authenticity Integrity 36

Bootstrap Privacy Problems Remain Is Bob’s Network here? Proof that I’m Bob Bob’s Network is here MAC addr, seqno, … Many exposed bits are (or can be used as) identifiers that are linked over time Confidentiality Authenticity Integrity 37

38 Problem: Long-Term Linking Alice Alice? Easy to identify and relate devices over time Alice’s friend?

39 Problem: Long-Term Linking Linking enables location tracking, user profiling, inventorying, relationship profiling, … [Greenstein, HotOS ’07; Jiang, MobiSys ’07; Pang, MobiCom ’07, HotNets ’07] Home headerIs “djw” here? “djw” is here

Problem: Short-Term Linking 12:34:56:78:90:ab, seqno: 1, … 12:34:56:78:90:ab, seqno: 2, … 12:34:56:78:90:ab, seqno: 3, … 12:34:56:78:90:ab, seqno: 4, … 00:00:99:99:11:11, seqno: 103, … 00:00:99:99:11:11, seqno: 104, … 00:00:99:99:11:11, seqno: 102, … Easy to isolate distinct packet streams 3-9 data streams overlap each 100 ms, on average (see paper) 40

Problem: Short-Term Linking 41 Isolated data streams are more susceptible to side- channel analysis on packet sizes and timing – Exposes keystrokes, VoIP calls, webpages, movies, … [Liberatore, CCS ‘06; Pang, MobiCom ’07; Saponas, Usenix Security ’07; Song, Usenix Security ‘01; Wright, IEEE S&P ‘08; Wright, Usenix Security ‘07] ≈ DFT transmission sizes Video compression signatures Devicefingerprints Keystroketimings

Key technical problem to solve Is Bob’s Network here? Proof that I’m Bob Bob’s Network is here MAC addr, seqno, … Many exposed bits are (or can be used as) identifiers that are linked over time Confidentiality Authenticity Integrity Proof that I’m Alice

Goal: all bits appear random to outsiders Bootstrap SSID: Bob’s Network Key: 0x … Username: Alice Key: 0x348190… ? ?

Challenge is to make the protocol work when all bits are hidden Which packets are mine? Filtering without Identifiers Without changing the usage model Without breaking services Without changing authentication While staying just as efficient

Straw man: MAC Pseudonyms Idea: change MAC address periodically – Per session or when idle [Gruteser ’05, Jiang ‘07] Other fields remain (e.g., in discovery/binding) – No mechanism for data authentication/encryption – Doesn’t hide network names during discovery or credentials during authentication Pseudonyms are linkable in the short-term – Same MAC must be used for each association – Data streams still vulnerable to side-channel leaks 45

Naïve approach (symmetric encryption of all bits) is slow Probe “Bob” ClientService Symmetric encryption (e.g., AES w/ random IV) Check MAC: MAC:K AB Try to decrypt with each shared key K Shared1 K Shared2 K Shared3 … Different symmetric key per potential sender Can’t identify the decryption key in the packet or else it is linkable

Design Requirement: add privacy to security without breaking anything else When A generates Message to B, she sends: PrivateMsg = F(A, B, Message) Where F has these properties: – Confidentiality: Only A and B can determine Message. – Authenticity: B can verify A created PrivateMsg. – Integrity: B can verify Message not modified – Unlinkability: Only A and B can link PrivateMsgs to same sender or receiver – Efficiency:B can process PrivateMsgs as fast as he can receive them

Symmetric key almost works, but tension between: – Unlinkability: can’t expose the identity of the key – Efficiency: need to identify the key to avoid trying all keys Idea: Split the encryption to identify the key in an unlinkable way. Provides “one-time addresses” that can be pre-computed for efficient matching Approach: – Sender A and receiver B agree on tokens: T 1, T 2, T 3, … – A attaches T i to encrypted packet for B SlyFi insight: split encryption to provide “one-time addresses” AB

SlyFi “one time addresses” Probe “Bob” ClientService Symmetric encryption (e.g., AES w/ random IV) Check MAC: MAC:K AB Lookup T i in a table to get K AB AB Need a shared variable, i, that changes often TiTi AB Main challenge: Sender and receiver must synchronize i without communication Main challenge: Sender and receiver must synchronize i without communication

Data Transport S – Only sent over established connections – Expect messages to be delivered Synchronize – Infrequent: sent when trying to associate – Narrow interface: single application, few side-channels – Linkability OK at short timescales Discovery and Binding On receipt of, receiver computes T i+1 Handling message loss or clock skew: – On receipt of T i save T i+1, …, T i+k in table – Tolerates k consecutive losses or skew of 5 * k minutes – No loss  compute one token per reception AB

Prototype Discovery/Binding Time SlyFi link setup has less overhead than WPA Lower = Better

Solution Summary Unlinkability Integrity Authenticity Efficiency Confidentiality WPA (today) MAC Pseudonyms Naïve Symmetric Key SlyFi: Discovery/Binding SlyFi: Data packets Long Term Long Term Only Data Payload Only Data Payload Only Data Payload

Epilogue

Ongoing work at Intel Conducting a study of a day in the life of a wireless user Goals: – To understand user behavior and network activity. (To Learn what information is being sent where, when, how?) What does Google OR Starbucks OR DoubleClick OR Comcast OR Joe the Plumber know about me? – Help determine what would actually improve privacy New protocols that defend our privacy Technologies to help users make more informed decisions Looking for student researchers to help design, implement and execute the study – See or mail me if interested