Practical Bootstrapping in Quasilinear Time

@inproceedings{AlperinSheriff2013PracticalBI,
  title={Practical Bootstrapping in Quasilinear Time},
  author={Jacob Alperin-Sheriff and Chris Peikert},
  booktitle={IACR Cryptology ePrint Archive},
  year={2013}
}
Gentry’s “bootstrapping” technique (STOC 2009) constructs a fully homomorphic encryption (FHE) scheme from a “somewhat homomorphic” one that is powerful enough to evaluate its own decryption function. To date, it remains the only known way of obtaining unbounded FHE. Unfortunately, bootstrapping is computationally very expensive, despite the great deal of effort that has been spent on improving its efficiency. The current state of the art, due to Gentry, Halevi, and Smart (PKC 2012), is able to… CONTINUE READING
Highly Cited
This paper has 66 citations. REVIEW CITATIONS

5 Figures & Tables

Topics

Statistics

0102020142015201620172018
Citations per Year

66 Citations

Semantic Scholar estimates that this publication has 66 citations based on the available data.

See our FAQ for additional information.