From Computationally-Proved Protocol Specifications to Implementations and Application to SSH

Abstract : This paper presents a novel technique for obtaining implementations of security protocols, proved secure in the computational model. We formally specify the protocol to prove, we prove this specification using the computationally-sound protocol verifier CryptoVerif, and we automatically translate it into an implementation in OCaml using a new compiler that we have implemented. We applied this approach to the SSH Transport Layer protocol: we proved the authentication of the server and the secrecy of the session keys in this protocol and verified that the generated implementation successfully interacts with OpenSSH. We explain these proofs, as well as an extension of CryptoVerif needed for the proof of secrecy of the session keys. The secrecy of messages sent over the SSH tunnel cannot be proved due to known weaknesses in SSH with CBC-mode encryption.
Type de document :
Article dans une revue
Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications (JoWUA), Innovative Information Science & Technology Research Group (ISYOU), 2013, 4 (1), pp.4--31
Liste complète des métadonnées

https://hal.inria.fr/hal-00863374
Contributeur : Ben Smyth <>
Soumis le : mercredi 18 septembre 2013 - 17:37:05
Dernière modification le : vendredi 25 mai 2018 - 12:02:06

Identifiants

  • HAL Id : hal-00863374, version 1

Collections

Citation

David Cadé, Bruno Blanchet. From Computationally-Proved Protocol Specifications to Implementations and Application to SSH. Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications (JoWUA), Innovative Information Science & Technology Research Group (ISYOU), 2013, 4 (1), pp.4--31. 〈hal-00863374〉

Partager

Métriques

Consultations de la notice

129