Satisfiability of General Intruder Constraints with and without a Set Constructor

Abstract : Many decision problems on security protocols can be reduced to solving deduction constraints expressing whether an instance of a given message pattern can be constructed by the intruder. Most constraint solving procedures for protocol security rely on two properties of constraint systems called monotonicity} and variable-origination}. In this work we relax these restrictions by giving a decision procedure for solving general intruder constraints (that do not have these properties) that stays in NP. The result is also valid modulo an associative, commutative and idempotent theory. The procedure can be applied to verify security protocols in presence of multiple intruders.
Complete list of metadatas

Cited literature [45 references]  Display  Hide  Download

https://hal.inria.fr/hal-01405842
Contributor : Michaël Rusinowitch <>
Submitted on : Thursday, December 1, 2016 - 9:44:34 AM
Last modification on : Thursday, October 17, 2019 - 8:51:27 AM
Long-term archiving on : Monday, March 20, 2017 - 10:33:31 PM

File

main.pdf
Files produced by the author(s)

Identifiers

Citation

Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch, Mathieu Turuani. Satisfiability of General Intruder Constraints with and without a Set Constructor. Journal of Symbolic Computation, Elsevier, 2017, 80, pp. 27-61. ⟨10.1016/j.jsc.2016.07.009⟩. ⟨hal-01405842⟩

Share

Metrics

Record views

711

Files downloads

187