Cet ouvrage fait partie de la bibliothèque YouScribe
Obtenez un accès à la bibliothèque pour le lire en ligne
En savoir plus

Introduction Assumptions On Shoup's lemma The proof To do Conclusion

De
25 pages
Introduction Assumptions On Shoup's lemma The proof To do Conclusion Automatic, computational proof of EKE using CryptoVerif (Work in progress) Bruno Blanchet Joint work with David Pointcheval CNRS, Ecole Normale Superieure, INRIA, Paris April 2010 Bruno Blanchet (CNRS, ENS, INRIA) EKE in CryptoVerif April 2010 1 / 20

  • eke using

  • precisely evaluated

  • computational diffie-hellman

  • password- based key

  • trivial protocol

  • sku ?


Voir plus Voir moins
IntroductionAssmutpoisnnOhSuopemslThmaroepToofoCodulcnnoisonurBENS,NR(CetchanBlVotpfireirpA102lINS,A)RIEiEKrynC01/20
´ CNRS, Ecole Normale Superieure, INRIA, Paris ´
Bruno Blanchet blanchet@di.ens.fr Joint work with David Pointcheval
April 2010
Automatic, computational proof of EKE using CryptoVerif (Work in progress)
ortnIAnoitcudmeamplsorfohTpeptiossumShounsOnisulnoodoTcnoCBetchNR(CnoruanBl02/2l2010
Motivation
EKE (Encrypted Key Exchange): A password-based key exchange protocol. A non-trivial protocol. It took some time before getting a computational proof of this protocol. Our goal: Mechanize, and automate as far as possible, its proof using the automatic computational protocol verifierCryptoVerif. This is an opportunity forseveral interesting extensionsof CryptoVerif. This work is still in progress.
VotpyrCnirpAfireINS,ENS,EiEKA)RI
Un pour Un
Permettre à tous d'accéder à la lecture
Pour chaque accès à la bibliothèque, YouScribe donne un accès à une personne dans le besoin