We propose a lightweight RFID authentication protocol that supports forward and backward
security. The only cryptographic mechanism that this protocol uses is a pseudorandom …

Derivability constraints represent in a symbolic way the infinite set of possible executions of
a finite protocol, in presence of an arbitrary active attacker. Solving a derivability constraint …

This thesis is about the formal verification and composition of security protocols, motivated
by applications to electronic voting protocols. Chapters 3 to 5 concern the verification of …

This paper extends existing models for collaborative systems. We investigate how much
damage can be done by insiders alone, without collusion with an outside adversary. In …

Formal, symbolic techniques are extremely useful for modelling and analysing security
protocols. They improved our understanding of security protocols, allowed to discover flaws …