Lianmu Chen

Learn More
As a major breakthrough, in 2009 Gentry introduced the first plausible construction of a fully homomorphic encryption (FHE) scheme. FHE allows the evaluation of arbitrary functions directly on encrypted data on untwisted servers. In 2010, Gentry and Halevi presented the first FHE implementation on an IBM x3500 server. However, this implementation remains(More)
—In 2010 Gentry and Halevi presented the first FHE implementation. FHE allows the evaluation of arbitrary functions directly on encrypted data on untrusted servers. However, even for the small setting with 2,048 dimensions, the authors reported a performance of 1.8 seconds for a single bit encryption and 32 seconds for recryption on a high end server. Much(More)
  • 1