Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or

Abstract : Security of a cryptographic protocol for a bounded number of sessions is usually expressed as a symbolic trace reachability problem. We show that symbolic trace reachability for well-defined protocols is decidable in presence of the exclusive or theory in combination with the homomorphism axiom. These theories allow us to model basic properties of important cryptographic operators. This trace reachability problem can be expressed as a system of symbolic de-ducibility constraints for a certain inference system describing the capabilities of the attacker. One main step of our proof consists in reducing deducibility constraints to constraints for deducibility in one step of the inference system. This constraint system, in turn, can be expressed as a system of quadratic equations of a particular form over Z/2Z[h], the ring of polynomials in one indeterminate over the finite field Z/2Z. We show that satisfiability of such systems is decidable.
Type de document :
Communication dans un congrès
Automata, Languages and Programming, 33rd International Colloquium, , Jul 2006, Venise, Italy
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01759947
Contributeur : Pascal Lafourcade <>
Soumis le : jeudi 5 avril 2018 - 18:30:44
Dernière modification le : vendredi 6 juillet 2018 - 10:08:02

Fichier

DLLT-icalp06.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01759947, version 1

Collections

Citation

Stéphanie Delaune, Pascal Lafourcade, Denis Lugiez, Ralf Treinen. Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or. Automata, Languages and Programming, 33rd International Colloquium, , Jul 2006, Venise, Italy. 〈hal-01759947〉

Partager

Métriques

Consultations de la notice

206

Téléchargements de fichiers

12