StatVerif: Verification of Stateful Processes
Authors:
- Myrto ArapinisMAMyrto Arapinis
- Eike RitterEREike Ritter
- Mark D. RyanMRMark D. Ryan
- 1 June 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 33-47
Abstract
We present StatVerif, which is an extension the ProVerif process calculus with constructs for explicit state, in order to be able to reason about protocols that manipulate global state. Global state is required by protocols used in hardware devices (such as smart cards and the TPM), as well as by protocols involving databases that store persistent information. We provide the operational semantics of StatVerif. We extend the ProVerif compiler to a compiler for StatVerif: it takes processes written in the extended process language, and produces Horn clauses. Our compilation is carefully engineered to avoid many false attacks. We prove the correctness of the StatVerif compiler. We illustrate our method on two examples: a small hardware security device, and a contract signing protocol. We are able to prove their desired properties automatically.Keywords
This publication has 8 references indexed in Scilit:
- Formal Analysis of Protocols Based on TPM State Registers2011
- Abstraction by set-membership: verifying security protocols and web services with databases2010
- Automatic verification of correspondences for security protocolsJournal of Computer Security, 2009
- Analysing PKCS#11 Key Management APIs with Unbounded Fresh Data2009
- Applying protocol analysis to security device interfacesIEEE Security & Privacy, 2006
- An efficient cryptographic protocol verifier based on prolog rules2005
- Mobile values, new names, and secure communication2001
- Abuse-Free Optimistic Contract Signing1999