Probabilistic Anonymity and Admissible Schedulers

Details Probabilistic Anonymity and Admissible Schedulers Probabilistic Anonymity and Admissible Schedulers

2007-06-07

arxiv.org/abs/0706.1019v1

Computer Science

Cryptography and Security

Scientific paper

When studying safety properties of (formal) protocol models, it is customary to view the scheduler as an adversary: an entity trying to falsify the safety property. We show that in the context of security protocols, and in particular of anonymizing protocols, this gives the adversary too much power; for instance, the contents of encrypted messages and internal computations by the parties should be considered invisible to the adversary. We restrict the class of schedulers to a class of admissible schedulers which better model adversarial behaviour. These admissible schedulers base their decision solely on the past behaviour of the system that is visible to the adversary. Using this, we propose a definition of anonymity: for all admissible schedulers the identity of the users and the observations of the adversary are independent stochastic variables. We also develop a proof technique for typical cases that can be used to proof anonymity: a system is anonymous if it is possible to `exchange' the behaviour of two users without the adversary `noticing'.

Affiliated with

Also associated with

No associations

Rating

Probabilistic Anonymity and Admissible Schedulers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Probabilistic Anonymity and Admissible Schedulers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic Anonymity and Admissible Schedulers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-442275