Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness

DOI10.1007/978-3-319-70500-2_6zbMath1410.94093OpenAlexW2604607303MaRDI QIDQ5915836

Mark Zhandry, Qipeng Liu

Publication date: 19 January 2018

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-70500-2_6

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ FE and iO for Turing machines from minimal assumptions ⋮ Distributed (correlation) samplers: how to remove a trusted dealer in one round ⋮ Proofs of Work from worst-case assumptions ⋮ Collusion-resistant functional encryption for RAMs ⋮ On the complexity of compressing obfuscation

This page was built for publication: Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness