7 citations · 11 across the 3 of their papers we have counts for
3 papers
Intruder deducibility constraints with negation. Decidability and application to secured service compositions
Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch +1
The problem of finding a mediator to compose secured services has been reduced in our former work to the problem of solving deducibility constraints similar to those employed for c…
Satisfiability of General Intruder Constraints with and without a Set Constructor
Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch +1
Many decision problems on security protocols can be reduced to solving so-called intruder constraints in Dolev Yao model. Most constraint solving procedures for protocol security r…
Implementing a Unification Algorithm for Protocol Analysis with XOR
Max Tuengerthal, Ralf Kuesters, Mathieu Turuani
In this paper, we propose a unification algorithm for the theory which combines unification algorithms for $E\_{\std}$ and $E\_{\ACUN}$ (ACUN properties, like XOR) but compared…