I. Overview

%%{init: { 'theme': 'base', 'themeVariables': { 'edgeLabelBackground': '#fff' }}}%%
flowchart LR
    A["Encrypted\ndata"] -- "Direct computation without decryption" --> B["Privacy-preserving\nanalysis"]
    style A fill:#f9f9f9,stroke:#333,stroke-width:3px
    style B fill:#e1f5fe,stroke:#01579b,stroke-width:3px

Definition: A cryptographic system in which the result of performing an operation on ciphertext Enc(m) of plaintext m remains equivalent to the result of performing the operation on the plaintext and then encrypting it.

Core Value:
( Privacy Preservation ) Computation can be performed on data while it remains encrypted, without ever decrypting it to plaintext
( Maximized Data Utility ) Enables data analysis using external resources such as the cloud while protecting sensitive information
( Mathematical Safety ) Can simultaneously achieve quantum-resistant security by relying on techniques such as lattice-based cryptography

II. Mechanism & Components

A. Stages of Development by Computational Scope

CategoryGenerationFeatures & Limitations
Partially Homomorphic (PHE)1st generationSupports only one operation — either addition or multiplication (RSA, ElGamal)
Somewhat Homomorphic (SHE)2nd generationSupports both addition and multiplication, but with a limit on the number of operations
Fully Homomorphic (FHE)3rd generationSupports unlimited logical/arithmetic operations with no count restriction (Gentry, 2009)

B. Core Technologies of Fully Homomorphic Encryption (FHE)

Core TechnologyDescriptionNote
Lattice-based cryptographyEncryption based on the mathematical hardness of lattice structures (e.g., LWE)Provides quantum resistance (PQC)
BootstrappingRemoves accumulated noise during computation so that operations can continueThe key technology enabling FHE
PackingPlaces multiple pieces of data into a single ciphertext for parallel processingImproves computational efficiency

III. Advanced Topics & Comparison

Comparison ItemHomomorphic EncryptionDifferential Privacy (DP)
Security MechanismMathematical encryption (access control)Mathematical noise injection (data perturbation)
Data FormCiphertext (results also remain encrypted)Statistical values (results are plaintext but contain error)
Computational Accuracy100% accurate (identical to plaintext once decrypted)Approximate (error introduced by noise)
Key LimitationHigh computational load (CPU/memory consumption)Loss of data utility (privacy budget management)

Last updated 18 Aug 2026, 00:00 UTC. history