Security Protocol Verification with Implicit Induction and Explicit Destructors
Abstract
We present a new method for automatic implicit induction theorem proving, and its application for the verification of a key distribution cryptographic protocol. The method can handle axioms between constructor terms, a feature generally not supported by other induction procedure. We use such axioms in order to specify explicit destructors representing cryptographic operators.
Origin : Files produced by the author(s)
Loading...