Selected publications at LSV

Privacy properties like anonymity or untraceability are now well identified, desirable goals of many security protocols. Such properties are typically stated as equivalence properties. However, automatically checking equivalence of protocols often yields efficiency issues.
    We propose an efficient algorithm, based on graph planning and SATsolving. It can decide equivalence for a bounded number of sessions, for protocols with standard cryptographic primitives and phases (often necessary to specify privacy properties), provided protocols are well-typed, that is encrypted messages cannot be confused. The resulting implementation, SAT-Equiv, demonstrates a significant speed-up w.r.t. other existing tools that decide equivalence, covering typically more than 100 sessions. Combined with a previous result, SAT-Equiv can now be used to prove security, for some protocols, for an unbounded number of sessions.

   address = {Barcelona, Spain},
   author = {V{\'e}ronique Cortier and Antoine Dallon and St{\'e}phanie Delaune},
   booktitle = {{P}roceedings of the 23rd {E}uropean {S}ymposium on {R}esearch in {C}omputer {S}ecurity ({ESORICS}'18)},
   DOI = {10.1007/978-3-319-99073-6\_24},
   editor = {Javier L{\'{o}}pez and Jianying Zhou and Miguel Soriano},
   month = sep,
   pages = {491-511},
   publisher = {Springer},
   series = {Lecture Notes in Computer Science},
   title = {Efficiently Deciding Equivalence for Standard Primitives and Phases},
   url = {},
   volume = {11098},
   year = {2018},

About LSV

Select by Year