Anonymity on QuickSand: Using BGP to Compromise Tor
Author(s): Vanbever, Laurent; Li, Oscar; Rexford, Jennifer; Mittal, Prateek
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1tv7c
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Vanbever, Laurent | - |
dc.contributor.author | Li, Oscar | - |
dc.contributor.author | Rexford, Jennifer | - |
dc.contributor.author | Mittal, Prateek | - |
dc.date.accessioned | 2021-10-08T19:48:44Z | - |
dc.date.available | 2021-10-08T19:48:44Z | - |
dc.date.issued | 2014-10 | en_US |
dc.identifier.citation | Vanbever, Laurent, Oscar Li, Jennifer Rexford, and Prateek Mittal. "Anonymity on QuickSand: Using BGP to Compromise Tor." In Proceedings of the 13th ACM Workshop on Hot Topics in Networks (2014): pp. 1-7. doi:10.1145/2670518.2673869 | en_US |
dc.identifier.uri | http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.465.6751&rep=rep1&type=pdf | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr1tv7c | - |
dc.description.abstract | Anonymity systems like Tor are known to be vulnerable to malicious relay nodes. Another serious threat comes from the Autonomous Systems (ASes) that carry Tor traffic due to their powerful eavesdropping capabilities. Indeed, an AS (or set of colluding ASes) that lies between the client and the first relay, and between the last relay and the destination, can perform timing analysis to compromise user anonymity. In this paper, we show that AS-level adversaries are much more powerful than previously thought. First, routine BGP routing changes can significantly increase the number of ASes that can analyze a user's traffic successfully. Second, ASes can actively manipulate BGP announcements to put themselves on the paths to and from relay nodes. Third, an AS can perform timing analysis even when it sees only one direction of the traffic at both communication ends. Actually, asymmetric routing increases the fraction of ASes able to analyze a user's traffic. We present a preliminary evaluation of our attacks using measurements of BGP and Tor. Our findings motivate the design of approaches for anonymous communication that are resilient to AS-level adversaries. | en_US |
dc.format.extent | 1 - 7 | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartof | Proceedings of the 13th ACM Workshop on Hot Topics in Networks | en_US |
dc.rights | Author's manuscript | en_US |
dc.title | Anonymity on QuickSand: Using BGP to Compromise Tor | en_US |
dc.type | Conference Article | en_US |
dc.identifier.doi | 10.1145/2670518.2673869 | - |
pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceeding | en_US |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
AnonymityQuickSandBgpCompromise.pdf | 930.9 kB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.