When does functional encryption imply obfuscation?
From MaRDI portal
Publication:1690189
DOI10.1007/978-3-319-70500-2_4zbMath1410.94073OpenAlexW2766139090MaRDI QIDQ1690189
Mohammad Mahmoody, Sanjam Garg, Ameer Mohammed
Publication date: 19 January 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-70500-2_4
Related Items (8)
Proofs of Work from worst-case assumptions ⋮ Structure-preserving compilers from new notions of obfuscations ⋮ On the complexity of compressing obfuscation ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Simple and generic constructions of succinct functional encryption ⋮ Candidate iO from homomorphic encryption schemes ⋮ Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption ⋮ 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?
