A number of papers are suggested with the goal to measure the quality of anonymity of a given anonymity system. Most of them use the anonymity set as the basis for developing, reasoning about and applying measure. In this paper we argue that these approaches are premature. In this work we suggest to use the so called hypothesis set - a term derived from possibilistic information flow theory. Investigating the hypothesis set, it is possible to make the "protection structure" explicit and also define well known terms from measurement theory like scale and metric. We demonstrate our approach by evaluating the hypothesis set of the classical Chaumian Mix. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Pham, D. V., & Kesdogan, D. (2009). A combinatorial approach for an anonymity metric. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5594 LNCS, pp. 26–43). https://doi.org/10.1007/978-3-642-02620-1_3
Mendeley helps you to discover research relevant for your work.