Automated Proofs for Asymmetric Encryption

Abstract : Chosen-ciphertext security is by now a standard security property for asymmetric encryption. Many generic constructions for building secure cryptosystems from primitives with lower level of security have been proposed. Providing security proofs has also become standard practice. There is, however, a lack of automated verification procedures that analyze such cryp-tosystems and provide security proofs. This paper presents an automated procedure for analyzing generic asymmetric encryption schemes in the random oracle model. It has been applied to several examples of encryption schemes among which the construction of Bellare-Rogaway 1993, of Pointcheval at PKC'2000 and REACT.
Document type :
Book sections
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download
Contributor : Pascal Lafourcade <>
Submitted on : Thursday, April 5, 2018 - 6:41:08 PM
Last modification on : Friday, July 6, 2018 - 10:08:02 AM


Files produced by the author(s)


  • HAL Id : hal-01759951, version 1



J Courant, M Daubignard, C Ene, Pascal Lafourcade, Y Lakhnech. Automated Proofs for Asymmetric Encryption. Concurrency, Compositionality, and Correctness, Essays in Honor of Willem-Paul de Roever, 2010. ⟨hal-01759951⟩



Record views


Files downloads