Skip to main content

RAPTOR: Routing Attacks on Privacy in Tor

Author(s): Sun, Yixin; Edmundson, Anne; Vanbever, Laurent; Li, Oscar; Rexford, Jennifer; et al

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1gv9r
Abstract: The Tor network is a widely used system for anonymous communication. However, Tor is known to be vulnerable to attackers who can observe traffic at both ends of the communication path. In this paper, we show that prior attacks are just the tip of the iceberg. We present a suite of new attacks, called Raptor, that can be launched by Autonomous Systems (ASes) to compromise user anonymity. First, AS-level adversaries can exploit the asymmetric nature of Internet routing to increase the chance of observing at least one direction of user traffic at both ends of the communication. Second, AS-level adversaries can exploit natural churn in Internet routing to lie on the BGP paths for more users over time. Third, strategic adversaries can manipulate Internet routing via BGP hijacks (to discover the users using specific Tor guard nodes) and interceptions (to perform traffic analysis). We demonstrate the feasibility of Raptor attacks by analyzing historical BGP data and Traceroute data as well as performing real-world attacks on the live Tor network, while ensuring that we do not harm real users. In addition, we outline the design of two monitoring frameworks to counter these attacks: BGP monitoring to detect control-plane attacks, and Traceroute monitoring to detect data-plane anomalies. Overall, our work motivates the design of anonymity systems that are aware of the dynamics of Internet routing.
Publication Date: 2015
Citation: Sun, Yixin, Anne Edmundson, Laurent Vanbever, Oscar Li, Jennifer Rexford, Mung Chiang, and Prateek Mittal. "RAPTOR: Routing Attacks on Privacy in Tor." In 24th USENIX Security Symposium (2015): pp. 271-286.
Pages: 271 - 286
Type of Material: Conference Article
Journal/Proceeding Title: 24th USENIX Security Symposium
Version: Final published version. This is an open access article.



Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.