不可能使用辅助输入或通用模拟器进行混淆
The impossibility of obfuscation with auxiliary input or a universal simulator
摘要：
在本文中，我们表明，存在一般的不可混淆混淆的模糊在最近的一些作品中，暗示，有点违反直觉，强大的不可能性结果虚拟黑盒混淆。特别是，我们证明了所有电路的不可混淆性意味着：* 不可能的平均情况下的虚拟黑盒混淆与辅助输入的超多项式伪熵的任何电路家族。这样的电路族包括所有伪随机函数族，以及所有加密算法族和伪随机地生成它们所需的硬币翻转的随机化数字签名。即使当辅助输入仅依赖于公共电路族而不是被混淆的族中的特定电路时，也不可能。* 对于具有超多项式伪熵的任何电路族，不可能使用通用模拟器（有或没有任何辅助输入）进行平均情况的虚拟黑盒混淆。这些界限显著加强了Goldwasser和Kalai（STOC 2005）的不可能性结果。
英文摘要：
In this paper we show that the existence of general indistinguishability obfuscators conjectured in a few recent works implies, somewhat counterintuitively, strong impossibility results for virtual black box obfuscation. In particular, we show that indistinguishability obfuscation for all circuits implies: * The impossibility of average-case virtual black box obfuscation with auxiliary input for any circuit family with super-polynomial pseudo-entropy. Such circuit families include all pseudo-random function families, and all families of encryption algorithms and randomized digital signatures that generate their required coin flips pseudo-randomly. Impossibility holds even when the auxiliary input depends only on the public circuit family, and not the specific circuit in the family being obfuscated. * The impossibility of average-case virtual black box obfuscation with a universal simulator (with or without any auxiliary input) for any circuit family with super-polynomial pseudo-entropy. These bounds significantly strengthen the impossibility results of Goldwasser and Kalai (STOC 2005).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
