CS590B/690B Detecting Network Interference

Slides:



Advertisements
Similar presentations
1 Interdomain Traffic Engineering with BGP By Behzad Akbari Spring 2011 These slides are based on the slides of Tim. G. Griffin (AT&T) and Shivkumar (RPI)
Advertisements

Border Gateway Protocol Ankit Agarwal Dashang Trivedi Kirti Tiwari.
Network Layer: Internet-Wide Routing & BGP Dina Katabi & Sam Madden.
© J. Liebeherr, All rights reserved 1 Border Gateway Protocol This lecture is largely based on a BGP tutorial by T. Griffin from AT&T Research.
Border Gateway Protocol Autonomous Systems and Interdomain Routing (Exterior Gateway Protocol EGP)
Fundamentals of Computer Networks ECE 478/578 Lecture #18: Policy-Based Routing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
1 Interdomain Routing Protocols. 2 Autonomous Systems An autonomous system (AS) is a region of the Internet that is administered by a single entity and.
How do Networks work – Really The purposes of set of slides is to show networks really work. Most people (including technical people) don’t know Many people.
Interdomain Routing Security COS 461: Computer Networks Michael Schapira.
Practical and Configuration issues of BGP and Policy routing Cameron Harvey Simon Fraser University.
1 BGP Security -- Zhen Wu. 2 Schedule Tuesday –BGP Background –" Detection of Invalid Routing Announcement in the Internet" –Open Discussions Thursday.
Mini Introduction to BGP Michalis Faloutsos. What Is BGP?  Border Gateway Protocol BGP-4  The de-facto interdomain routing protocol  BGP enables policy.
Analysis of BGP Routing Tables
More on BGP Check out the links on politics: ICANN and net neutrality To read for next time Path selection big example Scaling of BGP.
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—6-1 Connecting an Enterprise Network to an ISP Network Considering the Advantages of Using BGP.
Computer Networks Layering and Routing Dina Katabi
1 Interdomain Routing (BGP) By Behzad Akbari Fall 2008 These slides are based on the slides of Ion Stoica (UCB) and Shivkumar (RPI)
CS 3700 Networks and Distributed Systems Inter Domain Routing (It’s all about the Money) Revised 8/20/15.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
Lecture 4: BGP Presentations Lab information H/W update.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
TDTS21: Advanced Networking Lecture 7: Internet topology Based on slides from P. Gill and D. Choffnes Revised 2015 by N. Carlsson.
David Wetherall Professor of Computer Science & Engineering Introduction to Computer Networks Hierarchical Routing (§5.2.6)
BCNET Conference April 29, 2009 Andree Toonk BGPmon.net Prefix hijacking! Do you know who's routing your network? Andree Toonk
Border Gateway Protocol (BGP) W.lilakiatsakun. BGP Basics (1) BGP is the protocol which is used to make core routing decisions on the Internet It involves.
More on Internet Routing A large portion of this lecture material comes from BGP tutorial given by Philip Smith from Cisco (ftp://ftp- eng.cisco.com/pfs/seminars/APRICOT2004.
CSE 592 INTERNET CENSORSHIP (FALL 2015) LECTURE 16 PHILLIPA GILL - STONY BROOK U.
CS 640: Introduction to Computer Networks Aditya Akella Lecture 11 - Inter-Domain Routing - BGP (Border Gateway Protocol)
1 Agenda for Today’s Lecture The rationale for BGP’s design –What is interdomain routing and why do we need it? –Why does BGP look the way it does? How.
Measuring and Mitigating AS-level Adversaries Against Tor
Securing BGP Bruce Maggs. BGP Primer AT&T /8 Sprint /16 CMU /16 bmm.pc.cs.cmu.edu Autonomous System Number Prefix.
1 Border Gateway Protocol (BGP) and BGP Security Jeff Gribschaw Sai Thwin ECE 4112 Final Project April 28, 2005.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—3-1 Route Selection Using Policy Controls Using Multihomed BGP Networks.
Michael Schapira, Princeton University Fall 2010 (TTh 1:30-2:50 in COS 302) COS 561: Advanced Computer Networks
Securing BGP Bruce Maggs. BGP Primer AT&T /8 Sprint /16 CMU /16 bmm.pc.cs.cmu.edu Autonomous System Number Prefix.
Network Devices and Firewalls Lesson 14. It applies to our class…
CS 3700 Networks and Distributed Systems
Border Gateway Protocol
CS590B/690B Detecting Network Interference (Fall 2016)
CS 3700 Networks and Distributed Systems
CS590B/690B Detecting Network Interference (Fall 2016)
CS590B/690B Detecting Network Interference (FALL 2016)
CS590B/690B Detecting Network Interference (Fall 2016)
Keeping local stuff local
Securing BGP Bruce Maggs.
Border Gateway Protocol
Anonymous Communication
ICMP ICMP – Internet Control Message Protocol
COS 561: Advanced Computer Networks
BGP supplement Abhigyan Sharma.
Introduction to Networking
Introduction to Networking
Interdomain Traffic Engineering with BGP
Lixin Gao ECE Dept. UMASS, Amherst
COS 561: Advanced Computer Networks
Department of Computer and IT Engineering University of Kurdistan
COS 561: Advanced Computer Networks
Anonymous Communication
COS 561: Advanced Computer Networks
CS590B/690B Detecting network interference (Spring 2018)
COS 461: Computer Networks Spring 2014
COS 561: Advanced Computer Networks
COMP/ELEC 429/556 Introduction to Computer Networks
BGP Security Jennifer Rexford Fall 2018 (TTh 1:30-2:50 in Friend 006)
Securing BGP Bruce Maggs.
Fixing the Internet: Think Locally, Impact Globally
BGP Instability Jennifer Rexford
Network Layer: Internet Inter-Domain Routing
Anonymous Communication
Presentation transcript:

CS590B/690B Detecting Network Interference Lecture 15 Phillipa Gill – Umass Amherst

Administravia Midterm next Tuesday Check out review questions in slides. Will post guidance about the exam on Piazza by Thursday Marks: Will have update before midterm. Assignment 3 Posted last week, server is up and running

Where we are Last time: Tor relay-based attacks/Web site fingerprinting Today: Timing attacks + Internet routing review RAPTor

Anonymity on the Internet Challenge: By observing Internet traffic one can infer who is talking to whom Meta data is the message! Track communications over time… …behaviors, interests, activities Tor aims to solve this: One of the challenges of the Intenret is that it was not designed with anonymity in mind. So somebody observing network traffic can observe the source and destination of each connection and learn about what sites people are visiting even if the connection is encrypted. As we’ve seen with the NSA revelations in recent years even this sort of meta data about who talks to who can be incredibly valuable for tracking peoples behaviors intersts and activities. Tor is a system that tries to resolve this issue by providing users an anonymous way to access content online. It does this using encryption and by bouncing the users traffic off of three relays or Tor routers refered to as the entry, middle and exit relay. The basic idea is that someone observing at the entry relay only learns the identify of the source but not the destination and the exit knows the destination but not the source. On the Internet, by default there is no anonymity, someone observing packets can easily observe the source and destination of the connection and infer who is talking to whom, even if they use encryption . And as we’ve seen with the NSA relevations this meta data is actually quite critical, you can track communications, behaviors, interests and so on. So what systems like to try to do is provide users with the ability to use the internet in an anonymous way. Tor Does not know destination Does not know source

Tor 101 Tor Tor circuit is constructed out of three Tor routers/relays Middle Tor Exit Entry Constructs the path out of three Tor routers/relays. - HOW ARE RELAYS chosen?  based on capacity/load ; limited set of entry relays to mitigate relay-based attacks Client iteratively exchanges keys with relays on the path and tunnels to the next relay - When the relay decrypts the message it learns the identity of the next hop on the path. In this way each relay only learns the hop before it and after it in the circuit. - exit see the actual traffic so if the data contains information about the client the exit can learn who it is.  Tor browser is important. Client iteratively tunnels and exchanges keys with the relays

Internet routing dynamics make timing attacks easier than you’d think! Threat model Which user is visiting the site? Middle Tor Internet routing dynamics make timing attacks easier than you’d think! Exit Entry Constructs the path out of three Tor routers/relays. - HOW ARE RELAYS chosen?  based on capacity/load Client iteratively exchanges keys with relays on the path and tunnels to the next relay - When the relay decrypts the message it learns the identity of the next hop on the path. In this way each relay only learns the hop before it and after it in the circuit. - exit see the actual traffic so if the data contains information about the client the exit can learn who it is.  Tor browser is important. Network-based attacks Timing attacks can deanonymize users Actually being tried by gov’t agencies! (Today’s lecture) Relay-based attacks Finger print Web sites based on packet timing Exit relay can observe users’ traffic (Lots of work on this)

AS Numbers Each AS identified by an ASN number 16-bit values (latest protocol supports 32-bit ones) 64512 – 65535 are reserved Currently, there are ~ 40000 ASNs AT&T: 5074, 6341, 7018, … Sprint: 1239, 1240, 6211, 6242, … Google 15169, 36561 (formerly YT), + others Facebook 32934 North America ASs  ftp://ftp.arin.net/info/asn.txt

BGP: The Internet’s Routing Protocol (1) A simple model of AS-level business relationships. $ $ ISP 1 ISP 1 (peer) Level 3 (peer) Level 3 $ stub Stub (customer) Verizon Wireless ISP 2 (provider) ISP 2 $ $ In this work we look at issues relating to security of routing on the internet, but first lets see what we mean when we talk about routing. In this work we focus on routing between autonomous systems on the internet. So you can think of autonomous systems as the network run by an organization. So for example, AT&T’s network might be one autonomous system and the university of toronto’s network is another autonomous system. Say the prefix is a block of ip addresses Define AS This topology corresponds to: Large ISP 1 = ATT Large ISP 2 = NTT Verizon wireless is really “6167 --- 22394” We have routeviews announcements for ATT and NTT below ======================= ATT = “Large ISP 1” FIXES THINGS ============== updates.20100408.1600.lines: | TIME: 04/08/10 12:02:49 | TYPE: BGP4MP/MESSAGE/Update | FROM: 12.0.1.63 AS7018 | TO: 128.223.51.102 AS6447 | ORIGIN: IGP | ASPATH: 7018 3356 6167 22394 22394 | NEXT_HOP: 12.0.1.63 | COMMUNITY: 7018:5000 | ANNOUNCE | 72.103.0.0/19 | 166.180.96.0/19 | 66.174.161.0/24 | 166.180.115.0/24 | 166.153.208.0/20 | 166.180.119.0/24 | 166.153.38.0/24 | 166.145.112.0/20 | 166.145.118.0/24 | 166.145.48.0/24 | 70.203.128.0/20 | 166.145.16.0/24 | 166.180.192.0/19 | 166.145.22.0/24 | 70.201.0.0/19 | 70.204.128.0/20 | 151.144.43.0/24 | 151.144.144.0/24 | 166.145.44.0/24 | 166.153.40.0/24 | 66.174.56.0/24 | 166.180.193.0/24 | 151.144.95.0/24 | 166.145.117.0/24 | 70.205.0.0/18 | 70.200.128.0/19 | 166.145.12.0/24 | 166.145.116.0/24 | 151.144.46.0/24 | 166.180.240.0/24 | 166.153.33.0/24 | 72.103.32.0/20 | 70.205.192.0/19 | 166.153.176.0/24 | 166.153.36.0/24 | 166.145.54.0/24 | 166.180.224.0/24 | 166.180.225.0/24 | 166.180.249.0/24 | 166.180.243.0/24 | 166.180.195.0/24 | 166.180.251.0/24 | 166.180.230.0/24 | 166.180.229.0/24 | 166.180.197.0/24 | 166.180.234.0/24 | 166.180.250.0/24 | 166.180.235.0/24 | 166.180.233.0/24 | 166.180.245.0/24 | 166.180.226.0/24 | 166.180.227.0/24 | 166.180.242.0/24 | 166.180.241.0/24 | 166.180.238.0/24 | 166.180.194.0/24 | 166.180.246.0/24 | 166.180.196.0/24 | 151.144.47.0/24 And ================== NTT = “Large ISP 2” fixes things updates.20100408.1549.lines: | TIME: 04/08/10 11:58:59 | TYPE: BGP4MP/MESSAGE/Update | FROM: 195.66.224.138 AS2914 | TO: 195.66.225.222 AS6447 | ORIGIN: IGP | ASPATH: 2914 3356 6167 22394 22394 | NEXT_HOP: 195.66.224.138 | MULTI_EXIT_DISC: 5 | COMMUNITY: 2914:420 2914:2201 2914:3200 65504:3356 | ANNOUNCE | 66.174.161.0/24 | 66.174.56.0/24 22394 (also VZW)

Standard model of Internet routing Proposed by Gao & Rexford 12 years ago Based on practices employed by a large ISP Provide an intuitive model of path selection and export policy Customer Path Selection: 1. LocalPref: Prefer customer paths over peer paths over provider paths 2. Prefer shorter paths 3. Arbitrary tiebreak $ $ Peer ISP The model provides a simple view of how paths are selected and exported to neighboring ASes. The goal of the model isn’t to faithfully capture the behavior of all 36000 ASes on the Internet but to capture the general trend of how routing is done. Part of my goal here today is to understand whether this model holds for the majority of networks and if there are notable exceptions that should be taken into account. The standard routing policy model was proposed by Gao and Rexford 12 years ago and was based on common practices at a large isp at the time. It breaks routing down into the path selection and export policies. In terms of path selection, the business relationships between ISPs are modeled as either customer that pays the ISP, peer that the ISP engages in settlement free peering with, or provider that the ISP has to pay. Here you can think of the arrows in this diagram as “where the money flows” When choosing a path the ISP will prefer to route to a customer, over a peer over a provider. Basically they want to route towards the AS that will pay them using LocalPref. If they have multiple paths with the same LocalPref the model then says they will prefer a shorter path. And beyond that it goes to arbitrary tiebreak (since we don’t have a notion of intra-domain routing/MEDs here). $ Provider

Standard model of Internet routing Proposed by Gao & Rexford 12 years ago Based on practices employed by a large ISP Provide an intuitive model of path selection and export policy Provider Path Selection: 1. LocalPref: Prefer customer paths over peer paths over provider paths 2. Prefer shorter paths 3. Arbitrary tiebreak Announcements $ ISP The export policy is based on ensuring that networks only transit traffic that generates revenue for them. So if a customer sends them a path they will announce it to all neighbors but if they receive a path from a non customer they will only export it to their customer. $ $ Export Policy: Export customer path to all neighbors. Export peer/provider path to all customers. Provider Customer

Timing attacks & routing Customer $ Exit relay Entry relay Provider AS3 AS4 Peer AS1 $ AS2 Peer This slide shows the location of the source, entry, exit and destination on the Internet. Here we are considering routing at the AS level. You can think of an AS … -- when I talk about routing here I’m talking about routing at the level of autonomous systems, you can think of an autonomous system as a network under control of a single organization, for example AT&T or stony brook university. -- the client’s traffic will traverse an Internet path consisting of multiple autonomous systems on its way into and out of Tor. Internet routing is based on business relationships! Destination AS Source AS

Timing attacks & routing Asymmetric routing makes things worse! ACK #s leak information! ASes prefer cheaper paths! Exit relay Entry relay AS3 AS3 AS4 AS1 Insecurity of BGP makes things even worse! AS2 AS2 However, properties of the internet’s routing system actually make this worse. Specifically traffic from the entry back to the client and from the destination to exit may actually take different paths. Using ack numbers an AS that lies on these reverse paths is also in a position to carry out correlation attacks. For example if we take reverse paths into consideration now AS 3 can also perform the attack. Destination AS Source AS

IP Address Ownership and Hijacking IP address block assignment Regional Internet Registries (ARIN, RIPE, APNIC) Internet Service Providers Proper origination of a prefix into BGP By the AS who owns the prefix … or, by its upstream provider(s) in its behalf However, what’s to stop someone else? Prefix hijacking: another AS originates the prefix BGP does not verify that the AS is authorized Registries of prefix ownership are inaccurate

Getting access to the router How to Hijack a Prefix The hijacking AS has Router with eBGP session(s) Configured to originate the prefix Getting access to the router Network operator makes configuration mistake Disgruntled operator launches an attack Outsider breaks in to the router and reconfigures Getting other ASes to believe bogus route Neighbor ASes not filtering the routes … e.g., by allowing only expected prefixes But, specifying filters on peering links is hard

How can hijacks/interception be used to compromise Tor? Reading presentation: RAPTor Murdoch + Danezis

Exercise How might we harden Tor against RAPTor attacks? What sources of data might we leverage? Active measurements? (traceroute from client to relays?) BGP monitor data? How to detect suspicious/hijacking activity? Which parts of this make sense to implement on the client? What makes outsourcing functionality (e.g., to a central point) challenging?