Towards Automated Proofs for Asymmetric Encryption Schemes in the Random Oracle Model

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 cryptosystems and provide security proofs. This paper presents an automated procedure for analyzing generic asymmetric encryption schemes in the random oracle model. This procedure has been applied to several examples of en-cryption schemes among which the construction of Bellare
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01759943
Contributor : Pascal Lafourcade <>
Submitted on : Sunday, December 2, 2018 - 10:02:50 PM
Last modification on : Monday, December 3, 2018 - 1:16:41 AM

Links full text

Identifiers

Collections

Citation

Judicaël Courant, Marion Daubignard, Cristian Ene, Pascal Lafourcade, Yassine Lakhnech. Towards Automated Proofs for Asymmetric Encryption Schemes in the Random Oracle Model. the 15th ACM conference, Oct 2008, Alexandria, France. ⟨10.1145/1455770.1455817⟩. ⟨hal-01759943⟩

Share

Metrics

Record views

34