Automated Proofs for Asymmetric Encryption - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2010

Automated Proofs for Asymmetric Encryption

J Courant
  • Fonction : Auteur
M Daubignard
  • Fonction : Auteur
C Ene
  • Fonction : Auteur
Pascal Lafourcade
Y Lakhnech
  • Fonction : Auteur

Résumé

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.
Fichier principal
Vignette du fichier
ccs.pdf (376.19 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01759951 , version 1 (05-04-2018)

Identifiants

  • HAL Id : hal-01759951 , version 1

Citer

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⟩
58 Consultations
150 Téléchargements

Partager

Gmail Facebook X LinkedIn More