Efficiently deciding equivalence for standard primitives and phases - Archive ouverte HAL Access content directly
Conference Papers Year :

Efficiently deciding equivalence for standard primitives and phases

(1, 2) , (3) , (4, 5, 6)
1
2
3
4
5
6

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.
Fichier principal
Vignette du fichier
main(24).pdf (630.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01900083 , version 1 (20-10-2018)

Identifiers

  • HAL Id : hal-01900083 , version 1

Cite

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⟩
150 View
60 Download

Share

Gmail Facebook Twitter LinkedIn More