## CryptoDB

### Paper: Succinct LWE Sampling, Random Polynomials, and Obfuscation

Authors: Lalita Devadas Willy Quach Vinod Vaikuntanathan Hoeteck Wee Daniel Wichs DOI: 10.1007/978-3-030-90453-1_9 Search ePrint Search Google Slides 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.
##### BibTeX
@article{tcc-2021-31528,
title={Succinct LWE Sampling, Random Polynomials, and Obfuscation},
booktitle={Theory of Cryptography;19th International Conference},
publisher={Springer},
doi={10.1007/978-3-030-90453-1_9},
author={Lalita Devadas and Willy Quach and Vinod Vaikuntanathan and Hoeteck Wee and Daniel Wichs},
year=2021
}