Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



Revision #1 to TR16-092 | 27th October 2016 10:20

-- Withdrawn --


Revision #1
Authors: Gilad Asharov, Alon Rosen, Gil Segev
Accepted on: 27th October 2016 10:20
Downloads: 1082


-- Withdrawn --

Changes to previous version:

-- Withdrawn --


TR16-092 | 3rd June 2016 18:32

Indistinguishability Obfuscation Does Not Reduce to Structured Languages

Authors: Gilad Asharov, Alon Rosen, Gil Segev
Publication: 3rd June 2016 20:08
Downloads: 1198


We prove that indistinguishability obfuscation (iO) and one-way functions do not naturally reduce to any language within $NP \cap coNP$. This is proved within the framework introduced by Asharov and Segev (FOCS '15) that captures the vast majority of techniques that have been used so far in iO-based constructions.

Our approach is based on a two-fold generalization of a classic result due to Impagliazzo and Naor (Structure in Complexity Theory '88) on non-deterministic computations via decision trees. First, we generalize their approach from the, rather restrictive, model of decision trees to arbitrary computations. Then, we further generalize the argument within the Asharov-Segev framework.

Our result explains why iO does not seem to suffice for certain applications, even when combined with the assumption that one-way functions exist. In these cases it appears that additional, more structured, assumptions are necessary. In addition, our result suggests that any attempt for ruling out the existence of iO by reducing it ``ad absurdum'' to a potentially efficiently-decidable language may encounter significant difficulties.

ISSN 1433-8092 | Imprint