SAT-Equiv: an efficient tool for equivalence properties

Abstract : Automatic tools based on symbolic models have been successful in analyzing security protocols. Such tools are particularly adapted for trace properties (e.g. secrecy or authentication), while they often fail to analyse equivalence properties. Equivalence properties can express a variety of security properties , including in particular privacy properties (vote privacy, anonymity, untraceability). Several decision procedures have already been proposed but the resulting tools are rather inefficient. In this paper, we propose a novel algorithm, based on graph planning and SAT-solving, which significantly improves the efficiency of the analysis of equivalence properties. The resulting implementation, SAT-Equiv, can analyze several sessions where most tools have to stop after one or two sessions.
Document type :
Reports
Liste complète des métadonnées

Cited literature [29 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01529966
Contributor : Antoine Dallon <>
Submitted on : Wednesday, May 31, 2017 - 3:48:11 PM
Last modification on : Tuesday, December 18, 2018 - 4:38:25 PM
Document(s) archivé(s) le : Wednesday, September 6, 2017 - 4:57:40 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01529966, version 1

Citation

Véronique Cortier, Antoine Dallon, Stéphanie Delaune. SAT-Equiv: an efficient tool for equivalence properties. [Research Report] LSV, ENS Cachan, CNRS, INRIA, Université Paris-Saclay, Cachan (France); IRISA, Inria Rennes; LORIA - Université de Lorraine; CNRS. 2017. ⟨hal-01529966⟩

Share

Metrics

Record views

540

Files downloads

427