Information-Theoretic Homomorphic Encryption and 2-Party Computation

ePrint Report: Information-Theoretic Homomorphic Encryption and 2-Party Computation

Jonathan Trostle

Homomorphic encryption has been an active area of research since Gentry's breakthrough results on fully homomorphic encryption.
We present secret key somewhat homomorphic schemes where client privacy is information-theoretic (server can be computationally unbounded). As the group order in our schemes gets larger, entropy approaches max-
imal entropy (perfect security). Our basic scheme is additive somewhat homomorphic. In one scheme, the server handles circuit multiplication gates by returning the mulitiplicands …

area can client computation encryption entropy eprint report fully homomorphic encryption homomorphic encryption information key order party privacy report research results secret secret key server