Deciding Epistemic and Strategic Properties of Cryptographic Protocols
We propose a new, widely applicable model for analyzing knowledge-based (epistemic) and strategic properties of cryptographic protocols. The main result we prove is that the corresponding model checking problem with respect to an expressive epistemic extension of ATL* is decidable. As an application, we prove that abuse-freeness of contract signing protocols is decidable, resolving an open question. Further, we discuss anonymous broadcast and a coin-flipping protocol
Use and reproduction:No Creative Commons License - The german copyright act (UrhG) appliesPlease note that individual components of the publication may be subject to other licensing or copyright conditions.