Succinct Randomized Encodings from Lattices

Learn about a recent approach to construct succinct randomized encodings with close to optimal parameters based on the intractability of computational lattice problems in this conference talk by Giulio Malavolta from Bocconi University. Explore the theoretical foundations and practical implications of this cryptographic construction, which leverages the hardness assumptions of lattice-based problems to achieve efficiency in randomized encoding schemes. Discover how this work contributes to the field of obfuscation and understand the mathematical techniques used to achieve succinct parameters in the encoding process. Gain insights into the intersection of lattice cryptography and randomized encodings, examining both the security guarantees and the computational advantages of this approach compared to existing methods.