Logical Relations for Encryption

More documents

Recommendations

Info

Overview • Introduction • The cryptographic λ-calculus • <strong>Logical</strong> relations • Application: protocol encoding • Extensions • Related work • Conclusion
The Cryptographic λ-Calculus Simply typed call-by-value λ-calculus + (perfect) cryptographic primitives e ::= {e 1 } e2 | let {x} e1 = e 2 in e 3 else e 4 | new x in e | k | ... τ ::= bits[τ] | key[τ] | ...
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: Example A program p(i) consisting o
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 and 26: Overview • Introduction • The c
Page 27 and 28: Related Work • Logical relations

Logical Relations for Encryption

Create successful ePaper yourself

Delete template?

Save as template?