Intruder deducibility constraints with negation. Decidability and application to secured service compositions. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2012

Intruder deducibility constraints with negation. Decidability and application to secured service compositions.

Abstract

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 cryptographic protocol analysis. We extend in this paper the mediator synthesis procedure by a construction for expressing that some data is not accessible to the mediator. Then we give a decision procedure for verifying that a mediator satisfying this non-disclosure policy can be effectively synthesized. This procedure has been implemented in CL-AtSe, our protocol analysis tool. The procedure extends constraint solving for cryptographic protocol analysis in a significative way as it is able to handle negative deducibility constraints without restriction. In particular it applies to all subterm convergent theories and therefore covers several interesting theories in formal security analysis including encryption, hashing, signature and pairing.
Fichier principal
Vignette du fichier
fullver.pdf (763.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00719011 , version 1 (18-07-2012)

Identifiers

Cite

Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch, Mathieu Turuani. Intruder deducibility constraints with negation. Decidability and application to secured service compositions.. [Research Report] RR-8017, INRIA. 2012. ⟨hal-00719011⟩
493 View
555 Download

Altmetric

Share

Gmail Facebook X LinkedIn More