Probabilistic Anonymity

Palamidessi, Catuscia; Bhargava, Mohit

doi:10.4230/DagSemProc.05081.8

Document

Probabilistic Anonymity

Authors Catuscia Palamidessi, Mohit Bhargava

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 5081
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2006-01-31

PDF

File

PDF

DagSemProc.05081.8.pdf

Filesize: 275 kB
25 pages

Document Identifiers

DOI: 10.4230/DagSemProc.05081.8
URN: urn:nbn:de:0030-drops-2992

Subject Classification

Keywords

Anonymity
probability theory
process calculi

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get 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

Author Details

Catuscia Palamidessi

Mohit Bhargava

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail