Secrecy by typing in security protocols

We develop principles and rules for achieving secrecy properties in security protocols. Our approach is based on traditional classification techniques, and extends those techniques to handle concurrent processes that use shared-key cryptography. The rules have the form of typing rules for a basic concurrent language with cryptographic primitives, the spi calculus, They guarantee that, if a protocol typechecks, then it does not leak its secret inputs.