Article ID Journal Published Year Pages File Type
423821 Electronic Notes in Theoretical Computer Science 2006 10 Pages PDF
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.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics