2 research outputs found
The Impossibility of Obfuscation with a Universal Simulator
We show that indistinguishability obfuscation implies that
all functions with sufficient ``pseudo-entropy\u27\u27 cannot be obfuscated
under a virtual black box definition with a universal simulator. Let
be a circuit family with super-polynomial
pseudo-entropy, and suppose is a candidate obfuscator with
universal simulator \Sim. We demonstrate the existence of an adversary \Adv that, given the obfuscation , learns a predicate the simulator \Sim cannot learn from the code of \Adv and black-box access to . Furthermore, this is true in a strong sense: for \emph{any} secret predicate that is not learnable from black-box access to , there exists an adversary that given efficiently recovers , whereas given oracle access to and given the code of the adversary, it is computationally hard to recover .
We obtain this result by exploiting a connection between obfuscation with a universal simulator and obfuscation with auxiliary inputs, and by showing new impossibility results for obfuscation with auxiliary inputs
The Impossibility of Obfuscation with a Universal Simulator
This is an out of date draft. The paper was merged with More on the Impossibility o