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.
@InProceedings{palamidessi_et_al:DagSemProc.05081.8, author = {Palamidessi, Catuscia and Bhargava, Mohit}, title = {{Probabilistic Anonymity}}, booktitle = {Foundations of Global Computing}, pages = {1--25}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5081}, editor = {Jos\'{e} Luiz Fiadeiro and Ugo Montanari and Martin Wirsing}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05081.8}, URN = {urn:nbn:de:0030-drops-2992}, doi = {10.4230/DagSemProc.05081.8}, annote = {Keywords: Anonymity, probability theory, process calculi} }
Feedback for Dagstuhl Publishing