One document found

Dissertation

Strategy properties for cryptographic protocols

In this thesis we introduce the alternating mu-calculus (AMC) for cryptographic protocols and show in which cases this logic is decidable and in which cases it is not. We also give tight complexity bounds for the decidable classes of this problem. We extend the constraint solving approach developed...