KFUPM · COE526 DATA PRIVACY
← Course home

COE526 / Interactive laboratory

Homomorphic encryption

Explore encrypted computation, verify the arithmetic, and test its privacy boundaries.

24 experiments8-lab core routeNo installation
0 / 24 checkpoints completedProgress and notes stay in this browser.

Learning goal:

Your experiment

Model boundary: Small numbers make mathematical traces transparent. RSA, ElGamal, and Paillier examples use teaching parameters to verify exact group arithmetic. Depth, bootstrapping, and staged-evaluation diagrams are conceptual models, not implementations of lattice FHE. The evaluator view illustrates a trust boundary within this local teaching page.
Worked examples: RSA, ElGamal, and Paillier

Inputs: M₁, M₂, and keys
Inputs for every tab in this walkthrough

Use whole-number messages. Prime inputs are limited to 100000 in this small-key arithmetic lab.

Worked-example slide

Download GIF

Experiment Parameters & Live Inputs

Predict the result

Show calculation trace
Why it works and what the model leaves out

Your lab notes

Record one change and explain the result. Saved only in this browser; export your notes before switching devices.

Lab map, learning guide, and primary references

Start with the eight core experiments, then choose applications or additional arithmetic. For each lab, state a prediction, change one input, inspect the trace, and record a limitation.

Foundational Academic References

  1. Armknecht et al. (2015), A Guide to Fully Homomorphic Encryption (ePrint 2015/1192)
  2. Rivest, Shamir & Adleman (1978), A Method for Obtaining Digital Signatures and Public-Key Cryptosystems
  3. ElGamal (1985), A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
  4. Paillier (EUROCRYPT 1999), Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
  5. Gentry (2009), A Fully Homomorphic Encryption Scheme (Stanford PhD Dissertation)
  6. Brakerski, Gentry and Vaikuntanathan (2012), (Leveled) Fully Homomorphic Encryption without Bootstrapping
  7. Fan & Vercauteren (2012), Somewhat Practical Fully Homomorphic Encryption (ePrint 2012/144)
  8. Cheon, Kim, Kim & Song (ASIACRYPT 2017), Homomorphic Encryption for Arithmetic of Approximate Numbers (ePrint 2016/421)
  9. Chillotti, Gama, Georgieva & Izabachene (2016), Faster FHE: Bootstrapping in Less Than 0.1 Seconds (ePrint 2016/870)
  10. Dwork & Roth (2014), The Algorithmic Foundations of Differential Privacy
  11. Microsoft SEAL — Official C++ Homomorphic Encryption Library
  12. OpenFHE — Open-Source Fully Homomorphic Encryption Library & Documentation
  13. HElib — Homomorphic Encryption Library (BGV / CKKS)
  14. HomomorphicEncryption.org, security guidelines and parameter resources

KFUPM COE 526: Privacy Enhancing Technologies · Standalone interactive laboratory.