Tree Transducer-based Analysis of Cryptographic Protocols

In many cryptographic protocols, the actions performed by principals are iterative processes. However, in contrast to other classes of protocols, only very little is known about deciding the security of such protocols. To analyze decidability for these protocols, we propose a protocol model in which the actions of principals are described by tree transducers with regular look-ahead. The main result is that security in this model is decidable and EXPTIME-hard in presence of the standard Dolev-Yao intruder.

Vorschau

Logo BII

BII

Rechte

Nutzung und Vervielfältigung:

Keine Lizenz. Es gelten die Bestimmungen des deutschen Urheberrechts (UrhG).

Bitte beachten Sie, dass einzelne Bestandteile der Publikation anderweitigen Lizenz- bzw. urheberrechtlichen Bedingungen unterliegen können.

Zitieren

Zitierform:
Zitierform konnte nicht geladen werden.