//img.uscri.be/pth/ae41e991be278290349be84291c69262874b067d
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 Symbolic and computational models Soundness theorem Conclusion

De
26 pages
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


Voir plus Voir moins
nItorudctoinySbmoilcnadcopmtutaoianlomedsloSnundesstehroemGuessingAttacksandtheComputationalSoundnessofStaticEquivalenceMathieuBaudetJointworkwithMartı´nAbadiandBogdanWarinschiFormacrypt–Mar.6,2006oCcnulsoin
nItorudctoinySbmoilcnadcopmtutaoianlomedslSStudyingcryptographicprotocolsTwoapproaches:Symbolicmodelsonundesstehroem+nowhighlyautomatizedrestrictedtoNeedham-Schroederattackers(a.k.a.Dolev-Yaoones)wemaymisssomeattacksComputationalmodels+arbitraryPPTIMEadversary(sofar)hand-made,complexreductionproofsCocnulsoin