Cryptology ePrint Archive: Report 2005/020

(De)Compositions of Cryptographic Schemes and their Applications to Protocols

R. Janvier and Y. Lakhnech and L. Mazare

Abstract: The main result of this paper is that the Dolev-Yao model is a safe abstraction of the computational model for security protocols including those that combine asymmetric and symmetric encryption, signature and hashing. Moreover, message forwarding and private key transmission are allowed. To our knowledge this is the first result that deals with hash functions and the combination of these cryptographic primitives.

A key step towards this result is a general definition of correction of cryptographic primitives, that unifies well known correctness criteria such as IND-CPA, IND-CCA, unforgeability etc.... and a theorem that allows to reduce the correctness of a composition of two cryptographic schemes to the correctness of each one.

Category / Keywords: cryptographic protocols / Security, Cryptographic Protocols, Formal Encryption, Probabilistic Encryption, Dolev-Yao Model, Computational Model

Publication Info: Unpublished

Date: received 14 Jan 2005, last revised 10 Jun 2005

Contact author: laurent mazare at imag fr

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: This revision includes a new simplified proof of the reduction theorem.

Version: 20050610:130208 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]