Trust-based Anonymous Communication: Adversary Models and Routing Algorithms
Abstract
We introduce a novel model of routing security that incorporates the ordinarily overlooked variations in trust that users have for different parts of the network. We focus on anonymous communication, and in particular onion routing although we expect the approach to apply more broadly. This paper provides two main contributions. First, we present a novel model to consider the various security concerns for route selection in anonymity networks when users vary their trust over parts of the network. Second, to show the usefulness of our model, we present as an example a new algorithm to select paths in onion routing. We analyze its effectiveness against deanonymization and other information leaks, and particularly how it fares in our model versus existing algorithms, which do not consider trust. In contrast to those, we nd that our trust-based routing strategy can protect anonymity against an adversary capable of attacking a significant fraction of the network.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 2011
- Accession Number
- ADA602279
Entities
People
- Aaron M. Johnson
- Nick Mathewson
- Paul Syverson
- Roger Dingledine
Organizations
- United States Naval Research Laboratory