Homomorphic Encryption
Fully Homomorphic Encryption · Also known as: FHE, Fully Homomorphic Encryption, Leveled Homomorphic Encryption, Homomorfik Şifreleme
Homomorphic Encryption (HE) is a cryptographic framework that allows arbitrary computations to be performed directly on encrypted data without requiring decryption. First realized as a fully general construction by Craig Gentry in 2009 using ideal lattices, it enables a server to process sensitive data and return an encrypted result that, when decrypted by the data owner, equals the result of performing the same computation on the plaintext. It is foundational to privacy-preserving machine learning, secure cloud computing, and confidential analytics.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use homomorphic encryption when data must remain encrypted throughout processing — typically in regulated industries (healthcare, finance, genomics) where a service provider must compute on client data without ever holding plaintext. It is appropriate when the computation can be expressed as an arithmetic or Boolean circuit of bounded or refreshable depth. Avoid it when latency is critical, as even optimized FHE schemes are orders of magnitude slower than plaintext computation. For simpler needs, differential privacy or secure multi-party computation may offer better performance at the cost of different trust models.
Strengths & limitations
- Provides cryptographic guarantees: the server learns nothing about plaintexts, even if fully compromised after computation.
- Supports arbitrary computable functions over encrypted data via bootstrapping, with no restriction on circuit depth.
- Compatible with standard public-key infrastructure; the data owner alone holds the secret key.
- Enables non-interactive privacy-preserving computation, unlike multi-party protocols that require rounds of communication.
- Computational overhead is large: FHE operations can be 10^3 to 10^6 times slower than equivalent plaintext operations depending on scheme and circuit depth.
- Ciphertext expansion is significant; encrypted data is typically 1000× larger than the corresponding plaintext.
- Bootstrapping is the dominant cost and remains a practical bottleneck even in hardware-accelerated implementations.
- Programming FHE circuits requires expert knowledge of noise budgets, parameter selection, and scheme-specific constraints.
Frequently asked
Is fully homomorphic encryption practical today?
For narrow workloads — particularly neural network inference with small models, genomic queries, or simple statistical aggregations — FHE is deployable today using libraries such as SEAL, HElib, Concrete, or OpenFHE. However, latency remains 100× to 10^6× higher than plaintext, so applications must tolerate multi-second or multi-minute runtimes. Hardware acceleration (GPUs, FPGAs, custom ASICs) is an active research area substantially narrowing this gap.
What is the difference between FHE, somewhat homomorphic encryption, and leveled HE?
Somewhat homomorphic encryption (SHE) supports a limited number of multiplications before noise exceeds the decryption threshold. Leveled HE sets parameters large enough to evaluate circuits up to a predetermined depth without bootstrapping. Fully homomorphic encryption adds bootstrapping to refresh noise, supporting circuits of unlimited depth. In practice, many deployments use leveled HE and avoid bootstrapping for performance reasons, accepting a bound on circuit complexity.
Does FHE protect against all privacy attacks?
FHE guarantees that the evaluating party learns nothing from the ciphertexts under standard cryptographic assumptions. However, it does not protect against attacks on the output — a malicious circuit designer can craft computations whose results leak plaintext information. It also does not address membership inference or model inversion at the application layer. FHE is a building block, not a complete privacy solution; it is best combined with output perturbation or differential privacy where output leakage is a concern.
Sources
- Gentry, C. (2009). Fully homomorphic encryption using ideal lattices. ACM Symposium on Theory of Computing (STOC), 169–178. DOI: 10.1145/1536414.1536440 ↗
How to cite this page
ScholarGate. (2026, June 2). Fully Homomorphic Encryption. ScholarGate. https://scholargate.app/en/privacy/homomorphic-encryption
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Differential PrivacyPrivacy↔ compare
- Federated LearningPrivacy↔ compare
- Secure Multi-Party ComputationPrivacy↔ compare