When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-2992
Go to the corresponding Portal

Palamidessi, Catuscia ; Bhargava, Mohit

Probabilistic Anonymity

05081.PalamidessiCatuscia.Paper.299.pdf (0.3 MB)


The concept of anonymity comes into play in a wide range of situations, varying from voting and anonymous donations to postings on bulletin boards and sending mails. A formal definition of this concept has been given in literature in terms of nondeterminism. In this paper, we investigate a notion of anonymity based on probability theory, and we we discuss the relation with the nondeterministic one. We then formulate this definition in terms of observables for processes in the probabilistic $pi$-calculus, and propose a method to verify automatically the anonymity property. We illustrate the method by using the example of the dining cryptographers.

BibTeX - Entry

  author =	{Catuscia Palamidessi and Mohit Bhargava},
  title =	{Probabilistic Anonymity},
  booktitle =	{Foundations of Global Computing},
  year =	{2006},
  editor =	{Jos{\'e} Luiz Fiadeiro and Ugo Montanari and Martin Wirsing},
  number =	{05081},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{},
  annote =	{Keywords: Anonymity, probability theory, process calculi}

Keywords: Anonymity, probability theory, process calculi
Collection: 05081 - Foundations of Global Computing
Issue Date: 2006
Date of publication: 31.01.2006

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI