Indistinguishability obfuscation for Turing machines: constant overhead and amortization
From MaRDI portal
Publication:1680213
DOI10.1007/978-3-319-63715-0_9zbMath1409.94860OpenAlexW2740277437MaRDI QIDQ1680213
Amit Sahai, Abhishek Jain, Prabhanjan V. Ananth
Publication date: 15 November 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-63715-0_9
Related Items (9)
Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ FE and iO for Turing machines from minimal assumptions ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ New ways to garble arithmetic circuits ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Laconic function evaluation for Turing machines ⋮ Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries ⋮ The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free
This page was built for publication: Indistinguishability obfuscation for Turing machines: constant overhead and amortization
