A unification-based decision procedure for cryptographic protocol analysis
- Publication date
- Publisher
Abstract
We present a sound and complete decision procedure for the
bounded process cryptographic protocol insecurity problem, based on the notion of normal proofs [2] and classical unification. We also show a result about the existence of attacks with “high” normal cuts. Our proof of correctness provides an alternate proof and new insights into the
fundamental result of Rusinowitch and Turuani [9] for the same setting