2005 · 63 citations · 29 references
ComputingComputer ScienceCryptographyFormal MethodsSecurity ProtocolsCryptographic AlgorithmsCryptographic ProtocolsDeductive VerificationPredicate LogicRelational AlgebraSecurity Protocol VerificationFormal Verification Of Cryptographic ProtocolsInformation HidingKey GenerationLogical RelationsNeedham-schroeder ProtocolParametricityPolymorphic TypesSecurity Proofs
The theory of relational parametricity and its logical relations proof technique are powerful tools for reasoning about information hiding in the polymorphic *-calculus. We investigate the application of these tools in the security domain by defining a cryptographic *-calculus--an extension of the standard simply typed *-calculus with primitives for encryption, decryption, and key generation-- and introducing syntactic logical relations (in the style of Pitts and Birkedal-Harper) for this calculus that can be used to prove behavioral equivalences between programs that use encryption. We illustrate the framework by encoding some simple security protocols, including the Needham- Schroeder public-key protocol. We give a natural account of the well-known attack on the original protocol and a straightforward proof that the improved variant of the protocol is secure.
29
On the security of public key protocols
Danny Dolev, A. Yao · IEEE Transactions on Information Theory · 1983 · 5.7K citations
A calculus for cryptographic protocols
Martı́n Abadi, Andrew D. Gordon · 1997 · 1.2K citations · Full text
Mobile values, new names, and secure communication
Martı́n Abadi, Cédric Fournet · 2001 · 843 citations
Philip Wadler · 1989 · 776 citations