Active Intruders with Caps

Siva Anatharaman 1 Hai Lin Chris Lynch Paliath Narendran 2 Michael Rusinowitch 3
1 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans
2 University at Albany
3 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We address the insecurity problem for cryptographic protocols, for an active intruder and a bounded number of sessions. By modeling each protocol step as a rigid Horn clause, and the intruder abilities as an equational theory over a convergent rewrite system, the problem of active intrusion is formulated as a Cap Unification problem. Cap Unification is an extension of Equational Unification: we look for a cap to be placed on a given set of terms, so that it unifies with a given term modulo the equational theory.
Type de document :
Communication dans un congrès
FCS-ARSPA-WITS'08, Jun 2008, Pittsburgh, United States. 2008
Liste complète des métadonnées
https://hal.inria.fr/inria-00330532
Contributeur : Michaël Rusinowitch <>
Soumis le : mardi 14 octobre 2008 - 16:26:45
Dernière modification le : vendredi 6 juillet 2018 - 15:06:10

Identifiants

  • HAL Id : inria-00330532, version 1

Collections

INRIA | UNIV-ORLEANS | UNIV-FCOMTE | MSL | MSL-THESE | UNIV-BM | FEMTO-ST | UNIV-BM-THESE | LORIA | UNIV-LORRAINE

Citation

Siva Anatharaman, Hai Lin, Chris Lynch, Paliath Narendran, Michael Rusinowitch. Active Intruders with Caps. FCS-ARSPA-WITS'08, Jun 2008, Pittsburgh, United States. 2008. 〈inria-00330532〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

242

Contact


archive-ouverte@inria.fr