Progress and Applications of Fully Homomorphic Encryption
DOI:
https://doi.org/10.62051/qbjp2h16Keywords:
FHE; Lattice; LWE Problem; Bootstrapping; Cloud Computing.Abstract
In the era of digital transformation, marked by the widespread adoption of cloud-based technologies such as cloud computing and storage, ensuring data security and protecting user privacy have emerged as critical industry concerns. Fully Homomorphic Encryption (FHE) addresses these issues by allowing various computations to be performed on ciphertexts without the need for decryption, thus safeguarding data security and privacy. This paper explores the mathematical and algorithmic foundations essential for understanding FHE. It provides a detailed analysis of the advancements in FHE schemes over the past decade, focusing on various mathematical problems, including ideal lattices and integers. The discussion extends to three practical applications: cloud computing, machine learning, and electronic voting, highlighting the progress and exploring potential future research avenues and developmental strategies in the field of FHE. This comprehensive review not only underscores the significance of FHE in enhancing data security but also charts a path for its future exploration and integration into emerging technologies.
Downloads
References
[1] Z. Brakerski, C. Gentry, V. Vaikuntanathan, (Leveled) FHE without bootstrap, ACM Trans. Comput. Theory 6(3) (2014) 1-36.
[2] Z. Brakerski, FHE without modulus switching from classical GapSVP, in: Annu. Cryptol. Conf., Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 868-886.
[3] J. Fan, F. Vercauteren, Somewhat practical FHE, Cryptol. ePrint Arch. (2012).
[4] S. Garg, D. Gupta, Efficient round optimal blind signatures, in: Adv. Cryptol.–EUROCRYPT 2014: 33rd Annu. Int. Conf. on the Theory and Appl. of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014, Proc. 33, Springer Berlin Heidelberg, 2014, pp. 477-495.
[5] I.Chillotti, N. Gama, M. Georgieva, M. Izabachene, Faster FHE: Bootstrap in less than 0.1 seconds, in: Adv. Cryptol.–ASIACRYPT 2016: 22nd Int. Conf. on the Theory and Appl. of Cryptology and Inf. Secur., Hanoi, Vietnam, Dec. 4-8, 2016, Proc., Part I 22, Springer Berlin Heidelberg, 2016, pp. 3-33.
[6] I.Chillotti, N. Gama, M. Georgieva, M. Izabachene, Faster packed homomorphic operations and efficient circuit bootstrap for TFHE, in: Int. Conf. on the Theory and Appl. of Cryptology and Inf. Secur., Cham: Springer Int. Publ., 2017, pp. 377-408.
[7] Chillotti, N. Gama, M. Georgieva, M. Izabachene, TFHE: fast FHE over the torus, J. Cryptol. 33(1) (2020) 34-91.
[8] J. Alperin-Sheriff, C. Peikert, Faster bootstrap with polynomial error, in: Adv. Cryptol.–CRYPTO 2014: 34th Annu. Cryptol. Conf., Santa Barbara, CA, USA, Aug. 17-21, 2014, Proc., Part I 34, Springer Berlin Heidelberg, 2014, pp. 297-314.
[9] N. Gama, et al., Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems, in: Adv. Cryptol.–EUROCRYPT 2016: 35th Annu. Int. Conf. on the Theory and Appl. of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proc., Part II 35, Springer Berlin Heidelberg, 2016.
[10] J.H. Cheon, K. Han, A. Kim, M. Kim, Y. Song, A full RNS variant of approximate homomorphic encryption, in: Sel. Areas in Cryptography–SAC 2018: 25th Int. Conf., Calgary, AB, Canada, Aug. 15–17, 2018, Rev. Sel. Pap., 25, Springer Int. Publ., 2019, pp. 347-368.
[11] B. Li, D. Micciancio, On the security of homomorphic encryption on approximate numbers, in: Annu. Int. Conf. on the Theory and Appl. of Cryptographic Techniques, Cham: Springer Int. Publ., 2021, pp. 648-677.
[12] A.Kim, M. Deryabin, J. Eom, R. Choi, Y. Lee, W. Ghang, D. Yoo, General bootstrap approach for RLWE-based homomorphic encryption, IEEE Trans. Comput. (2023).
[13] C.S. Jutla, N. Manohar, Sine series approximation of the mod function for bootstrap of approximate HE, in: Annu. Int. Conf. on the Theory and Appl. of Cryptographic Techniques, Cham: Springer Int. Publ., 2022, pp. 491-520.
[14] M. Naehrig, K. Lauter, V. Vaikuntanathan, Can homomorphic encryption be practical? in: Proc. of the 3rd ACM workshop on Cloud computing security workshop, 2011, pp. 113-124.
Downloads
Published
Conference Proceedings Volume
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
How to Cite
