Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
From MaRDI portal
Publication:1648854
DOI10.1007/978-3-319-78375-8_21zbMath1428.94058OpenAlexW2620921418MaRDI QIDQ1648854
Boaz Barak, Pravesh K. Kothari, Ilan Komargodski, Zvika Brakerski
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78375-8_21
Related Items (12)
One-Way Functions and (Im)perfect Obfuscation ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ Matrix PRFs: constructions, attacks, and applications to obfuscation ⋮ Worst-case subexponential attacks on PRGs of constant degree or constant locality ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Indistinguishability obfuscation ⋮ Unnamed Item ⋮ On the complexity of compressing obfuscation ⋮ Candidate iO from homomorphic encryption schemes ⋮ Candidate iO from homomorphic encryption schemes ⋮ Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE ⋮ Combiners for functional encryption, unconditionally
This page was built for publication: Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
