| Abstract | In this paper, we supplement the "strand space" proof methods for cryptographic protocols developed in [?] by explaining another, heuristic advantage of the method. Namely, strand spaces help us draw informative pictures of cryptographic protocols, of attacks on protocols, of correctness theorems for protocols, and of crucial steps in the proofs.
As a consequence, it is possible to discover sharper characterizations of the goals of a protocol, and to discover more easily whether those goals are met. |
