Sum-of-squares meets program obfuscation, revisited
From MaRDI portal
Publication:2292645
Recommendations
- Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Cryptanalysis of candidate obfuscators for affine determinant programs
- Quantum attacks against indistinguishablility obfuscators proved secure in the weak multilinear map model
Cited in
(15)- Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
- Candidate iO from homomorphic encryption schemes
- Combiners for functional encryption, unconditionally
- Attribute-based access control for inner product functional encryption from LWE
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Succinct LWE sampling, random polynomials, and obfuscation
- On the (im)possibility of obfuscating programs
- One-Way Functions and (Im)perfect Obfuscation
- Candidate iO from homomorphic encryption schemes
- 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
- Lattice-based post-quantum iO from circular security with random opening assumption
- Indistinguishability obfuscation from well-founded assumptions
This page was built for publication: Sum-of-squares meets program obfuscation, revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292645)
