Research
Symbolic and computational verification of security properties.
- One of my aims is to model and verify some security properties of
electronic voting protocoles (anomymity, verifiability, fairness
...).
- I also study wirelles communications protocols. My goal is to
understand how this new technology modifies existing modelings e.g.,
Dolev-Yao model.
- Finnaly, I would like increase intruder power in order to relax
perfect encryption assumption usually used in verification of
cryptographic protocols.
Seminars
Events
Projects
Current projects
- ANR Sesur
AVOTE: Formal analysis of e-voting protocols.
- ANR Sesur SCALP: Security of Cryptographic ALgorithms with Probabilities.
- ANR Sesur
SFINCS
: Securing Flow of INformation for Computing pervasive Systems.
Old projects where I was involved:
- RNTL
PROUVé Protocoles cryptographiques: Outils de Vérification automatique
- ACI Sécurité Informatique: ROSSIGNOL
Masters & Thesis
I propose some stages in MASTER:
If you are intrested by one of these subjects please send me an e-mail
including a cv, the title of the subject(s) chosen, and suggesting
some ideas for potential areas of study; I will want to see some
evidence that you've the same intrest as me on the subject, and
thought about whether I'm the right person to study with (if you're
scared by theoretical approaches, then you'd probably be better off
with somebody else).
These subjects can also be extended in PhD Subjects.
Education
Ph D supervised by Ralf Treinen (LSV) and Denis Lugiez (LIF), obtained the 25th of
September 2006 at ENS Cachan:
Verification of cryptographic protocols in presence of equational
theories.. My page at LSV.
Post-doctorat in Switzerland at ETHZ in the team Information Secutity of David Basin. My page at ETHZ.
Curriculum Vitae in french
or english.