The LSV seminar takes place on Tuesday at 11:00 AM. The usual location is the conference room at Pavillon des Jardins (venue). If you wish to be informed by e-mail about upcoming seminars, please contact Stéphane Le Roux and Matthias Fuegger.
The seminar is open to public and does not require any form of registration.
Since the 1980s, two approaches have been developed for analyzing
security protocols. One of the approaches relies on a computational
model that considers issues of complexity and probability. This
approach captures a strong notion of security, guaranteed
against all probabilistic polynomial-time attacks. The other approach
relies on a symbolic model of protocol executions in which
cryptographic primitives are treated as black boxes. Since the seminal
work of Dolev and Yao, it has been realized that this latter approach
enables significantly simpler and often automated proofs. However, the
guarantees that it offers have been quite unclear.
In this talk, we present several approaches that enable to obtain the best of both worlds: fully automated proofs and strong, clear security guarantees.