Programming Language Techniques for Cryptographic Proofs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Programming Language Techniques for Cryptographic Proofs


Certicrypt is a general framework to certify the security of cryptographic primitives in the Coq proof assistant. Certicrypt adopts the code-based paradigm, in which the statement of security, and the hypotheses under which it is proved, are expressed using probabilistic programs. It provides a set of programming language tools (observational equivalence, relational Hoare logic, semantics-preserving program transformations) to assist in constructing proofs. Earlier publications of Certicrypt provide an overview of its architecture and main components, and describe its application to signature and encryption schemes. This paper describes programming language techniques that arise specifically in cryptographic proofs. The techniques have been developed to complete a formal proof of IND-CCA security of the OAEP padding scheme. In this paper, we illustrate their usefulness for showing the PRP/PRF Switching Lemma, a fundamental cryptographic result that bounds the probability of an adversary to distinguish a family of pseudorandom functions from a family of pseudorandom permutations.
Fichier principal
Vignette du fichier
itp10.pdf (230.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00552894 , version 1 (10-01-2011)



Gilles Barthe, Benjamin Grégoire, Santiago Zanella-Béguelin. Programming Language Techniques for Cryptographic Proofs. ITP'10, 2010, Edinburgh, United Kingdom. pp.115-130, ⟨10.1007/978-3-642-14052-5_10⟩. ⟨inria-00552894⟩


157 View
197 Download



Gmail Facebook X LinkedIn More