Welcome to the resource topic for 2016/381
Title:
FHE Circuit Privacy Almost For Free
Authors: Florian Bourse, Rafaël Del Pino, Michele Minelli, Hoeteck Wee
Abstract:Circuit privacy is an important property for many applications of fully homomorphic encryption. Prior approaches for achieving circuit privacy rely on superpolynomial noise flooding or on bootstrapping. In this work, we present a conceptually different approach to circuit privacy based on a novel characterization of the noise distribution. In particular, we show that a variant of the GSW FHE for branching programs already achieves circuit privacy; this immediately yields a circuit-private FHE for NC$^1$ circuits under the standard LWE assumption with polynomial modulus-to-noise ratio. Our analysis relies on a variant of the discrete Gaussian leftover hash lemma which states that e^t \mathbf{G}^{-1}(v)+small noise does not depend on v. We believe that this result is of independent interest.
ePrint: https://eprint.iacr.org/2016/381
Talk: https://www.youtube.com/watch?v=k_vPE-3HQdM
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .