Abstract
We propose a new, widely applicable model for analyzing knowledge-based (epistemic) and strategic properties of cryptographic protocols. We prove that the corresponding model checking problem with respect to an expressive epistemic strategic logic is decidable. As corollaries, we obtain decidability of complex security properties including coercion-resistance of voting protocols, accountability of protocols using a trusted third party, and abuse-freeness of contract signing protocols. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Schnoor, H. (2012). Deciding epistemic and strategic properties of cryptographic protocols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7459 LNCS, pp. 91–108). https://doi.org/10.1007/978-3-642-33167-1_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
