Faster bootstrapping with polynomial error

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8616 LNCS, Issue PART 1, 2014, Pages 297-314

  Alperin Sheriff, Jacob ^a   Peikert, Chris ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; POLYNOMIAL APPROXIMATION; SECURITY OF DATA;

APPROXIMATION FACTOR; BOOTSTRAPPING ALGORITHM; FULLY HOMOMORPHIC ENCRYPTION; HOMOMORPHIC OPERATIONS; LEARNING WITH ERRORS; POLY-LOGARITHMIC FACTORS; SOMEWHAT HOMOMORPHIC ENCRYPTIONS; UNBOUNDED COMPUTATIONS;

CRYPTOGRAPHY;

EID: 84905365008     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-44371-2_17     Document Type: Conference Paper

References (24)

1. Alperin-Sheriff, J., Peikert, C.: Practical bootstrapping in quasilinear time. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 1-20. Springer, Heidelberg (2013)
2. Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 595-618. Springer, Heidelberg (2009)
3. 1. In: STOC, pp. 1-5 (1986)
4. Brakerski, Z., Gentry, C., Vaikuntanathan, V. (Leveled) fully homomorphic encryption without bootstrapping. In: ITCS, pp. 309-325 (2012)
5. Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehlé, D.: Classical hardness of learning with errors. In: STOC, pp. 575-584 (2013)
6. Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: FOCS, pp. 97-106 (2011)
7. Brakerski, Z., Vaikuntanathan, V.: Lattice-based FHE as secure as PKE. In: ITCS, p. 1 (2014)
8. Cai, J.-Y., Lipton, R.J.: Subquadratic simulations of circuits by branching programs. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 568-573 (1989)
9. Cleve, R.: Towards optimal simulations of formulas by bounded-width programs. Computational Complexity 1(1), 91-105 (1991)
10. Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, Stanford University (2009), http://crypto.stanford.edu/craig
11. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169-178 (2009)
12. Gentry, C., Halevi, S.: Fully homomorphic encryption without squashing using depth-3 arithmetic circuits. In: FOCS, pp. 107-109 (2011)
13. Gentry, C., Halevi, S., Smart, N.P.: Better bootstrapping in fully homomorphic encryption. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 1-16. Springer, Heidelberg (2012)
14. Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 465-482. Springer, Heidelberg (2012)
15. Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 75-92. Springer, Heidelberg (2013)
16. Jacobson, N.: Basic Algebra I. Dover Publications (2012)
17. Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. Journal of the ACM 60(6), 43:1-43:35 (2013);
18. Preliminary version in Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1-23. Springer, Heidelberg (2010)
19. Micciancio, D., Peikert, C.: Trapdoors for lattices: Simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700-718. Springer, Heidelberg (2012)
20. Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem. In: STOC 2009, pp. 333-342 (2009)
21. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1-40 (2009); Preliminary version in STOC 2005
22. Schoenfeld, L.: Sharper bounds for the Chebyshev functions θ(χ) and ψ(χ). ii. Mathematics of Computation 30(134), 337-360 (1976)
23. Sinha, R.K.: Some topics in parallel computation and branching programs. PhD thesis, University of Washington (1995)
24. Vershynin, R.: Compressed Sensing, Theory and Applications, ch. 5, pp. 210-268. Cambridge University Press (2012), http://www-personal.umich.edu/ ~romanv/papers/non-asymptotic-rmt-plain.pdf