Flow logic for Dolev–Yao secrecy in cryptographic processes

Abstract

We introduce the ν spi-calculus that strengthens the notion of “perfect symmetric cryptography” of the spi-calculus by making encryption history dependent. We give our calculus an operational and a static semantics. The latter is a control flow analysis (CFA), defined in the form of a flow logic, and it is proved semantically correct. We then apply our CFA to check security properties; in particular, we show that secrecy à la Dolev–Yao can be expressed in terms of the CFA.