Metrics for security and performance in low-latency anonymity systems

In this paper we explore the tradeoffs between security and performance in anonymity networks such as Tor. Using probability of path compromise -,Is a measure of security, we explore the behaviour of various path selection algorithms with a Tor path simulator. We denionstrate that assumptions about the relative expense of IP addresses and cheapness of bandwidth break down if attackers are allowed to purchase access to botnets, giving plentiful IP addresses, but each with relatively poor symmetric bandwidth. We further propose that the expected latency of data sent through a network is a useful performance metric, show how it juay be calculated, and demonstrate the counter-intuitive result that Tor's current path selection scheme, designed for performance, both performs well and is good for anonyinity in the presence of a botnetbased adversary.