Logical Relations for Encryption

More documents

Recommendations

Info

Example A program p(i) consisting of — a secret integer i and — an interface function λx. x mod 2 • Information hiding by type abstraction p(i) = pack int, 〈i, λx. x mod 2〉 as ∃α. α × (α → int)
Example A program p(i) consisting of — a secret integer i and — an interface function λx. x mod 2 • Information hiding by type abstraction p(i) = pack int, 〈i, λx. x mod 2〉 as ∃α. α × (α → int) • Information hiding by encryption p(i) = new k in 〈{i} k , λ{x} k . x mod 2〉
Page 1 and 2: Logical Relations for Encryption Ei
Page 3 and 4: Motivation Two approaches to inform
Page 5: 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 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?