Series

Never Decrypted

5 parts of 5

1. Part 1 Never Decrypted: How Fully Homomorphic Encryption Computes on Ciphertext It Cannot Read

   Jul 20, 2026 · 40 min read

   Fully homomorphic encryption computes on data it cannot read. Inside: the mechanism, the noise budget that governs it, bootstrapping, and the honest 2026 cost.

2. Part 2 Never Decrypted: Proving You Ran the Computation Without Revealing It

   Jul 20, 2026 · 48 min read

   A prover hands you a few-kilobyte receipt that a program or AI model ran correctly on inputs you never see. How zero-knowledge proofs, zkVMs, and zkML work.

3. Part 3 The Trusted Party Nobody Has to Be: Secure Multiparty Computation and Threshold Cryptography, Where No One Holds the Secret

   Jul 20, 2026 · 50 min read

   Secure multiparty computation and threshold cryptography let distrusting parties compute on private data and sign with a key no single party ever holds.

4. Part 4 Never Decrypted: Reading the Row Without Revealing Which Row

   Jul 21, 2026 · 48 min read

   Private information retrieval lets a server answer your query without ever learning which row you asked for -- the 1995-to-2026 mechanism and its honest cost.

5. Part 5 Never Decrypted: When Math Is Too Slow, Silicon Keeps the Secret -- Confidential Computing and GPU TEEs

   Jul 23, 2026 · 51 min read

   How trusted execution environments keep a secret in silicon, not math, why attestation is the linchpin of confidential AI, and where the silicon model breaks.

← All series · Start here