Measuring anonymity with relative entropy

Authors:
Yuxin Deng;Jun Pang;Peng Wu
Affiliations:
The University of New South Wales, School of Computer Science and Engineering, Sydney, Australia and Shanghai Jiaotong University, Department of Computer Science and Engineering, Shanghai, China;Carl von Ossietzky Universität Oldenburg, Department für Informatik, Oldenburg, Germany;INRIA Futurs and LIX, École Polytechnique, Palaiseau, France
Venue:
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Year:
2006

Citing 22
Cited 16

Communicating sequential processes

Communicating sequential processes
The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
Modeling and verification of randomized distributed real-time systems

Modeling and verification of randomized distributed real-time systems
Crowds: anonymity for Web transactions

ACM Transactions on Information and System Security (TISSEC)
Communication and Concurrency

Communication and Concurrency
The Metric Analogue of Weak Bisimulation for Probabilistic Processes

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
CSP and Anonymity

ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
PRISM: Probabilistic Symbolic Model Checker

TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Anonymous Connections and Onion Routing

SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Domain equations for probabilistic processes

Mathematical Structures in Computer Science
Covert channels and anonymizing networks

Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Symbolic Model Checking the Knowledge of the Dining Cryptographers

CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Metrics for labelled Markov processes

Theoretical Computer Science - Logic, semantics and theory of programming
Probabilistic anonymity

CONCUR 2005 - Concurrency Theory
Provable anonymity

Proceedings of the 2005 ACM workshop on Formal methods in security engineering
Probabilistic analysis of an anonymity system

Journal of Computer Security - Special issue on CSFW15
Information hiding, anonymity and privacy: a modular approach

Journal of Computer Security - Special issue on WITS'02
Towards an information theoretic metric for anonymity

PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Towards measuring anonymity

PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Anonymity protocols as noisy channels

TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Anonymity and covert channels in simple timed mix-firewalls

PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
Synchronous batching: from cascades to free routes

PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies

Anonymity protocols as noisy channels

Information and Computation
Analyzing an Electronic Cash Protocol Using Applied Pi Calculus

ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
On the Bayes risk in information-hiding protocols

Journal of Computer Security - 20th IEEE Computer Security Foundations Symposium (CSF)
Revisiting a combinatorial approach toward measuring anonymity

Proceedings of the 7th ACM workshop on Privacy in the electronic society
A Combinatorial Approach for an Anonymity Metric

ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
The bayesian traffic analysis of mix networks

Proceedings of the 16th ACM conference on Computer and communications security
Anonymity protocols as noisy channels

TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Formal approaches to information-hiding (Tutorial)

TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Trust in crowds: probabilistic behaviour in anonymity protocols

TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
A constraint satisfaction cryptanalysis of bloom filters in private record linkage

PETS'11 Proceedings of the 11th international conference on Privacy enhancing technologies
Formalization of entropy measures in HOL

ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Probable innocence in the presence of independent knowledge

FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Measuring query privacy in location-based services

Proceedings of the second ACM conference on Data and Application Security and Privacy
Computing the leakage of information-hiding systems

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Statistical measurement of information leakage

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Quantitative analysis of information flow using theorem proving

ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Anonymity is the property of maintaining secret the identity of users performing a certain action. Anonymity protocols often use random mechanisms which can be described probabilistically. In this paper, we propose a probabilistic process calculus to describe protocols for ensuring anonymity, and we use the notion of relative entropy from information theory to measure the degree of anonymity these protocols can guarantee. Furthermore, we prove that the operators in the probabilistic process calculus are non-expansive, with respect to this measuring method. We illustrate our approach by using the example of the Dining Cryptographers Problem.