Machine learningPrivacy-preserving computation

Homomorphic Encryption

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.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Gentry, C. (2009). Fully homomorphic encryption using ideal lattices. ACM Symposium on Theory of Computing (STOC), 169–178. DOI: 10.1145/1536414.1536440

Related methods

ScholarGateHomomorphic Encryption (Fully Homomorphic Encryption). Retrieved 2026-06-04 from https://scholargate.app/en/privacy/homomorphic-encryption