LASTor: A Low-Latency AS-Aware Tor Client. Tor  Stands for The Onion Router  Goals: Anonymity ○ Each hop only knows previous and next hop on a path.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Advertisements

Tor: The Second-Generation Onion Router
LASTor: A Low-Latency AS-Aware Tor Client
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.
Trust-based Anonymous Communication: Models and Routing Algorithms Aaron Johnson Paul Syverson Roger Dingledine Nick Mathewson U.S. Naval Research Laboratory.
Fault Tolerant Routing in Tri-Sector Wireless Cellular Mesh Networks Yasir Drabu and Hassan Peyravi Kent State University Kent, OH
Fundamentals of Computer Networks ECE 478/578 Lecture #18: Policy-Based Routing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
Lecture 6 Overlay Networks CPE 401/601 Computer Network Systems slides are modified from Jennifer Rexford.
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.
Onion Routing Security Analysis Aaron Johnson U.S. Naval Research Laboratory DC-Area Anonymity, Privacy, and Security Seminar.
How Much Anonymity does Network Latency Leak? Paper by: Nicholas Hopper, Eugene Vasserman, Eric Chan-Tin Presented by: Dan Czerniewski October 3, 2011.
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.
Location-Aware Onion Routing Aaron Johnson U.S. Naval Research Laboratory IEEE Symposium on Security and Privacy May 19, 2015.
Traffic Engineering With Traditional IP Routing Protocols
Mod 10 – Routing Protocols
Slide -1- February, 2006 Interdomain Routing Gordon Wilfong Distinguished Member of Technical Staff Algorithms Research Department Mathematical and Algorithmic.
Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
Routing.
Anonymity on the Web: A Brief Overview By: Nipun Arora uni-na2271.
Anonymizing Network Technologies Some slides modified from Dingledine, Mathewson, Syverson, Xinwen Fu, and Yinglin Sun Presenter: Chris Zachor 03/23/2011.
Toward Understanding Congestion in Tor DC-area Anonymity, Privacy, and Security Seminar January 24 th, 2014 Rob Jansen U.S. Naval Research Laboratory *Joint.
1 Latency Equalization: A Programmable Routing Service Primitive Minlan Yu Joint work with Marina Thottan, Li Li at Bell Labs.
Preventing Active Timing Attacks in Low- Latency Anonymous Communication The 10 th Privacy Enhancing Technologies Symposium July 2010 Joan Feigenbaum Yale.
Tor (Anonymity Network) Scott Pardue. Tor Network  Nodes with routers within the network (entry, middle, exit)  Directory servers  Socket Secure (SOCKS)
Sofya Rozenblat 11/26/2012 CS 105 TOR ANONYMITY NETWORK.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
© Copyright 2012 STI INNSBRUCK Tor project: Anonymity online.
Dr. John P. Abraham Professor University of Texas Pan American Internet Routing and Routing Protocols.
A LIGHT-WEIGHT DISTRIBUTED SCHEME FOR DETECTING IP PREFIX HIJACKS IN REAL TIME Changxi Zheng, Lusheng Ji, Dan Pei, Jia Wang and Paul Francis. Cornell University,
CSE 486/586, Spring 2012 CSE 486/586 Distributed Systems Case Study: TOR Anonymity Network Bahadir Ismail Aydin Computer Sciences and Engineering University.
Privacy-Preserving P2P Data Sharing with OneSwarm -Piggy.
Chapter 4: Finding the Shortest Path Lesson 1: Dijkstra’s Algorithm
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
Resilient P2P Anonymous Routing by Using Redundancy Yingwu Zhu.
Establishing Connections Networking Modes: When you are evaluating a network, you concentrate on circuit switching versus packet switching. But it's also.
Never Been KIST: Tor’s Congestion Management Blossoms with Kernel- Informed Socket Transport 23 rd USENIX Security Symposium August 20 th 2014 Rob JansenUS.
The Way Networks Work Computer Networks Kwangwoon University.
Zhen Ling Southeast University Extensive Analysis and Large-Scale Empirical Evaluation of Tor Bridge Discovery In collaboration with Junzhou Luo, Southeast.
1 WAN Technologies and Routing. 2 Motivation Connect multiple computers Span large geographic distance Cross public right-of-way –Streets –Buildings –Railroads.
Crowds: Anonymity for Web Transactions Michael K. Reiter Aviel D. Rubin Jan 31, 2006Presented by – Munawar Hafiz.
IP Security IP sec IPsec is short for Internet Protocol Security. It was originally created as a part of IPv6, but has been retrofitted into IPv4. It.
Zibin Zheng DR 2 : Dynamic Request Routing for Tolerating Latency Variability in Cloud Applications CLOUD 2013 Jieming Zhu, Zibin.
Guard Sets for Onion Routing JOSHUA FREE. Tor Most popular low-latency distributed anonymity network Controversial decisions of guard selection strategies.
Securing Data Transmission and Authentication. Securing Traffic with IPSec IPSec allows us to protect our network from within IPSec secures the IP protocol.
Interconnect Networks Basics. Generic parallel/distributed system architecture On-chip interconnects (manycore processor) Off-chip interconnects (clusters.
The Tor Network BY: CONOR DOHERTY AND KENNETH CABRERA.
Capacity-constrained Traffic Assignment in Network with Residual Queues and Implementation in EMME/2 Tel.: , 16th.
Autonomous System
Routing in the Inernet Outcomes: –What are routing protocols used for Intra-ASs Routing in the Internet? –The Working Principle of RIP and OSPF –What is.
CSE 592 INTERNET CENSORSHIP (FALL 2015) LECTURE 16 PHILLIPA GILL - STONY BROOK U.
Measuring and Mitigating AS-level Adversaries Against Tor
Nathaniel Ley CIS235 Dec. 09, Why do we need Tor?  Encryption is not enough to ensure complete anonymity, since packet headers can still reveal.
Strengthening Tor against Eavesdropping Correlation Attacks Robert Thomas CSCE APR 2015 Audio:
Routing Protocols Brandon Wagner.
Traffic Correlation in Tor Source and Destination Prediction PETER BYERLEY RINDAL SULTAN ALANAZI HAFED ALGHAMDI.
1 Border Gateway Protocol (BGP) and BGP Security Jeff Gribschaw Sai Thwin ECE 4112 Final Project April 28, 2005.
Modified Onion Routing GYANRANJAN HAZARIKA AND KARAN MIRANI.
Distance Vector Routing
Modified Onion Routing GYANRANJAN HAZARIKA AND KARAN MIRANI.
Benjamin Knapic Nicholas Johnson.  “Tor is free software and an open network that helps you defend against a form of network surveillance that threatens.
Aaron Johnson Rob Jansen Aaron D. Jaggard Joan Feigenbaum
16장. Networking and Internetworking Devices
COMP 3270 Computer Networks
Introduction to Networks
Routing Protocols (RIP, OSPF, BGP).
© 2006 ITT Educational Services Inc.
Chapter 4: Finding the Shortest Path Lesson 1: Dijkstra’s Algorithm
CS590B/690B Detecting network interference (Spring 2018)
Presentation transcript:

LASTor: A Low-Latency AS-Aware Tor Client

Tor  Stands for The Onion Router  Goals: Anonymity ○ Each hop only knows previous and next hop on a path Low latency communication ○ 90% of Tor traffic is interactive

Problems on Tor  High latency in practice Over 90% of connections in Tor network incurs latencies over 5x than on the direct Internet path.  Anonymity can break down Path selection to establish a circuit in Tor is oblivious to Internet routing Autonomous System(AS) correlate traffic cross entry and exit segments of a circuit

Potential Solution  Measure latencies and routes from each relay to all end-hosts  Choose a path with low latency and no common Ases on both entry and exit segment  However, none of them is deployed yet

LASTor  A low-latency AS-aware Tor client  Improve poor latency for interactive communications Modify path selection to reduce latency  Prevent anonymity from breaking down AS-aware path selection

Improve poor latency  Factors of causing latency Propagation delay Queuing delay Transmission delay

Weighted Shortest Path  Based on the expected latency  Path with lower latency has high probability to be chosen  Clustering of relays

Effection on WSP  Shorter paths can greatly reduce latency  Path can not be derministic

Tunable Path Selection  User could balance anonymity and latency  Modified weight w to w (1-α) where 0 ≤α≤ 1

AS-aware Path Selection  Goal Detect common Ases on entry and exit segments  Manner AS set prediction algorithm

AS Set Prediction Algorithm  Modified version of Dijkstra’s algorithm  Predict ASes on all paths compliant with routing policies  Return a set of Ases on policy-compliant routes

Latency Comparison

Conclusion  LASTor client reduce latency and protect anonymity of Tor  LASTor can deliver a 25% reduction in median path latency