Abstract
Some systems offer probabilistic anonymity. The degree of anonymity is considered and defined by Reiter and Rubin [1]. In this paper metrics are proposed to measure anonymity of probabilistic systems. The metric induces a topology on probabilistic applied π processes, which are used to model anonymous systems. The degree of anonymity is formally defined, and as an illustrating example, Crowds - an anonymous system for web transaction - is analyzed. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Cai, X., & Gu, Y. (2009). Measuring anonymity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5451 LNCS, pp. 183–194). https://doi.org/10.1007/978-3-642-00843-6_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
