How to Bypass Two Anonymity Revocation Schemes

  • Authors:
  • George Danezis;Len Sassaman

  • Affiliations:
  • Microsoft Research, Cambridge, UK;ESAT/COSIC, K.U. Leuven, Leuven-Heverlee, Belgium B-3001

  • Venue:
  • PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In recent years, there have been several proposals for anonymous communication systems that provide intentional weaknesses to allow anonymity to be circumvented in special cases. These anonymity revocation schemes attempt to retain the properties of strong anonymity systems while granting a special class of people the ability to selectively break through their protections. We evaluate the two dominant classes of anonymity revocation systems, and identify fundamental flaws in their architecture, leading to a failure to ensure proper anonymity revocation, as well as introducing additional weaknesses for users not targeted for anonymity revocation.