Skip to Main content Skip to Navigation

Sécurité des protocoles cryptographiques : aspects logiques et calculatoires

Abstract : This thesis is dedicated to the automatic verification of cryptographic protocols in the logical and computational settings.
The first part concerns the security of procotols in the logical (formal) framework. To begin with, we show how to specify various security properties of protocols (secrecy, authentication, resistance to dictionary attacks) in a concurrent language and how to analyze them automatically for a bounded number of sessions.
The second part deals with the computational soundness of logical models. We concentrate on static equivalence, applied notably to several kinds of encryption and data vulnerable to dictionary attacks (such as passwords). We show that under simple conditions, any (logical) proof of static equivalence between two messages implies their (computational) indistinguishability.
Document type :
Complete list of metadata

Cited literature [112 references]  Display  Hide  Download
Contributor : Ens Cachan Bibliothèque <>
Submitted on : Tuesday, April 10, 2007 - 4:41:53 PM
Last modification on : Monday, February 15, 2021 - 10:40:26 AM
Long-term archiving on: : Tuesday, April 6, 2010 - 11:09:51 PM


  • HAL Id : tel-00140916, version 1


Mathieu Baudet. Sécurité des protocoles cryptographiques : aspects logiques et calculatoires. Modélisation et simulation. École normale supérieure de Cachan - ENS Cachan, 2007. Français. ⟨tel-00140916⟩



Record views


Files downloads