Logical Relations for Encryption
Logical Relations for Encryption
Logical Relations for Encryption
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
The Cryptographic λ-Calculus<br />
Simply typed call-by-value λ-calculus<br />
+ (perfect) cryptographic primitives<br />
e ::= {e 1 } e2 | let {x} e1 = e 2 in e 3 else e 4<br />
| new x in e | k | ...<br />
τ ::= bits[τ] | key[τ] | ...