Obfuscation from polynomial hardness: beyond decomposable obfuscation

DOI10.1007/978-3-319-98113-0_22MaRDI QIDQ1796809zbMATH OpenOpenAlexFDO

Authors Y. Kang, Tal Malkin, Mariana Raykova, Chengyu Lin

Publication date 17 October 2018

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

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
• Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
• Breaking the sub-exponential barrier in obfustopia
• Indistinguishability obfuscation from functional encryption
• Candidate indistinguishability obfuscation and functional encryption for all circuits

Cited in

(6)

• Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
• Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness
• On strong simulation and composable point obfuscation
• Information Security and Privacy
• Structure vs. hardness through the obfuscation lens
• Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation

This page was built for publication: Obfuscation from polynomial hardness: beyond decomposable obfuscation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1796809)