Anonymity in Probabilistic and Nondeterministic Systems

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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. Probabilistic process algebra have been of great help in the development of our setting. © 2006 Elsevier B.V. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Palamidessi, C. (2006). Anonymity in Probabilistic and Nondeterministic Systems. Electronic Notes in Theoretical Computer Science, 162(1), 277–279. https://doi.org/10.1016/j.entcs.2005.12.094

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free