Probabilistic and Nondeterministic Aspects of Anonymity

Authors:
Catuscia Palamidessi
Affiliations:
INRIA and LIX, École Polytechnique, Rue de Saclay, 91128 Palaiseau Cedex, FRANCE
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 6
Cited 4

The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
Crowds: anonymity for Web transactions

ACM Transactions on Information and System Security (TISSEC)
CSP and Anonymity

ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
Anonymous Connections and Onion Routing

SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Information hiding, anonymity and privacy: a modular approach

Journal of Computer Security - Special issue on WITS'02
The modelling and analysis of security protocols: the csp approach

The modelling and analysis of security protocols: the csp approach

Non-determinism and Probabilities in Timed Concurrent Constraint Programming

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Measuring Anonymous Systems with the Probabilistic Applied Pi Calculus

ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
Probabilistic anonymity via coalgebraic simulations

ESOP'07 Proceedings of the 16th European conference on Programming
Probabilistic anonymity via coalgebraic simulations

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.