Automatic verification of temporal-epistemic properties of cryptographic protocols

Journal of Applied Non-Classical Logics 19 (4):463-487 (2009)
  Copy   BIBTEX

Abstract

We present a technique for automatically verifying cryptographic protocols specified in the mainstream specification language CAPSL. We define a translation from CAPSL models into interpreted systems, a popular semantics for temporal-epistemic logic, and rewrite CAPSL goals as temporal-epistemic specifications. We present a compiler that implements this translation. The compiler links to the symbolic model checker MCMAS. We evaluate the technique on protocols in the Clark-Jacobs library and in the SPORE repository against custom secrecy and authentication requirements.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-12-25

Downloads
59 (#279,072)

6 months
8 (#416,172)

Historical graph of downloads
How can I increase my downloads?