How to compute without knowing anything

on

In my post on quantum inspired classical results, I gave as one example Gentry’s recent discovery of a fully homomorphic encryption scheme. His beautiful work deserves its own blog post. Initially I approached his work with trepidation, worried that it would be so technical I would not understand anything without a lot of work. Others have mentioned not  having looked at his work for the same reason. That is a shame! While the details are technical, the key idea, bootstrappable encryption, is both a non-obvious approach and an easily understandable concept.  I remember smiling while I read the first couple of pages of his paper in response to the elegance and surprising simplicity of his approach.

As I described in my previous post, a fully homomorphic encryption scheme enables arbitrary computations to be performed on encrypted data. In particular, it enables a trusted-but-curious third party to perform computations on data you have encrypted, return an encrypted result to you without having learned anything about the encrypted values which you can then decrypt to learn the result of the computation. Gentry’s 2009 scheme answers an old  for modern cryptography (1978) question as to whether fully homomorphic encryption schemes exist.

Progress in homomorphic encryption over the intervening years focused on finding more powerful schemes that could perform more general types of computation over encrypted data than previous approaches. Fully homomorphic encryption is sometimes called algebraically homomorphic encryption or doubly homomorphic encryption because any scheme that supports the computation of arbitrary circuits consisting additions and multiplications can perform any computation. There are a number of schemes that are additively homomorphic, and a number that are multiplicatively homomorphic. More recently there have been schemes that can do more, most notably the one due to Boneh-Goh-Nissim that can do arbitrarily many additions and one level of multiplication (any degree 2 polynomial). See Fontaine-Galand 2007 for an excellent survey of homomorphic encryption.

Since the aim is a more powerful scheme, what other approach could researchers take than to try to find schemes that support more  general types of computation? Gentry realized that instead of directly creating a more powerful scheme, he could build one from a weakly homomorphic scheme, if that scheme’s decryption circuit were sufficiently simple. More specifically, he saw that he could build a fully homomorphic scheme from any scheme that could homomorphically compute a slightly augmented version of its own decryption circuit. A scheme with this property is bootstrappable.

For example, if the reason a scheme can compute circuits of at most a certain depth is that after a certain amount of computation too much error accumulates so that upon decryption the wrong value is obtained, but that smaller amounts of error are handled in decryption, bootstrappable encryption enables refreshing after some computation is done. The idea is to encrypt under a first key. Compute, but stop before the error grows too large. Encrypt under second key. Compute the decryption circuit which, since we stopped before the error grew too large,  gives the correct value encrypted under the second key. The first key is no longer in the picture. Continue computation under second key, and repeat with a new key as often as needed. When the computation finishes, decrypting with the last key used gives the final result.

In Gentry’s thesis, he uses a jewelry maker to colorfully and clearly illustrate this idea of bootstrappable encryption: Suppose Alice wants her employees to assemble jewelry from valuable raw materials. While she trusts them to carry out the assembly correctly, she is worried they might steal something. So she puts the materials in secure, transparent boxes with gloves that enable the employees to work with the materials inside.  Unfortunately, after a minute, the gloves stiffen so that the employees can no longer do the work.  Suppose further that the employees can place objects in a box, but cannot get them out again. “To an employee that is assembling an intricate design, she gives him … a glove box containing the raw materials, but also several additional glove boxes. Each of these additional glove boxes holds a copy of her master key. To assemble the intricate design, the employee manipulates the materials in box #1 until the gloves stiff en. Then, he places box #1 inside box #2, where the latter box already contains a master key. Using the gloves for box #2, he opens box #1 with the master key, extracts the partially assembled trinket, and continues the assembly within box #2 until its gloves stiff en. He then places box #2 inside box #3, and so on.” However, “this trick will not work unless the employee can open box #i within box #(i+1), and have time to make a little bit of progress on the assembly, all before the gloves of box #(i + 1) stiff en. This is analogous to the requirement for a bootstrappable encryption scheme E — that the complexity of E’s (augmented) decryption circuit is less than what E can homomorphically evaluate.”

Both his paper, and his thesis, are clearly written, exhibiting the care he put into communicating these ideas.  Both also have a personal feel. For example, when reading the section heading “Bootstrappable yet?” the reader can feel the frustration Gentry must have felt each time he applied a new trick and saw that the decryption circuit still couldn’t quite be evaluated homomorphically by the scheme so that he would have to modify the scheme with yet another trick. The details of each of his successive schemes are quite technical, but some of them are quite interesting. For example, one of these tricks comes from server aided decryption, in which a client gives  a computationally powerful server a hint so that the server can perform computations that make it easier for the client to decrypt. While as I mentioned in my previous post, Gentry’s fully homomorphic scheme is not practical — it is a trillion times slower than computation on unencryption data — his first scheme is interesting in its own right in that it improves on Boneh-Goh-Nissim’s result by enabling greater multiplicative depth and supporting a larger plaintext space.

Two more recent papers shed light on some of these technical details. Smart and Vercauteren’s paper is a specialization of Gentry’s work that does not require an understanding of lattice cryptography to follow. The main purpose of the van Dijk, Gentry, Halevi, and Vaikuntanathan paper is to provide a conceptual simple embodiment of many of the ideas in Gentry’s original paper.

I look forward to watching the progress in this area. I’m  particularly curious to see how quickly researchers will be able to make efficiency gains that will make fully homomorphic encryption practical.

5 Comments

  1. Twitter Comment


    Posted “How to compute without knowing anything” by Eleanor Rieffel [link to post]

    Posted using Chat Catcher

  2. […] 6, 2010 by saravananthirumuruganathan 1. How to compute without knowing anything Craig Gentry’s  work on fully homomorphic encryption is considered as one of the big […]

  3. The March issue of CACM has a beautifully written article by Gentry on fully homomorphic encryption that discusses van Dijk, Gentry, Halevi, and Vaikuntanathan’s homomorphic encryption over the integers as well as the jewelry store example I mentioned from his thesis. Micciancio gives a one page overview of this work in the same issue of CACM.

  4. […] Review interviewed me about the breakthrough in fully homomorphic encryption that I blogged about here. I very much enjoyed talking with him, and was pleased to see that he wrote a good article on the […]

  5. […] the Technology Review article on NudgeCam is written by Tom Simonite, who wrote the article on  last year’s breakthrough in homomorphic encryption for which he interviewed me. […]

Comments are closed.