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 :
Conference papers
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/hal-01624274
Contributor : Véronique Cortier <>
Submitted on : Thursday, October 26, 2017 - 10:44:47 AM
Last modification on : Tuesday, December 18, 2018 - 4:38:25 PM
Long-term archiving on : Saturday, January 27, 2018 - 5:41:44 PM

File

CSF2017-SATequiv(1).pdf
Files produced by the author(s)

Identifiers

Citation

Véronique Cortier, Antoine Dallon, Stéphanie Delaune. SAT-Equiv: An Efficient Tool for Equivalence Properties. 30th IEEE Computer Security Foundations Symposium (CSF'17), Jul 2017, Santa Barbara, United States. pp.481 - 494, ⟨10.1109/CSF.2017.15⟩. ⟨hal-01624274⟩

Share

Metrics

Record views

752

Files downloads

149