Introduction Computationally sound prover Computationally sound logic Modular approach Case studies Conclusion

Bruno Blanchet1, David Pointcheval1 Jean Goubault-Larrecq2, Hubert Comon-Lundh2 Stéphanie Delaune2, Steve Kremer2 Véronique Cortier3, Mathieu Turuani3 Martín Abadi4[5mm] 1liens 2lsv 3loria 4ucsc & Microsoft Research

Description

Introduction Computationally sound prover Computationally sound logic Modular approach Case studies Conclusion FormaCrypt: Formal Computational Cryptography Bruno Blanchet1, David Pointcheval1 Jean Goubault-Larrecq2, Hubert Comon-Lundh2 Stephanie Delaune2, Steve Kremer2 Veronique Cortier3, Mathieu Turuani3 Martın Abadi4 1LIENS 2LSV 3LORIA 4UCSC & Microsoft Research November 2008 Bruno Blanchet et al FormaCrypt: Formal Computational Cryptography

• modular approach


• introduction computationally


• security protocols


• participants laboratoire d'informatique de l'ecole normale


• formal computational


• sound prover

Sujets

• Kremer

Informations

• Publié par: pefav
• Nombre de lectures: 10
• Langue: English

Extrait

IntroductionComupatitnolaylosnurodprCvepuomtitalanoosylldnucigolaraModuachCpproutidsasecnulseoConsi BnalBonurroamtpF:upatClmoetalchetaCryForm

FormaCrypt: Formal Computational Cryptography

hy

Bruno Blanchet 1 , David Pointcheval 1 Jean Goubault-Larrecq 2 , Hubert Comon-Lundh 2 StephanieDelaune 2 , Steve Kremer 2 VeroniqueCortier 3 , Mathieu Turuani 3 Martın Abadi 4

November 2008

2 LSV 3 LORIA 4 UCSC & Microsoft Research

1 LIENS

otpypargnoitrCla

Introduction studies Case Conclusion Computationally sound logic Modular approachComputationally sound prover ARA SSIA FormaCrypt: participants Laboratoired’Informatiquedel’EcoleNormaleSuperieure(LIENS) Bruno Blanchet David Monniaux (at VERIMAG since Sept. 1st, 2007) David Pointcheval LaboratoireSpecificationetVerification(LSV),ENSCachan Jean Goubault-Larrecq Mathieu Baudet (at DCSSI since July 1st, 2006) Hubert Comon-Lundh (from August 2007) StephanieDelaune(fromOctober2007) Steve Kremer LaurentMazare(October2006–April2007) Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA) VeroniqueCortier StephanieDelaune(January2007–September2007) HeinrichHordegen(PhdthesisdefendedinDecember2007) Mathieu Turuani Bogdan Warinschi (in Bristol since January 2007) Eugen Zalinescu (Phd thesis defended in December 2007) Scientific advisor: Martın Abadi Bruno Blanchet et al FormaCrypt: Formal Computational Cryptography

lCryptography

There are two main frameworks for analyzing security protocols: TheDolev-Yao model: a formal, abstract model. The cryptographic primitives areideal blackboxes. The adversary uses only those primitives. Proofs can be done automatically. Thecomputational model realistic model.: a The cryptographic primitives are functions on bit-strings. The adversary is a polynomial-time Turing machine. Proofs are done manually. Our goal:bridge the gap between these two frameworks.

ouysllnaerovprndoCnoitcuoitatupmlogioundularcModtutaoCpmllsyoianIntrod phraogptryfcsoofslocotorpci studCaseoachappr P n or suoinolceiCs rmalComputationaatFlroamrCpy:toFBroBunnclatehe