Efficiently deciding equivalence for standard primitives and phases

Abstract : 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 SAT-solving. 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01900083
Contributor : Véronique Cortier <>
Submitted on : Saturday, October 20, 2018 - 9:45:43 PM
Last modification on : Tuesday, December 18, 2018 - 4:38:25 PM

File

main(24).pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01900083, version 1

Citation

Véronique Cortier, Antoine Dallon, Stéphanie Delaune. Efficiently deciding equivalence for standard primitives and phases. ESORICS 2018 - 23rd European Symposium on Research in Computer Security, Sep 2018, Barcelona, Spain. ⟨hal-01900083⟩

Share

Metrics

Record views

146

Files downloads

71