Limits on Low-Degree Pseudorandom Generators - Or - Sum-of-Squares Meets Program Obfuscation

Limits on Low-Degree Pseudorandom Generators - Or - Sum-of-Squares Meets Program Obfuscation

Explore a conference talk presenting groundbreaking research on the limitations of low-degree pseudorandom generators and their intersection with program obfuscation techniques. Delve into the findings of Boaz Barak, Zvika Brakerski, Ilan Komargodski, and Pravesh K. Kothari as they unveil their paper at Eurocrypt 2018. Gain insights into the innovative application of sum-of-squares methodology to cryptographic constructions and understand its implications for program obfuscation. Discover how this 27-minute presentation challenges existing notions and pushes the boundaries of cryptographic theory, offering a fresh perspective on the interplay between pseudorandom generators and obfuscation techniques.