Introduction Symbolic and computational models Soundness theorem Conclusion

Mathieu Baudet

Description

Introduction Symbolic and computational models Soundness theorem Conclusion Guessing Attacks and the Computational Soundness of Static Equivalence Mathieu Baudet Joint work with Martın Abadi and Bogdan Warinschi Formacrypt – Mar. 6, 2006

• passwords used


• introduction symbolic


• dolev-yao ones


• multiple passwords


• help design


• justify symbolic models


• automatized ?


• studying cryptographic


• static equivalence

Sujets

• Needham
• Baudet

Informations

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

Extrait

nItorudctoinySbmoilcnadcopmtutaoianlomedsloSnundesstehroem GuessingAttacksandtheComputational SoundnessofStaticEquivalence MathieuBaudet JointworkwithMartı´nAbadiandBogdanWarinschi Formacrypt–Mar.6,2006 oCcnulsoin

nItorudctoinySbmoilcnadcopmtutaoianlomedslS Studyingcryptographicprotocols Twoapproaches: •Symbolicmodels onundesstehroem +nowhighlyautomatized − restrictedtoNeedham-Schroederattackers(a.k.a. Dolev-Yaoones) →wemaymisssomeattacks •Computationalmodels +arbitraryPPTIMEadversary −(sofar)hand-made,complexreductionproofs Cocnulsoin