Tree automata with one memory, set constraints and cryptographic protocols - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2005

Tree automata with one memory, set constraints and cryptographic protocols

Abstract

We introduce a class of tree automata that perform tests on a memory that is updated using function symbol application and projection. The language emptiness problem for this class of tree automata is shown to be in DEXPTIME. We also introduce a class of set constraints with equality tests and prove its decidability by completion techniques and a reduction to tree automata with one memory. Finally, we show how to apply these results to cryptographic protocols. We introduce a class of cryptographic protocols and show the decidability of secrecy for an arbitrary number of agents and an arbitrary number of (concurrent or successive) sessions, provided that only a bounded number of new data is generated. The hypothesis on the protocol (a restricted copying ability) is shown to be necessary: without this hypothesis, we prove that secrecy is undecidable, even for protocols without nonces.

Dates and versions

inria-00000553 , version 1 (02-11-2005)

Identifiers

Cite

Hubert Comon-Lundh, Véronique Cortier. Tree automata with one memory, set constraints and cryptographic protocols. Theoretical Computer Science, 2005, 331 (1), pp.143-214. ⟨10.1016/j.tcs.2004.09.036⟩. ⟨inria-00000553⟩
94 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More