How to Guarantee Secrecy for Cryptographic Protocols

Abstract : In this paper we propose a general definition of secrecy for cryptographic protocols in the Dolev-Yao model. We give a sufficient condition ensuring secrecy for protocols where rules have encryption depth at most two, that is satisfied by almost all practical protocols. The only allowed primitives in the class of protocols we consider are pairing and encryption with atomic keys. Moreover, we describe an algorithm of practical interest which transforms a cryptographic protocol into a secure one from the point of view of secrecy, without changing its original goal with respect to secrecy of nonces and keys, provided the protocol satisfies some conditions. These conditions are not very restrictive and are satisfied for most practical protocols.
Document type :
Other publications
Liste complète des métadonnées

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00138766
Contributor : Danièle Beauquier <>
Submitted on : Wednesday, March 28, 2007 - 9:59:48 AM
Last modification on : Thursday, January 11, 2018 - 6:19:28 AM
Document(s) archivé(s) le : Wednesday, April 7, 2010 - 3:06:27 AM

Files

SecrecyFull.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Danièle Beauquier, Frédéric Gauche. How to Guarantee Secrecy for Cryptographic Protocols. 2007. ⟨hal-00138766⟩

Share

Metrics

Record views

104

Files downloads

81