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

https://hal.archives-ouvertes.fr/hal-01906641
Contributor : Stéphanie Delaune <>
Submitted on : Saturday, October 27, 2018 - 11:13:59 AM
Last modification on : Tuesday, December 18, 2018 - 4:38:25 PM

Identifiers

Citation

Véronique Cortier, Antoine Dallon, Stéphanie Delaune. SAT-Equiv: An Efficient Tool for Equivalence Properties. CSF 2017 - 30th IEEE Computer Security Foundations Symposium, Aug 2017, Santa Barbara, France. ⟨10.1109/CSF.2017.15⟩. ⟨hal-01906641⟩

Share

Metrics

Record views

65