Series

Never Decrypted

3 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.

← All series · Start here