Intruders with Caps - Archive ouverte HAL Access content directly
Conference Papers 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.
No file

Dates and versions

hal-00468721 , version 1 (31-03-2010)

Identifiers

  • HAL Id : hal-00468721 , version 1

Cite

Siva Anantharaman, Paliath Narendran, Michael Rusinowitch. Intruders with Caps. Rewriting Techniques and Applications - RTA'07, Jun 2007, Paris, France. pp.20--35. ⟨hal-00468721⟩
179 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More