Showing papers by "Vitaly Shmatikov published in 2001"

Constraint solving for bounded-process cryptographic protocol analysis

Abstract: The reachability problem for cryptographic protocols with non-atomic keys can be solved via a simple constraint satisfaction procedure.