Intruders with Caps - Archive ouverte HAL Access content directly
Other Publications Year : 2007

Intruders with Caps

Abstract

In the analysis of cryptographic protocols, a "treacherous" set of terms is one from which an intruder can get access to what was intended to be secret, by adding on to the top of a sequence of elements of this set, a "cap" ormed of symbols legally part of his/her knowledge. In this paper, we give sufficient conditions on the rewrite system modeling the intruder's abilities, such as using encryption and decryption functions, to ensure that it is decidable if such caps exist. The following classes of intruder systems are studied: linear, dwindling, Delta-strong, and optimally reducing; and depending on the class considered, the cap problem (``find a cap for a given set of terms'') is shown respectively to be in P, NP-complete, decidable, and undecidable.
Fichier principal
Vignette du fichier
Lifo-RR2007-02.pdf (285.85 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00144178 , version 1 (02-05-2007)

Identifiers

  • HAL Id : hal-00144178 , version 1

Cite

Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch. Intruders with Caps. 2007. ⟨hal-00144178⟩
286 View
64 Download

Share

Gmail Mastodon Facebook X LinkedIn More