Does Fully Homomorphic Encryption Need Compute Acceleration?

R. L. Rivest, L. Adleman, and M. L. Dertouzos, “On data banks and privacy homomorphisms,” Foundations of Secure Computation, Academia Press , pp. 169–179, 1978

1978

Earlier work this paper cites.

P. Barrett, “Implementing the Rivest-Shamir-Adleman public key encryption algorithm on a standard digital signal processor,” in Advances in Cryptology — CRYPTO’ 86 , A. M. Odlyzko, Ed. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987, pp. 311–323

1987

Earlier work this paper cites.

V. Shoup et al. , “NTL: A library for doing number theory,” 2001, https://libntl.org/

2001

Earlier work this paper cites.

C. Gentry, A fully homomorphic encryption scheme . Stanford university, 2009

2009

Earlier work this paper cites.

Z. Brakerski and V. Vaikuntanathan, “Efficient fully homomorphic encryption from (standard) LWE,” in IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011 , R. Ostrovsky, Ed. IEEE Computer Society, 2011, pp. 97–106. [Online]. Available: https://doi.org/10.1109/FOCS.2011.12

2011

Earlier work this paper cites.

Z. Brakerski, “Fully homomorphic encryption without modulus switching from classical gapsvp,” in Advances in Cryptology – CRYPTO 2012 , R. Safavi-Naini and R. Canetti, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 868–886

2012

Earlier work this paper cites.

Z. Brakerski, C. Gentry, and V. Vaikuntanathan, “(Leveled) fully homomorphic encryption without bootstrapping,” in ITCS ’12 , 2012

2012

Earlier work this paper cites.

J. Fan and F. Vercauteren, “Somewhat practical fully homomorphic encryption,” Cryptology ePrint Archive, Report 2012/144, 2012, https://ia.cr/2012/144

2012

Earlier work this paper cites.

C. Gentry, A. Sahai, and B. Waters, “Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based,” in Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I , ser. Lecture Notes in Computer Science, R. Canetti and J. A. Garay, Eds., vol. 8042. Springer, 2013, pp. 75–92. [Online]. Available: https://doi.org/10.1007/978-3-642-40041-4_5

2013

Earlier work this paper cites.

L. Ducas and D. Micciancio, “FHEW: bootstrapping homomorphic encryption in less than a second,” in Advances in Cryptology - EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part I , ser. Lecture Notes in Computer Science, E. Oswald and M. Fischlin, Eds., vol. 9056. Springer, 2015, pp. 617–640. [Online]. Available: https://doi.org/10.1007/978-3-662-46800-5_24

2015

Earlier work this paper cites.

C. Sun, M. T. Wade, Y. Lee, J. S. Orcutt, L. Alloatti, M. S. Georgas, A. S. Waterman, J. M. Shainline, R. R. Avizienis, S. Lin, B. R. Moss, R. Kumar, F. Pavanello, A. H. Atabaki, H. M. Cook, A. J. Ou, J. C. Leu, Y.-H. Chen, K. Asanović, R. J. Ram, M. Popović, and V. M. Stojanović, “Single-chip microprocessor that communicates directly using light,” Nature , vol. 528, no. 7583, pp. 534–538, 2015. [Online]. Available: https://doi.org/10.1038/nature16454

2015

Earlier work this paper cites.

P. Chi, S. Li, C. Xu, T. Zhang, J. Zhao, Y. Liu, Y. Wang, and Y. Xie, “Prime: A novel processing-in-memory architecture for neural network computation in reram-based main memory,” in Proceedings of the 43rd International Symposium on Computer Architecture , ser. ISCA ’16. IEEE Press, 2016, p. 27–39. [Online]. Available: https://doi.org/10.1109/ISCA.2016.13

2016

Cited alongside, same era.

J. H. Cheon, A. Kim, M. Kim, and Y. Song, “Homomorphic encryption for arithmetic of approximate numbers,” in Advances in Cryptology – ASIACRYPT 2017 , T. Takagi and T. Peyrin, Eds. Cham: Springer International Publishing, 2017, pp. 409–437

2017

Cited alongside, same era.

H. Jun, J. Cho, K. Lee, H.-Y. Son, K. Kim, H. Jin, and K. Kim, “HBM (high bandwidth memory) dram technology and architecture,” in 2017 IEEE International Memory Workshop (IMW) , 2017, pp. 1–4

2017

Cited alongside, same era.

NVIDIA, “NVIDIA Tesla V100 GPU Architecture,” 2017

2017

Cited alongside, same era.

K. Han, M. Hhan, and J. H. Cheon, “Improved homomorphic discrete fourier transforms and fhe bootstrapping,” IEEE Access , vol. 7, pp. 57 361–57 370, 2019

2019

Later among the works it cites.

K. Han, S. Hong, J. H. Cheon, and D. Park, “Logistic regression on homomorphic encrypted data at scale,” Proceedings of the AAAI Conference on Artificial Intelligence , vol. 33, no. 01, pp. 9466–9471, Jul. 2019. [Online]. Available: https://ojs.aaai.org/index.php/AAAI/article/view/5000

2019

Later among the works it cites.

K. Han and D. Ki, “Better bootstrapping for approximate homomorphic encryption,” in Topics in Cryptology – CT-RSA 2020 , S. Jarecki, Ed. Cham: Springer International Publishing, 2020, pp. 364–390

2020

Later among the works it cites.

S. Li, Z. Yang, D. Reddy, A. Srivastava, and B. Jacob, “Dramsim3: A cycle-accurate, thermal-capable dram simulator,” IEEE Computer Architecture Letters , vol. 19, no. 2, pp. 106–109, 2020

2020

Later among the works it cites.