On the complexity of compressing obfuscation

DOI10.1007/978-3-319-96878-0_26zbMATH Open1457.94092OpenAlexW2883862991MaRDI QIDQ5896077FDOQ5896077

Authors: Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass 

Publication date: 30 June 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Recommendations

• On the complexity of compressing obfuscation
• On statistically secure obfuscation with approximate correctness
• One-Way Functions and (Im)perfect Obfuscation
• Lower bounds on assumptions behind indistinguishability obfuscation
• Indistinguishability obfuscation from functional encryption

zbMATH Keywords

indistinguishability obfuscationcompressing obfuscation with perfect correctness

Mathematics Subject Classification ID

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

Cited In (5)

• On the compressibility of \(\mathcal{NP}\) instances and cryptographic applications
• Simple and generic constructions of succinct functional encryption
• On the complexity of compressing obfuscation
• On Best-Possible Obfuscation
• Structure vs. hardness through the obfuscation lens

This page was built for publication: On the complexity of compressing obfuscation

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