Making Random Choices Invisible to the Scheduler

Details Making Random Choices Invisible to the Scheduler Making Random Choices Invisible to the Scheduler

2007-05-24

arxiv.org/abs/0705.3503v1

Computer Science

Cryptography and Security

Scientific paper

When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to solve the nondeterminism. It has been observed that for certain applications, notably those in security, the scheduler needs to be restricted so not to reveal the outcome of the protocol's random choices, or otherwise the model of adversary would be too strong even for ``obviously correct'' protocols. We propose a process-algebraic framework in which the control on the scheduler can be specified in syntactic terms, and we show how to apply it to solve the problem mentioned above. We also consider the definition of (probabilistic) may and must preorders, and we show that they are precongruences with respect to the restricted schedulers. Furthermore, we show that all the operators of the language, except replication, distribute over probabilistic summation, which is a useful property for verification.

Affiliated with

Also associated with

No associations

Rating

Making Random Choices Invisible to the Scheduler 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 Making Random Choices Invisible to the Scheduler, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Making Random Choices Invisible to the Scheduler will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-606003