Authors :
Sreekutty Sabarivasan; Dr. Ashish L.
Volume/Issue :
Volume 11 - 2026, Issue 2 - February
Google Scholar :
https://tinyurl.com/bdhn9p36
Scribd :
https://tinyurl.com/2tat6pt5
DOI :
https://doi.org/10.38124/ijisrt/26feb1493
Note : A published paper may take 4-5 working days from the publication date to appear in PlumX Metrics, Semantic Scholar, and ResearchGate.
Abstract :
Fully Homomorphic Encryption (FHE) is an advanced cryptographic technique that enables computation on
encrypted data without requiring decryption. This capability eliminates the need to expose sensitive data during
processing, making FHE particularly suitable for cloud computing, healthcare analytics, financial systems, and privacypreserving artificial intelligence. Despite its strong theoretical foundation, FHE faces practical challenges including high
computational complexity, large ciphertext expansion, and bootstrapping overhead. This paper presents a comprehensive
study of FHE, including its theoretical background, working mechanism, security properties, real-world applications,
limitations, and emerging research trends.
Keywords :
Fully Homomorphic Encryption, Cloud Security, Bootstrapping, Lattice Cryptography, Privacy-Preserving Computation.
References :
- C. Gentry, Fully homomorphic encryption using ideal lattices, *STOC*, Vol. 41, 2009.
- Z. Brakerski et al., Leveled fully homomorphic encryption without bootstrapping, *ITCS*, Vol. 15, 2014.
- J. H. Cheon et al., Homomorphic encryption for approximate numbers, *ASIACRYPT*, Vol. 10624, 2017.
- C. Marcolla et al., Survey on fully homomorphic encryption, *Journal of Cryptology*, Vol. 35, 2022.
- C. Gentry and S. Halevi, Implementing FHE scheme, *EUROCRYPT*, Vol. 6632, 2011.
- J. Fan and F. Vercauteren, Somewhat practical FHE, *IACR ePrint*, Vol. 2012/144, 2012.
- N. Samardzic et al., F1 accelerator for FHE, *MICRO*, Vol. 54, 2021.
- N. Samardzic et al., CraterLake accelerator, *ISCA*, Vol. 49, 2022.
- P. Fauzi et al., IND-CCA1 security of FHE, *PKC*, Vol. 13178, 2022.
- H. Shen et al., Bootstrapping survey, *IEEE Surveys & Tutorials*, Vol. 27, 2025.
- A. Akavia and M. Vald, Privacy of homomorphic protocols, *TCC*, Vol. 20042, 2021.
- I. Chillotti et al., Attacking FHE applications, *FHE Standards Workshop*, Vol. 3, 2016.
- S. Goldwasser et al., Reusable garbled circuits, *FOCS*, Vol. 54, 2013.
- M. Albrecht et al., Homomorphic encryption security standard, *HomomorphicEncryption.org*, Vol. 1, 2018.
- S. Angel et al., PIR with compressed queries, *SIGMOD*, Vol. 47, 2018..
Fully Homomorphic Encryption (FHE) is an advanced cryptographic technique that enables computation on
encrypted data without requiring decryption. This capability eliminates the need to expose sensitive data during
processing, making FHE particularly suitable for cloud computing, healthcare analytics, financial systems, and privacypreserving artificial intelligence. Despite its strong theoretical foundation, FHE faces practical challenges including high
computational complexity, large ciphertext expansion, and bootstrapping overhead. This paper presents a comprehensive
study of FHE, including its theoretical background, working mechanism, security properties, real-world applications,
limitations, and emerging research trends.
Keywords :
Fully Homomorphic Encryption, Cloud Security, Bootstrapping, Lattice Cryptography, Privacy-Preserving Computation.