Abstract. We show that for infinite transition systems induced by cryptographic protocols in the Rusinowitch/Turuani style certain fundamental branching properties are decidable. ...
Research on the automatic analysis of cryptographic protocols has so far mainly concentrated on reachability properties, such as secrecy and authentication. Only recently it was sh...
We develop a general method for proving properties of contract-signing protocols using a specialized protocol logic. The method is applied to the Asokan-ShoupWaidner and the Garay...
Michael Backes, Anupam Datta, Ante Derek, John C. ...
We present three case studies, investigating the use of probabilistic model checking to automatically analyse properties of probabilistic contract signing protocols. We use the pr...