Skip to main content
    Skip to main contentSkip to navigationSkip to footer
    Technology
    (Homomorphe Verschlüsselung)

    Homomorphic Encryption

    Also known as:
    FHE
    Fully Homomorphic Encryption
    Computing on Encrypted Data
    HE
    Updated: 2/11/2026

    A cryptographic method that enables computations directly on encrypted data without decrypting it first.

    Quick Summary

    Homomorphic Encryption allows computations on encrypted data – ideal for cloud AI without data exposure, but still very compute-intensive.

    Explanation

    With HE, data is encrypted, sent to a server, processed there, and the encrypted result returned. Only the data owner can decrypt. Variants: Partially HE (one operation), Somewhat HE (limited), Fully HE (arbitrary).

    Marketing Relevance

    Enables ML inference on encrypted customer data: Cloud AI without data exposure. Ideal for healthcare, finance, and regulated industries.

    Example

    A hospital sends encrypted patient data to a cloud AI service. The model classifies diagnoses on encrypted data. The result is returned encrypted – the cloud provider never sees patient data.

    Common Pitfalls

    Extremely compute-intensive (100-10,000x slower). Not all ML operations are efficiently implementable. Production readiness for complex models still limited.

    Origin & History

    Craig Gentry solved the FHE problem in 2009 after 30 years of research. Since then, libraries like SEAL (Microsoft), TFHE, and OpenFHE were developed. Zama.ai and other startups have been advancing FHE-ML applications since 2022.

    Comparisons & Differences

    Homomorphic Encryption vs. Differential Privacy

    Differential Privacy adds noise and works with plaintext; Homomorphic Encryption works directly on ciphertext.

    Homomorphic Encryption vs. Secure Multi-Party Computation

    SMPC distributes computation across multiple parties; HE allows a single server to compute on encrypted data.

    Related Services

    Related Terms

    👋Questions? Chat with us!