Sum-of-squares meets program obfuscation, revisited
From MaRDI portal
Publication:2292645
DOI10.1007/978-3-030-17653-2_8zbMath1470.94077OpenAlexW2911933141MaRDI QIDQ2292645
Amit Sahai, Aayush Jain, Samuel B. Hopkins, Boaz Barak, Pravesh K. Kothari
Publication date: 4 February 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-17653-2_8
Related Items (10)
One-Way Functions and (Im)perfect Obfuscation ⋮ Attribute-based access control for inner product functional encryption from LWE ⋮ 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} \) ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Indistinguishability obfuscation ⋮ Succinct LWE sampling, random polynomials, and obfuscation ⋮ Candidate iO from homomorphic encryption schemes ⋮ Candidate iO from homomorphic encryption schemes ⋮ Combiners for functional encryption, unconditionally
This page was built for publication: Sum-of-squares meets program obfuscation, revisited
