CryptoDB
Lalita Devadas
Publications
Year
Venue
Title
2021
TCC
Succinct LWE Sampling, Random Polynomials, and Obfuscation
📺
Abstract
We present a construction of indistinguishability obfuscation (iO) that relies on the learning with errors (LWE) assumption together with a new notion of succinctly sampling pseudo-random LWE samples. We then present a candidate LWE sampler whose security is related to the hardness of solving systems of polynomial equations. Our construction improves on the recent iO candidate of Wee and Wichs (Eurocrypt 2021) in two ways: first, we show that a much weaker and simpler notion of LWE sampling suffices for iO; and secondly, our candidate LWE sampler is secure based on a compactly specified and falsifiable assumption about random polynomials, with a simple error distribution that facilitates cryptanalysis.
Coauthors
- Willy Quach (1)
- Vinod Vaikuntanathan (1)
- Hoeteck Wee (1)
- Daniel Wichs (1)