Private Computing with Homomorphic Encryption

From Foundations to Production for Software Engineers

Introduction

Chapter 1: The Promise and Limits of Private Computation

1. A Day in the Life of Sensitive Data
2. Trust Problems and Why Encryption Alone Is Not Enough
3. Threat Models That Matter
4. The Privacy-Preserving Computation Landscape
5. When Homomorphic Encryption Is the Right Tool
6. How This Book Is Organized

Chapter 2: Cryptographic Prerequisites for Software Engineers

1. What Modern Encryption Actually Guarantees
2. Symmetric and Asymmetric Cryptography in One Page Each
3. Semantic Security and Indistinguishability
4. Computational Hardness Assumptions
5. Randomness and Entropy in Cryptographic Systems
6. The Gap Between Textbook and Real-World Cryptography

Chapter 3: Number Theory Foundations — Modular and Polynomial Arithmetic

1. Integers Modulo N
2. Extended Euclidean Algorithm and Its Role in Cryptography
3. Polynomial Arithmetic Over Finite Rings
4. Cyclotomic Polynomials and Why They Matter for HE
5. Number Theoretic Transform — the Fast Way to Multiply Polynomials
6. Computational Complexity of Polynomial Operations

Chapter 4: Lattices, Learning With Errors, and the Hard Problems Behind HE

1. What Is a Lattice?
2. Hard Problems on Lattices
3. Learning With Errors — the Core Assumption
4. Ring-LWE — Polynomials Make It Efficient
5. Why Lattices Resist Quantum Attacks
6. Security Levels and Parameter Choices

Chapter 5: Homomorphic Encryption — Core Concepts and Mechanics

1. The Basic Idea
2. Partially, Somewhat, Fully — Levels of Homomorphism Defined
3. Noise as the Fundamental Resource
4. Ciphertext Expansion and Why Encrypted Data Is Big
5. Keys in HE
6. The Basic Operations: Encrypt, Decrypt, Add, Multiply

Chapter 6: Advanced HE Operations — Depth, Levels, and Management Techniques

1. Multiplicative Depth and Computational Levels
2. Relinearization — Keeping Ciphertexts Manageable After Multiplication
3. Rescaling — Making Room for More Computation
4. Modulus Switching — Reducing Noise Without Bootstrapping
5. Rotations and Permutations — Moving Data Within Encrypted Vectors
6. SIMD Batching and Vectorization — Doing Many Computations at Once

Chapter 7: Exact Arithmetic Schemes — BFV and BGV

1. The BFV Scheme End-to-End
2. The BGV Scheme and How It Differs from BFV
3. Parameter Selection for Exact Arithmetic
4. Encoding Integers and Vectors in BFV/BGV
5. Noise Budget Analysis for Exact Schemes
6. Practical Performance Characteristics

Chapter 8: Approximate Arithmetic — The CKKS Scheme for Real and Complex Numbers

1. Why Approximate? Motivation from ML and Scientific Computing
2. The CKKS Construction End-to-End
3. Encoding Real and Complex Numbers — Scaling and Precision
4. How Rescaling Works in CKKS — the Key to Multiplicative Depth
5. Managing Precision Loss Across Computation
6. Choosing Parameters for Target Accuracy

Chapter 9: Boolean and Circuit-Oriented HE — TFHE

1. Why Boolean Circuits? Comparison with Arithmetic Circuits
2. The TFHE Construction at a High Level
3. Gate Bootstrapping — How TFHE Refreshes Ciphertexts
4. NAND Gates, Multiplexers, and Building Complex Functions
5. Performance Characteristics of TFHE

Chapter 10: Scheme Comparison and Selection Framework

1. Decision Tree for Scheme Selection
2. Comprehensive Scheme Comparison Table
3. Library Landscape
4. Interoperability and Standardization Efforts
5. Migration Between Schemes and Libraries
6. Future-Proofing Your HE Choices

Chapter 11: Encoding, Key Management, and Core Operations

1. Plaintext Encoding Strategies
2. Key Generation in Practice
3. Encryption and Decryption Implementation Walkthrough
4. Basic Homomorphic Operations — Addition, Multiplication, Negation
5. Serialization and Storage of Keys and Ciphertexts
6. Debugging Your First HE Program

Chapter 12: Circuit Design and Algorithm Transformation for HE

1. Analyzing Algorithms for HE Compatibility
2. Arithmetic Circuits vs Boolean Circuits — Choosing Representation
3. Minimizing Multiplicative Depth — Algebraic Tricks and Approximations
4. Handling Conditionals and Branching in HE
5. Exploiting SIMD/Batching for Parallel Workloads
6. Approximating Non-Polynomial Functions — ReLU, Sigmoid, Division

Chapter 13: End-to-End Implementations — From Prototype to Working System

1. Implementation 1: Encrypted Arithmetic Calculator
2. Implementation 2: Private Aggregation and Analytics Pipeline
3. Implementation 3: Encrypted Database-Style Queries
4. Implementation 4: Private ML Inference Service
5. Testing, Validation, and Correctness Verification Strategies

Chapter 14: Architecture, Performance, and Operations in Production

1. Client/Server Architectures for HE Systems
2. Multi-User and Federated Scenarios
3. Performance Profiling and Optimization
4. Bandwidth Management for Large Ciphertexts
5. Observability, Logging, and Monitoring Without Leaking Secrets
6. Key Rotation, Versioning, and Long-Term Maintenance

Chapter 15: Bootstrapping — Theory, Practice, and Trade-offs

1. Why Bootstrapping Is Necessary — the Noise Exhaustion Problem
2. How Bootstrapping Works Conceptually — Evaluate Decryption on Encrypted Data
3. Mathematical Details of Bootstrapping in Different Schemes
4. Performance Cost — Why It Is Expensive and When You Can Avoid It
5. Leveled HE vs Fully Homomorphic HE in Practice
6. Emerging Optimizations and Hardware Acceleration

Chapter 16: Security Considerations — What HE Protects and What It Does Not

1. Honest-but-Curious vs Malicious Adversaries — What Each Scheme Assumes
2. Metadata Leakage — Sizes, Timing, Access Patterns
3. Side Channels in HE Implementations
4. Integrity and Authentication Limitations
5. Common Security Mistakes and Anti-Patterns
6. Defense-in-Depth with HE — Combining with TLS, MACs, and Other Mechanisms

Chapter 17: Comparing Technologies and Hybrid Architectures

1. Trusted Execution Environments — When They Beat HE
2. Secure Multi-Party Computation — Collaboration Without a Server
3. Zero-Knowledge Proofs — Verification Without Disclosure
4. Differential Privacy — Aggregate Privacy vs Individual Encryption
5. Hybrid Architectures — HE + TEE, HE + MPC, HE + ZKP
6. Technology Selection Framework for Real Projects

Chapter 18: The Evolving Ecosystem and Future Directions

1. Standardization Landscape — NIST, IETF, ISO, Industry Consortia
2. Hardware Acceleration — FPGAs, GPUs, ASICs for HE
3. Emerging Research Directions
4. Framework for Evaluating New HE Schemes and Libraries
5. Practical Readiness Assessment — Is HE Ready for Your Use Case?

Conclusion

1. The Path from Understanding to Production
2. Final Checklist Before Deploying HE
3. Resources for Continued Learning

Glossary

Notation Reference

Scheme Comparison Reference

Parameter Selection Reference

Troubleshooting Guide

Architectural Decision Guide

References