When does functional encryption imply obfuscation?
From MaRDI portal
Recommendations
- Indistinguishability obfuscation from functional encryption
- Obfustopia built on secret-key functional encryption
- Indistinguishability obfuscation from compact functional encryption
- From cryptomania to obfustopia through secret-key functional encryption
- Breaking the sub-exponential barrier in obfustopia
Cited in
(19)- Structure-preserving compilers from new notions of obfuscations
- Obfustopia built on secret-key functional encryption
- Simple and generic constructions of succinct functional encryption
- On the relationship between functional encryption, obfuscation, and fully homomorphic encryption
- FE and iO for Turing machines from minimal assumptions
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from functional encryption
- Limits on the power of indistinguishability obfuscation and functional encryption
- Breaking the sub-exponential barrier in obfustopia
- Simple and generic constructions of succinct functional encryption
- On the complexity of compressing obfuscation
- Candidate iO from homomorphic encryption schemes
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Proofs of Work from worst-case assumptions
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Lower bounds for lattice-based compact functional encryption
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Black-box use of one-way functions is useless for optimal fair coin-tossing
This page was built for publication: When does functional encryption imply obfuscation?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690189)
