User Tools

Site Tools


Deciding Properties of Contract-Signing Protocols

Detelf Kähler, Ralf Küsters, and Thomas Wilke

We show that for infinite transition systems induced by cryptographic protocols in the Rusinowitch/Turuani style with finite number of sessions, unbounded message size, and the Dolev-Yao intruder certain fundamental branching properties are decidable. As a consequence, we obtain that crucial properties of contract-signing protocols such as balance are decidable.