Stanford researchers achieve O(1) overhead for encrypted neural network inference using equivariant functions

New paper from Stanford (arXiv:2502.01013) presents an elegant solution to the encrypted computation problem.

**The problem:** Homomorphic encryption enables computation on encrypted data but with O(n²) to O(n³) overhead, making it impractical for neural networks.

**Their solution:** Restrict neural networks to equivariant functions where:

- f(Enc(x)) = Enc(f(x))

- Encryption and model operations commute

**Implementation:**

- Standard symmetric encryption (AES-128)

- Modified neural architectures using only equivariant layers

- Convolutions with circulant matrices

- Polynomial activations

**Computational complexity:**

- Homomorphic approach: O(n²·log n) per layer

- Their approach: O(n) - identical to unencrypted

- Actual overhead: 0% (measured)

**Results on standard benchmarks:**

- MNIST: 99.999% encrypted vs 99.998% plaintext

- CIFAR-10: 96% encrypted vs 95% plaintext

- FashionMNIST: 95.1% encrypted vs 95.0% plaintext

The theoretical elegance is compelling - rather than brute-forcing arbitrary functions to work with encryption, they find the subset of functions that naturally preserve cryptographic structure.

Paper: https://arxiv.org/abs/2502.01013

Deep dive into the limitations and practical implications: https://youtu.be/PXKO5nkVLI4

From a computational complexity perspective, this seems like the right approach - work within mathematical constraints rather than against them. Thoughts?