@inproceedings{fournet2011information-flow,
author = {Fournet, Cédric and Planul, Jérémy and Rezk, Tamara},
title = {Information-Flow Types for Homomorphic Encryptions},
booktitle = {18th ACM Conference on Computer and Communications Security (CCS'11)},
year = {2011},
month = {October},
abstract = {We develop a flexible information-flow type system for a range of encryption primitives, precisely reflecting their diverse functional and security features. Our rules enable encryption, blinding, homomorphic computation, and decryption, with selective key re-use for different types of payloads. We show that, under standard cryptographic assumptions, any well-typed probabilistic program using encryptions is secure (that is, computationally non-interferent) against active adversaries, both for confidentiality and integrity. We illustrate our approach using ElGamal and Paillier encryption. We present two applications of cryptographic verification by typing: (1) private search on data streams; and (2) the bootstrapping part of Gentry’s fully homomorphic encryption. We provide a prototype typechecker for our system.},
publisher = {ACM},
url = {http://approjects.co.za/?big=en-us/research/publication/information-flow-types-homomorphic-encryptions/},
pages = {351-360},
edition = {18th ACM Conference on Computer and Communications Security (CCS'11)},
}