A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Information-flow types for homomorphic encryptions
2011
Proceedings of the 18th ACM conference on Computer and communications security - CCS '11
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
doi:10.1145/2046707.2046747
dblp:conf/ccs/FournetPR11
fatcat:zxpcuvctdncbhc5tfmwisr23fq