Fully Homomorphic Encryption with Polylog Overhead

  • Craig Gentry
  • Shai Halevi
  • Nigel P. Smart
Conference paper

DOI: 10.1007/978-3-642-29011-4_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7237)
Cite this paper as:
Gentry C., Halevi S., Smart N.P. (2012) Fully Homomorphic Encryption with Polylog Overhead. In: Pointcheval D., Johansson T. (eds) Advances in Cryptology – EUROCRYPT 2012. EUROCRYPT 2012. Lecture Notes in Computer Science, vol 7237. Springer, Berlin, Heidelberg

Abstract

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\cdot \mbox{polylog}(\lambda )\).

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 applied to “packed” ciphertexts that encrypt vectors of plaintext elements. In this work, we introduce permuting/routing techniques to move plaintext elements across these vectors efficiently. Hence, we are able to implement general arithmetic circuit in a batched fashion without ever needing to “unpack” the plaintext vectors.

We also introduce some other optimizations that can speed up homomorphic evaluation in certain cases. For example, we show how to use the Frobenius map to raise plaintext elements to powers of p at the “cost” of a linear operation.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2012

Authors and Affiliations

  • Craig Gentry
    • 1
  • Shai Halevi
    • 1
  • Nigel P. Smart
    • 2
  1. 1.IBM T.J. Watson Research CenterYorktown HeightsU.S.A.
  2. 2.Dept. Computer ScienceUniversity of BristolBristolUnited Kingdom

Personalised recommendations