Evaluation of dispersity routing strategies in anonymous communication

Dispersity routing is a flexible approach to increasing network capacity and fault tolerance. This paper addresses the issue of dispersity routing to achieve sender anonymity in case of large message anonymous communication or multiple paths of anonymous communication. We evaluate and compare sender anonymity of systems using disjoint and independent rerouting strategies in terms of anonymity degree. For a system having exactly one compromised node, and using a fixed-length disjoint k-path rerouting scheme, the maximum anonymity that can be achieved by the system are analyzed in terms of different path length. Our analytical data shows how anonymity degrees achieved by an independent rerouting scheme are better than those achieved by a disjoint rerouting scheme. These analytical results are useful for presentation of effective dispersity rerouting schemes combining the advantages of both disjoint and independent rerouting strategies.