Types of Homomorphic Encryption
What you'll learn: You'll understand the four main types of homomorphic encryption and what computation each one allows on encrypted data.
The Core Idea
Not all homomorphic encryption schemes are created equal. Just as you learned that homomorphic encryption fundamentally allows computation on encrypted data, different types offer different levels of computational flexibility—from simple operations to unlimited complexity.
Think of it like kitchen appliances: a toaster only heats bread, a microwave does more, but a full kitchen lets you cook anything.
The Four Types
Partially Homomorphic Encryption (PHE) supports only one type of operation (either addition OR multiplication), unlimited times. RSA is actually partially homomorphic for multiplication—you've already seen RSA in earlier lessons, though we didn't emphasize this property.
Somewhat Homomorphic Encryption (SHE) supports both addition AND multiplication, but only a limited number of times. It's like having a budget of operations before the encrypted data becomes too "noisy" to decrypt correctly.
Leveled Fully Homomorphic Encryption (LHE) supports unlimited additions and multiplications, but you must know the maximum "depth" (complexity) of your computation in advance. The system parameters are set based on this predetermined circuit depth.
Fully Homomorphic Encryption (FHE) is the holy grail—it supports any computation of any complexity without restrictions. You can add, multiply, and chain operations indefinitely. However, FHE is currently the most computationally expensive.
Practical Trade-offs
PHE is fast but limited. FHE is unlimited but slow (often thousands of times slower than plaintext computation). SHE and LHE sit in the middle, offering practical compromises for specific use cases.
Key Takeaway: Homomorphic encryption comes in four flavors—PHE (one operation type), SHE (limited mixed operations), LHE (unlimited with known depth), and FHE (truly unlimited)—each trading capability for performance.