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 (UMR 6174), 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00099982
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 10:13:04 AM
Last modification on : Friday, July 6, 2018 - 3:06:10 PM

Identifiers

  • HAL Id : inria-00099982, version 1

Citation

Martin Abadi, Véronique Cortier. Deciding knowledge in security protocols under equational theories. The 31st International Colloquium on Automata, Languages and Programming - ICALP'2004, 2004, Turku, Finland, pp.148-164. ⟨inria-00099982⟩

Share

Metrics

Record views

227