22.04.2014 Views

a590003

a590003

a590003

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

4.3 Publications<br />

Figure 1: A block diagram of the Homomorphic-Encryption library<br />

Full versions of PROCEED AHEAD papers are provided as an attachment to this report as noted<br />

in the appendix to this report.<br />

1. “Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits”<br />

by Craig Gentry and Shai Halevi[2]<br />

We describe a new approach for constructing fully homomorphic encryption (FHE) schemes.<br />

Previous FHE schemes all use the same blueprint from Gentry[1]. First construct a somewhat<br />

homomorphic encryption (SWHE) scheme, next "squash" the decryption circuit until it is simple<br />

enough to be handled within the homomorphic capacity of the SWHE scheme, and finally<br />

"bootstrap" to get a FHE scheme. In all existing schemes, the squashing technique induces an<br />

additional assumption: that the sparse subset sum problem (SSSP) is hard.<br />

Our new approach constructs FHE as a hybrid of a SWHE and a multiplicatively homomorphic<br />

encryption (MHE) scheme, such as Elgamal. Our construction eliminates the need for the<br />

squashing step, and thereby also removes the need to assume the SSSP is hard. We describe a<br />

few concrete instantiations of the new method, including a "simple" FHE scheme where we<br />

replace SSSP with Decision Diffie-Hellman, an optimization of the simple scheme that let us<br />

"compress" the FHE ciphertext into a single Elgamal ciphertext(!), and a scheme whose security<br />

can be (quantumly) reduced to the approximate ideal-SIVP.<br />

Approved for Public Release; Distribution Unlimited.<br />

9

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!