Satisfiability of General Intruder Constraints with and without a Set Constructor - Archive ouverte HAL Access content directly
Journal Articles Journal of Symbolic Computation Year : 2017

Satisfiability of General Intruder Constraints with and without a Set Constructor

(1) , (2, 3) , (4) , (4)
1
2
3
4

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

Dates and versions

hal-01405842 , version 1 (01-12-2016)

Identifiers

Cite

Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch, Mathieu Turuani. Satisfiability of General Intruder Constraints with and without a Set Constructor. Journal of Symbolic Computation, 2017, Special issue: SI: Program Verification, 80, pp.27-61. ⟨10.1016/j.jsc.2016.07.009⟩. ⟨hal-01405842⟩
335 View
112 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More