Succinct Randomized Encodings from Laconic Function Evaluation - Faster and Simpler

Learn about advanced cryptographic constructions for succinct randomized encodings in this 37-minute conference talk that presents new theoretical breakthroughs in computational efficiency and post-quantum security. Explore how to encode inputs of time-t uniform computations in sub-linear time o(t) while preserving computational results but hiding input information, with applications including time-lock puzzles, reducing MPC communication, and bootstrapping advanced encryption schemes. Discover the evolution from indistinguishability obfuscation-based constructions to newer approaches using Circular Learning with Errors assumptions that provide post-quantum resistance. Examine the presenter's novel construction that achieves encoding time approximately t^ε · s for arbitrarily small constant ε