Sciweavers

CSFW
2002
IEEE

Probabilistic Analysis of Anonymity

14 years 4 months ago
Probabilistic Analysis of Anonymity
We present a formal analysis technique for probabilistic security properties of peer-to-peer communication systems based on random message routing among members. The behavior of group members and the adversary is modeled as a discrete-time Markov chain, and security properties are expressed as PCTL formulas. To illustrate feasibility of the approach, we model the Crowds system for anonymous Web browsing, and use a probabilistic model checker, PRISM, to perform automated analysis of the system and verify anonymity guarantees it provides. The main result of the Crowds analysis is a demonstration of how certain forms of anonymity degrade with the increase in group size and the number of random routing paths.
Vitaly Shmatikov
Added 14 Jul 2010
Updated 14 Jul 2010
Type Conference
Year 2002
Where CSFW
Authors Vitaly Shmatikov
Comments (0)