Lower bounds on obfuscation from all-or-nothing encryption primitives

DOI10.1007/978-3-319-63688-7_22zbMath1407.94109OpenAlexW2731802362MaRDI QIDQ1675748

Mohammad Mahmoody, Ameer Mohammed, Sanjam Garg

Publication date: 3 November 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-63688-7_22

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (9)

Proofs of Work from worst-case assumptions ⋮ Witness encryption and null-iO from evasive LWE ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ On the complexity of compressing obfuscation ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Obfustopia built on secret-key functional encryption ⋮ Candidate iO from homomorphic encryption schemes ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing

This page was built for publication: Lower bounds on obfuscation from all-or-nothing encryption primitives