The final nail in the coffin of statistically-secure obfuscator

DOI10.1016/j.ipl.2023.106366OpenAlexW4319875855MaRDI QIDQ6161431

Ilya Volkovich

Publication date: 5 June 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2023.106366

zbMATH Keywords

obfuscationimperfect obfuscationstatistical obfuscation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On best-possible obfuscation
• A note on computational indistinguishability
• Does co-NP have short interactive proofs ?
• On Statistically Secure Obfuscation with Approximate Correctness
• Zero Knowledge and Circuit Minimization
• The Minimum Oracle Circuit Size Problem.
• Circuit minimization problem
• A complete problem for statistical zero knowledge
• On Best-Possible Obfuscation
• Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table
• How to use indistinguishability obfuscation
• On the NP-Completeness of the Minimum Circuit Size Problem.
• On the (im)possibility of obfuscating programs
• Power from Random Strings
• Two-Round Secure MPC from Indistinguishability Obfuscation

This page was built for publication: The final nail in the coffin of statistically-secure obfuscator