Logical Relations for Encryption

More documents

Recommendations

Info

Extensions • Recursive functions/types for making the attackers Turing-complete — cf. [Pitts-98], [Crary-Harper], etc. • State/linearity for encoding protocols more precisely — cf. [Pitts-Stark-98], [Bierman-Pitts-Russo-00]
Related Work • Logical relations • Relational parametricity [Reynolds-83] • Representation independence [Mitchell-91] • λ-calculus with name generation [Stark-94] • Protocol verification • Various logics, theorem proving, model checking, etc. [many!] • In particular, spi-calculus [Abadi-Gordon]
Page 1 and 2: Logical Relations for Encryption Ei
Page 3 and 4: Motivation Two approaches to inform
Page 5 and 6: Example A program p(i) consisting o
Page 7 and 8: Example A program p(i) consisting o
Page 9 and 10: The Cryptographic λ-Calculus Simpl
Page 11 and 12: Secrecy ≅ Non-Interference ≅ Co
Page 13 and 14: Logical Relation [Q] How to prove c
Page 15 and 16: Logical Relation for Type Abstracti
Page 17 and 18: Logical Relation for Type Abstracti
Page 19 and 20: Logical Relation for Encryption (ne
Page 21 and 22: Overview • Introduction • The c
Page 23 and 24: Application: Protocol Encoding Enco
Page 25: Overview • Introduction • The c

Logical Relations for Encryption

Create successful ePaper yourself

Delete template?

Save as template?