## Logical Relations for Encryption (2002)

### Cached

### Download Links

- [www.cis.upenn.edu]
- [www.cis.upenn.edu]
- [www.yl.is.s.u-tokyo.ac.jp]
- [web.yl.is.s.u-tokyo.ac.jp]
- [www.kb.ecei.tohoku.ac.jp]
- DBLP

### Other Repositories/Bibliography

Citations: | 38 - 2 self |

### BibTeX

@MISC{Sumii02logicalrelations,

author = {Eijiro Sumii and Benjamin C. Pierce},

title = {Logical Relations for Encryption},

year = {2002}

}

### Years of Citing Articles

### OpenURL

### Abstract

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