Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption

@inproceedings{Paindavoine2015MinimizingTN,
  title={Minimizing the Number of Bootstrappings in Fully Homomorphic Encryption},
  author={Marie Paindavoine and Bastien Vialla},
  booktitle={SAC},
  year={2015}
}
There has been great progress regarding efficient implementations of fully homomorphic encryption schemes since the first construction by Gentry. However, evaluating complex circuits is still undermined by the necessary resort to the bootstrapping procedure. Minimizing the number of times such procedure is called is a simple yet very efficient way to critically improve performances of homomorphic evaluations. To tackle this problem, a first solution has been proposed in 2013 by Lepoint and… CONTINUE READING
10 Citations
27 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Homomorphic encryption from learning with errors : Conceptuallysimpler , asymptoticallyfaster , attributebased

  • Shafi Goldwasser, Silvio Micali
  • Advances in CryptologyCRYPTO
  • 2013

Smart . Fully homomorphic encryption with polylog overhead

  • Craig Gentry, Shai Halevi, P. Nigel
  • Advances in CryptologyEUROCRYPT 201231 st Annual…
  • 2012

Similar Papers

Loading similar papers…