26 Pages
English

Introduction Symbolic and computational models Soundness theorem Conclusion

-

Gain access to the library to view online
Learn more

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


Subjects

Informations

Published by
Reads 28
Language English
nItorudctoinySbmoilcnadcopmtutaoianlomedsloSnundesstehroemGuessingAttacksandtheComputationalSoundnessofStaticEquivalenceMathieuBaudetJointworkwithMartı´nAbadiandBogdanWarinschiFormacrypt–Mar.6,2006oCcnulsoin
nItorudctoinySbmoilcnadcopmtutaoianlomedslSStudyingcryptographicprotocolsTwoapproaches:Symbolicmodelsonundesstehroem+nowhighlyautomatizedrestrictedtoNeedham-Schroederattackers(a.k.a.Dolev-Yaoones)wemaymisssomeattacksComputationalmodels+arbitraryPPTIMEadversary(sofar)hand-made,complexreductionproofsCocnulsoin