On the Decidability of Cryptographic Protocols with Open-ended Data Structures

zum Volltext (450 kB)   ZIP
Beteiligte Person(en) / Institution(en)Autor :
DatumErschienen :
  • April 2002
Seitenbereich47 Seiten

Formal analysis of cryptographic protocols has mainly concentrated on protocols with closed-ended data structures. That is, the messages exchanged between principals have fixed and finite format. However, in many protocols the data structures used are open-ended, i.e., messages have an unbounded number of data fields. This work studies decidability issues for protocols with open-ended data structures. We propose a protocol model in which principals are described by transducers, i.e., finite automata with output, and show that in this model security -- in presence of the standard Dolev-Yao intruder -- is decidable and PSPACE-hard.
Statische URLhttps://www.uni-kiel.de/journals/receive/jportal_jparticle_00000173
 
URN:NBNurn:nbn:de:gbv:8:1-zs-00000173-a3
IDNummer des Berichts :
  • TR_0204