z-logo
open-access-imgOpen Access
Probabilistic and Nondeterministic Aspects of Anonymity
Author(s) -
Catuscia Palamidessi
Publication year - 2006
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2005.11.050
Subject(s) - anonymity , nondeterministic algorithm , probabilistic logic , computer science , theoretical computer science , identity (music) , action (physics) , computer security , artificial intelligence , physics , quantum mechanics , acoustics
International audienceAnonymity means that the identity of the user performing a certain action is main- tained 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 no- tions of anonymity, at different levels of strength, for both the cases of probabilistic and nondeterministic users

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom