Deciding knowledge in security protocols under equational theories - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2004

Deciding knowledge in security protocols under equational theories

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5169.pdf (342.78 Ko) Télécharger le fichier

Dates and versions

inria-00071420 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071420 , version 1

Cite

Martin Abadi, Véronique Cortier. Deciding knowledge in security protocols under equational theories. [Research Report] RR-5169, INRIA. 2004, pp.22. ⟨inria-00071420⟩
75 View
211 Download

Share

Gmail Mastodon Facebook X LinkedIn More