Unification modulo Block Chaining - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2011

Unification modulo Block Chaining

Résumé

We model block chaining in terms of a simple, convergent, rewrite system over a signature with two disjoint sorts: list and element. By interpreting a particular symbol of this signature suitably, the rewrite system can model several practical situations of interest. An inference procedure is presented for deciding the unification problem modulo this rewrite system. The procedure is modular in the following sense: any given problem is handled by a system of 'list-inferences', and the set of equations thus derived between the element-terms of the problem is then handed over to any ('black-box') procedure which is complete for solving these element-equations. An example of application of this unification procedure is given, as attack detection on a Needham-Schroeder like protocol employing the CBC encryption mode.
Fichier non déposé

Dates et versions

inria-00618376 , version 1 (01-09-2011)

Identifiants

  • HAL Id : inria-00618376 , version 1

Citer

Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michael Rusinowitch. Unification modulo Block Chaining. [Research Report] 2011. ⟨inria-00618376⟩
154 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More