********************************************************************* * Ecole Normale Supe'rieure * * * * Se'minaire * * SEMANTIQUE ET INTERPRETATION ABSTRAITE * * P. Cousot * * * * Vendredi, 14h00--15h30 * * Salle R, etage -1 * * DI ENS 45 rue d'Ulm 75005 Paris * ********************************************************************* *** Vendredi 5 octobre 2002 **** 14h00 ****************************** Vitaly Shmatikov (SRI International) Constraint Solving for Cryptographic Protocol Analysis Re'sume': Protocol security properties such as secrecy and authentication can be characterized as reachability problems. While reachability is undecidable in general for cryptographic protocols, the problem has been proved decidable if the number of protocol instances is bounded. In my talk, I will demonstrate how a simple constraint satisfaction procedure can be used to decide reachability for a finite number of processes even in the presence of non-atomic (constructed) encryption keys. ********************************************************************* Pour recevoir l'annonce par courrier electronique: cousot@di.ens.fr WWW: http://www.di.ens.fr/~cousot/annonceseminaire.shtml *********************************************************************