Fully homomorphic encryption (FHE), which supports arbitrary computations, has been theoretically possible since Craig Gentry's breakthrough paper in 2009. But it remains computationally expensive — operations on encrypted data are 10,000x to 1,000,000x slower than the same operations on plaintext.