Le séminaire du LSV

Le séminaire du LSV a lieu le mardi à 11h00. Le lieu habituel est la salle de conférences au Pavillon des Jardins (plan d'accès). Pour être informé par email des prochains séminaires, contacter Stéphane Le Roux and Matthias Fuegger.

Le séminaire du LSV est public et ne nécessite aucune inscription préalable.

Séminaires passés

Making Random Choices Invisible to the Scheduler

Visiter le site web pour cet événement | Exporter cet événement au format iCalendar

Date
Le mardi 30 octobre 2007 à 11:00
Lieu
Salle de Conférence (Pavillon des Jardins)
Orateur
Kostas Chatzikokolakis (LIX, Ecole Polytechnique)

When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to resolve 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. In this talk I present a process-algebraic framework in which the control on the scheduler can be specified in syntactic terms, and I show how to apply it to solve the problem mentioned above. I also consider the definition of (probabilistic) may and must preorders, and show that they are precongruences with respect to the restricted schedulers. Furthermore, I show that all the operators of the language, except replication, distribute over probabilistic summation, which is a useful property for verification. This framework is applied to the dining cryptographers problem, where the scheduler problem comes into play.


À propos du LSV

Agenda des séminaires

Exporter l'agenda au format iCalendar | Les séminaires précédents

mar. 19 février

Les séminaires précédents