A Combinatorial Approach for an Anonymity Metric

  • Authors:
  • Dang Vinh Pham;Dogan Kesdogan

  • Affiliations:
  • Siegen University, Siegen, Germany;Siegen University, Siegen, Germany and NTNU-Norwegian University of Science and Technology, Trondheim, Norway

  • Venue:
  • ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.