2015 · 101 citations · 16 references
ComputingComputer ScienceMathematicsAlgebraCryptographyNumber TheoryClassical CryptographyCryptographic AlgorithmsCryptographic ComplexityData EncryptionHomomorphic EncryptionPrivacy-preserving ProtocolsCircuit EvaluationPrivacy
We show a technique to transform a linearly-homomorphic encryption into a scheme capable of evaluating degree-2 computations on ciphertexts. Our transformation is surprisingly simple and requires only one very mild property on the underlying linearly-homomorphic scheme: the message space must be a public ring in which it is possible to sample elements uniformly at random. This allows us to instantiate our transformation with virtually all existing number-theoretic linearly-homomorphic schemes, such as Goldwasser-Micali, Paillier, or ElGamal. Our resulting schemes achieve circuit privacy and are compact when considering a subclass of degree-2 polynomials where the number of additions of degree-2 terms is bounded by a constant.
16
Fully homomorphic encryption using ideal lattices
Craig Gentry · 2009 · 6.6K citations
Protocols for secure computations
Andrew Chi-Chih Yao · Foundations of Computer Science · 1982 · 2.7K citations
Shafi Goldwasser, Silvio Micali · Journal of Computer and System Sciences · 1984 · 2.6K citations