Low-resource routing attacks against tor

  • Authors:
  • Kevin Bauer;Damon McCoy;Dirk Grunwald;Tadayoshi Kohno;Douglas Sicker

  • Affiliations:
  • University of Colorado, Boulder, CO;University of Colorado, Boulder, CO;University of Colorado, Boulder, CO;University of Washington, Seattle, WA;University of Colorado, Boulder, CO

  • Venue:
  • Proceedings of the 2007 ACM workshop on Privacy in electronic society
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Tor has become one of the most popular overlay networks for anonymizing TCP traffic. Its popularity is due in part to its perceived strong anonymity properties and its relatively low latency service. Low latency is achieved through Torâ聙聶s ability to balance the traffic load by optimizing Tor router selection to probabilistically favor routers with highbandwidth capabilities. We investigate how Torâ聙聶s routing optimizations impact its ability to provide strong anonymity. Through experiments conducted on PlanetLab, we show the extent to which routing performance optimizations have left the system vulnerable to end-to-end traffic analysis attacks from non-global adversaries with minimal resources. Further, we demonstrate that entry guards, added to mitigate path disruption attacks, are themselves vulnerable to attack. Finally, we explore solutions to improve Torâ聙聶s current routing algorithms and propose alternative routing strategies that prevent some of the routing attacks used in our experiments.