Deciding knowledge in security protocols under equational theories

Martin Abadi Véronique Cortier 1
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies, INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in terms of message deducibility and indistinguishability relations. In this paper we study the decidability of these two relations. The messages in question may employ functions (encryption, decryption, etc.) axiomatized in an equational theory. Our main positive results say that, for a large and useful class of equational theories, deducibility and indistinguishability are both decidable in polynomial time.
Type de document :
Communication dans un congrès
Josep Diaz and Juhani Karhumäki and Arto Lepistö and Donald Theodore Sannella. The 31st International Colloquium on Automata, Languages and Programming - ICALP'2004, 2004, Turku, Finland, Springer, 3142, pp.148-164, 2004, Lecture Notes in Computer Science
Liste complète des métadonnées

https://hal.inria.fr/inria-00099982
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 10:13:04
Dernière modification le : jeudi 15 février 2018 - 08:48:09

Identifiants

  • HAL Id : inria-00099982, version 1

Citation

Martin Abadi, Véronique Cortier. Deciding knowledge in security protocols under equational theories. Josep Diaz and Juhani Karhumäki and Arto Lepistö and Donald Theodore Sannella. The 31st International Colloquium on Automata, Languages and Programming - ICALP'2004, 2004, Turku, Finland, Springer, 3142, pp.148-164, 2004, Lecture Notes in Computer Science. 〈inria-00099982〉

Partager

Métriques

Consultations de la notice

206