Abstract
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be described probabilistically. The user, on the other hand, may be selected either nondeterministically or probabilistically. We investigate various notions of anonymity, at different levels of strength, for both the cases of probabilistic and nondeterministic users.
| Original language | English |
|---|---|
| Pages (from-to) | 33-42 |
| Number of pages | 10 |
| Journal | Electronic Notes in Theoretical Computer Science |
| Volume | 155 |
| Issue number | 1 SPEC. ISS. |
| DOIs | |
| Publication status | Published - 12 May 2006 |
Keywords
- Anonymity
- Probabilistic Automata
- conditional probability