Fully Homomorphic Encryption with Polylog Overhead

@article{Gentry2011FullyHE,
  title={Fully Homomorphic Encryption with Polylog Overhead},
  author={Craig Gentry and Shai Halevi and Nigel P. Smart},
  journal={IACR Cryptology ePrint Archive},
  year={2011},
  volume={2011},
  pages={566}
}
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorphic encryption (FHE) schemes that for security parameter λ can evaluate any width-Ω(λ) circuit with t gates in time t · polylog(λ). To get low overhead, we use the recent batch homomorphic evaluation techniques of Smart-Vercauteren and Brakerski-Gentry-Vaikuntanathan, who showed that homomorphic operations can be… CONTINUE READING
Highly Influential
This paper has highly influenced 18 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 377 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 200 extracted citations

378 Citations

0204060'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 378 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Fully homomorphic encryption with polylog overhead

  • C. Gentry, S. Halevi, N. P. Smart
  • Full version at http://eprint.iacr.org//566
  • 2011
Highly Influential
7 Excerpts

Optimal rearrangeable multistage connecting networks

  • V. E. Beneš
  • Bell System Technical Journal 43
  • 1964
Highly Influential
5 Excerpts