Measuring Anonymity

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.

[1]  Tom Chothia,et al.  Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus , 2006, FORTE.

[2]  Vitaly Shmatikov,et al.  Probabilistic Model Checking of an Anonymity System , 2004 .

[3]  Radha Jagadeesan,et al.  Metrics for labelled Markov processes , 2004, Theor. Comput. Sci..

[4]  Mark Ryan,et al.  Analysis of an Electronic Voting Protocol in the Applied Pi Calculus , 2005, ESOP.

[5]  Andreas Pfitzmann,et al.  Anonymity, Unobservability, and Pseudonymity - A Proposal for Terminology , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[6]  Joseph Y. Halpern,et al.  Anonymity and information hiding in multiagent systems , 2005 .

[7]  Jun Pang,et al.  Analyzing an Electronic Cash Protocol Using Applied Pi Calculus , 2007, ACNS.

[8]  Gavin Lowe,et al.  Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR , 1996, Softw. Concepts Tools.

[9]  Hannes Federrath.  Designing Privacy Enhancing Technologies , 2001, Lecture Notes in Computer Science.

[10]  Jun Pang,et al.  Weak Probabilistic Anonymity , 2007, SecCO@CONCUR.

[11]  Radha Jagadeesan,et al.  The metric analogue of weak bisimulation for probabilistic processes , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[12]  Bart Preneel,et al.  Towards Measuring Anonymity , 2002, Privacy Enhancing Technologies.

[13]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[14]  Martín Abadi,et al.  Mobile values, new names, and secure communication , 2001, POPL '01.

[15]  Chris Hankin,et al.  Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , 2001, ACM-SIGACT Symposium on Principles of Programming Languages.

[16]  Vitaly Shmatikov.  Probabilistic analysis of an anonymity system , 2004, J. Comput. Secur..

[17]  Atsushi Fujioka,et al.  A Practical Secret Voting Scheme for Large Scale Elections , 1992, AUSCRYPT.

[18]  Jean Goubault-Larrecq,et al.  A Probabilistic Applied Pi-Calculus , 2007, APLAS.

[19]  Brian Campbell,et al.  Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.

[20]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[21]  Oliver Berthold,et al.  Dummy Traffic against Long Term Intersection Attacks , 2002, Privacy Enhancing Technologies.

[22]  Akinori Yonezawa,et al.  Software Security — Theories and Systems , 2003, Lecture Notes in Computer Science.

[23]  Martín Abadi,et al.  Hiding Names: Private Authentication in the Applied Pi Calculus , 2002, ISSS.

[24]  Shafi Goldwasser,et al.  Advances in Cryptology — CRYPTO’ 88: Proceedings , 1990, Lecture Notes in Computer Science.

[25]  Amos Fiat,et al.  Untraceable Electronic Cash , 1990, CRYPTO.

[26]  Tom Chothia,et al.  Metrics for Action-labelled Quantitative Transition Systems , 2006, QAPL.

[27]  Michael K. Reiter,et al.  Crowds: anonymity for Web transactions , 1998, TSEC.

[28]  Martín Abadi,et al.  Just Fast Keying in the Pi Calculus , 2004, ESOP.