Bitansky, NirCanetti, RanCohn, HenryGoldwasser, ShafiKalai, Yael TaumanPaneth, OmerRosen, AlonGaray, J. A.Gennaro, R.2019-12-192019-12-192014-01-01Nir Bitansky, Ran Canetti, Henry Cohn, Shafi Goldwasser, Yael Tauman Kalai, Omer Paneth, Alon Rosen. 2014. "The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator." ADVANCES IN CRYPTOLOGY - CRYPTO 2014, PT II, Volume 8617, pp. 71 - 89 (19).0302-9743https://hdl.handle.net/2144/39026In 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).p. 71 - 89en-USScience & technologyComputer science, theory & methodsComputer scienceInformation and computing sciencesArtificial intelligence & image processingArticleDOI: 10.1007/978-3-662-44381-1_539084