The author investigates proofs of correctness of realistic security prools in a formal, intuitive setting. The prools examined include Kerberos versions, smartcard prools, non-repudiation prools, and certified email prools. The method of analysis turns out to be both powerful and flexible. This research advances significant extensions to the method of analysis, while the findings on the prools analysed are novel and illuminating.