Running Circuits of Unbounded Depth over Encrypted Data, Securely, Using Lattices

Learn about advanced lattice-based cryptographic techniques for running unbounded-depth circuits over encrypted data in this 46-minute conference talk from the Simons Institute. Explore the significant gap between fully homomorphic encryption (FHE) and related homomorphic primitives like attribute-based encryption (ABE) that support unrestricted polynomial-size computations. Discover how previous ABE constructions were limited to bounded-depth circuits or required complex indistinguishability obfuscation machinery. Examine new lattice-based techniques that overcome these limitations, allowing for secure computation on encrypted data without depth restrictions. Gain insights into the background of homomorphic encryption, understand the novel construction methods presented, and engage with interesting open questions in the field of cryptography and secure computation.