Towards an Information Theoretic Metric for Anonymity

  • Andrei Serjantov
  • George Danezis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2482)

Abstract

In this paper we look closely at the popular metric of anonymity, the anonymity set, and point out a number of problems associated with it. We then propose an alternative information theoretic measure of anonymity which takes into account the probabilities of users sending and receiving the messages and show how to calculate it for a message in a standard mix-based anonymity system. We also use our metric to compare a pool mix to a traditional threshold mix, which was impossible using anonymity sets. We also show how the maximum route length restriction which exists in some fielded anonymity systems can lead to the attacker performing more powerful traffic analysis. Finally, we discuss open problems and future work on anonymity measurements.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Andrei Serjantov
    • 1
  • George Danezis
    • 1
  1. 1.University of Cambridge Computer LaboratoryCambridgeUK

Personalised recommendations