DagSemProc.05081.8.pdf
- Filesize: 275 kB
- 25 pages
Document
Probabilistic Anonymity
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 5081
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2006-01-31
Cite AsGet BibTex
Catuscia Palamidessi and Mohit Bhargava. Probabilistic Anonymity. In Foundations of Global Computing. Dagstuhl Seminar Proceedings, Volume 5081, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/DagSemProc.05081.8
https://doi.org/10.4230/DagSemProc.05081.8
Abstract
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.
Keywords
- Anonymity
- probability theory
- process calculi
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads