Fetching the paper…
Reading the bibliography…
FHE offers protection to private data on third-party cloud servers by allowing computations on the data in encrypted form.
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.
A. Norton and A. J. Silberger, “Parallelization and performance analysis of the cooley? tukey fft algorithm for shared-memory architectures,” IEEE Transactions on Computers , vol. 36, no. 05, pp. 581–591, 1987
1987
Earlier work this paper cites.
D. Hankerson, A. J. Menezes, and S. Vanstone, Guide to elliptic curve cryptography . Springer Science & Business Media, 2006
2006
Earlier work this paper cites.
C. Gentry, A fully homomorphic encryption scheme . Stanford university, 2009
2009
Earlier work this paper cites.
A. Munshi, “The opencl specification,” in 2009 IEEE Hot Chips 21 Symposium (HCS) . IEEE, 2009, pp. 1–314
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.
L. Deng, “The mnist database of handwritten digit images for machine learning research [best of the web],” IEEE signal processing magazine , vol. 29, no. 6, pp. 141–142, 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, S. Halevi, C. Peikert, and N. P. Smart, “Ring switching in bgv-style homomorphic encryption,” in International Conference on Security and Cryptography for Networks . Springer, 2012, pp. 19–37
2012
Earlier work this paper cites.
S. Halevi et al. , “Algorithms in helib,” in Advances in Cryptology – CRYPTO 2014 . Springer, 2014, pp. 554–571
2014
Earlier work this paper cites.
M. A. Will and R. K. Ko, “Computing mod without mod,” Cryptology ePrint Archive , 2014
2014
Earlier work this paper cites.
M. R. Albrecht, R. Player, and S. Scott, “On the concrete hardness of learning with errors,” Cryptology ePrint Archive, Report 2015/046, 2015, https://ia.cr/2015/046
2015
Earlier work this paper cites.
W. Dai and B. Sunar, “cuhe: A homomorphic encryption accelerator library,” in International Conference on Cryptography and Information Security in the Balkans . Springer, 2015, pp. 169–186
2015
Cited alongside, same era.
L. Ducas and D. Micciancio, “Fhew: bootstrapping homomorphic encryption in less than a second,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer, 2015, pp. 617–640
2015
Cited alongside, same era.
C. Aguilar-Melchor, “Nfllib: Ntt-based fast lattice library,” in Cryptographers’ Track at the RSA Conference . Springer, 2016, pp. 341–356
2016
Cited alongside, same era.
R. Hiromasa, M. Abe, and T. Okamoto, “Packing messages and optimizing bootstrapping in gsw-fhe,” IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences , vol. 99, no. 1, pp. 73–82, 2016
2016
Cited alongside, same era.
D. Technologies, “PALISADE library,” Online: https://gitlab.com/palisade/palisade-release , 2019
2019
Later among the works it cites.
I. Chillotti, N. Gama, M. Georgieva, and M. Izabachène, “Tfhe: fast fully homomorphic encryption over the torus,” Journal of Cryptology , vol. 33, no. 1, pp. 34–91, 2020
2020
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. Kim, W. Jung, J. Park, and J. H. Ahn, “Accelerating number theoretic transformations for bootstrappable homomorphic encryption on GPUs,” in 2020 IEEE International Symposium on Workload Characterization (IISWC) . IEEE, 2020, pp. 264–275
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. Kachris and D. Soudris, “A survey on reconfigurable accelerators for cloud computing,” in 2016 26th International conference on field programmable logic and applications (FPL) . IEEE, 2016, pp. 1–10
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.
A. Al Badawi, B. Veeravalli, C. F. Mun, and K. M. M. Aung, “High-performance fv somewhat homomorphic encryption on gpus: An implementation using cuda,” IACR Transactions on Cryptographic Hardware and Embedded Systems , pp. 70–95, 2018
2018
Cited alongside, same era.
J. H. Cheon, K. Han, A. Kim, M. Kim, and Y. Song, “Bootstrapping for approximate homomorphic encryption,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer, 2018, pp. 360–384
2018
Cited alongside, same era.
K. Han, S. Hong, J. H. Cheon, and D. Park, “Efficient logistic regression on large encrypted data,” Cryptology ePrint Archive , 2018
2018
Cited alongside, same era.
A. Kim, “HEAAN,” Online: https://github.com/snucrypto/HEAAN , 2018
2018
Cited alongside, same era.
H. Chen, I. Chillotti, and Y. Song, “Improved bootstrapping for approximate homomorphic encryption,” in Advances in Cryptology – EUROCRYPT 2019 , Y. Ishai and V. Rijmen, Eds. Cham: Springer International Publishing, 2019, pp. 34–54
2019
Cited alongside, same era.
J. H. Cheon, K. Han, A. Kim, M. Kim, and Y. Song, “A full RNS variant of approximate homomorphic encryption,” in Selected Areas in Cryptography – SAC 2018 , C. Cid and M. J. Jacobson Jr., Eds. Cham: Springer International Publishing, 2019, pp. 347–368
2019
Cited alongside, same era.
M. S. Riazi, K. Laine, B. Pelton, and W. Dai, “Heax: An architecture for computing on encrypted data,” in Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems , 2020, pp. 1295–1309
2020
Later among the works it cites.
J.-P. Bossuat, C. Mouchet, J. Troncoso-Pastoriza, and J.-P. Hubaux, “Efficient bootstrapping for approximate homomorphic encryption with non-sparse keys,” in Advances in Cryptology – EUROCRYPT 2021 , A. Canteaut and F.-X. Standaert, Eds. Cham: Springer International Publishing, 2021, pp. 587–617
2021
Later among the works it cites.
2021
Later among the works it cites.
J.-Z. Goey, W. K. Lee, B.-M. Goi, and W.-S. Yap, “Accelerating number theoretic transform in gpu platform for fully homomorphic encryption,” The Journal of Supercomputing , vol. 77, 02 2021
2021
Later among the works it cites.
“Open source (release 2.2.1),” https://github.com/homenc/HElib , Oct. 2021
2021
Later among the works it cites.
W. Jung, S. Kim, J. H. Ahn, J. H. Cheon, and Y. Lee, “Over 100x faster bootstrapping in fully homomorphic encryption through memory-centric optimization with gpus,” IACR Transactions on Cryptographic Hardware and Embedded Systems , pp. 114–148, 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
N. Samardzic, A. Feldmann, A. Krastev, S. Devadas, R. Dreslinski, C. Peikert, and D. Sanchez, “F1: A fast and programmable accelerator for fully homomorphic encryption,” in MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture , 2021, pp. 238–252
2021
Later among the works it cites.
“Microsoft SEAL (release 3.7),” https://github.com/Microsoft/SEAL , Sep. 2021, microsoft Research, Redmond, WA
2021
Later among the works it cites.
Y. Zhai, M. Ibrahim, Y. Qiu, F. Boemer, Z. Chen, A. Titov, and A. Lyashevsky, “Accelerating Encrypted Computing on Intel GPUs,” ArXiv , 2021
2021
Later among the works it cites.