Abstract

Although we have known fully homomorphic encryption (FHE) from circular security assumptions for over a decade, there is still a significant gap in understanding related homomorphic primitives supporting all unrestricted polynomial-size computations. One prominent example is attribute-based encryption (ABE). Previous constructions either only support bounded-depth circuits or require the heavy machinery of indistinguishability obfuscation. In this work, we introduce new lattice-based techniques to overcome this limitation. In this talk, I will introduce the background, explain our new constructions, and discuss interesting open questions. Joint work with Yao-Ching Hsieh and Huijia (Rachel) Lin.