Succinct Randomized Encodings from Laconic Function Evaluation, Faster and Simpler

Succinct randomized encodings allow encoding the input x of a time-t uniform computation M(x) in sub-linear time o(t). The resulting encoding x~ allows recovering the result of the computation M(x), but hides any other information about x. These encodings have powerful applications, including time-lock puzzles, reducing communication in MPC, and bootstrapping advanced encryption schemes. Until not long ago, the only known constructions were based on indistinguishability obfuscation, and in particular were not based on standard post-quantum assumptions. In terms of efficiency, these constructions’ encoding time is polylog(t), essentially the best one can hope for. Recently, a new construction was presented based on Circular Learning with Errors, an assumption similar to the one used in fully-homomorphic encryption schemes, and which is widely considered to be post-quantum resistant. However, the encoding efficiency significantly falls behind obfuscation-based scheme and is ≈t·s, where s is the space of the computation. We construct, under the same assumption, succinct randomized encodings with encoding time ≈t^ε·s for arbitrarily small constant ε<1. Our construction is relatively simple, generic and relies on any laconic function evaluation scheme that satisfies a natural efficiency preservation property. Under sub-exponential assumptions, the encoding time can be further reduced to ≈s, but at the account of a huge security loss. As a corollary, assuming also bounded-space languages that are worst-case hard-to-parallelize, we obtain time-lock puzzles with an arbitrary polynomial gap between encoding and decoding times.