Abstract

We present a recent approach to construct succinct randomized encodings with close to optimal parameters, assuming the intractability of computational problems related to lattices.