Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with Indistinguishability Obfuscation:
TR16-091 | 3rd June 2016
Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan

Structure vs Hardness through the Obfuscation Lens

Revisions: 3

Cryptography relies on the computational hardness of structured problems. While one-way functions, the most basic cryptographic object, do not seem to require much structure, as we advance up the ranks into public-key cryptography and beyond, we seem to require that certain structured problems are hard. For example, factoring, quadratic residuosity, ... more >>>

TR20-126 | 19th August 2020
Aayush Jain, Huijia Lin, Amit Sahai

Indistinguishability Obfuscation from Well-Founded Assumptions

In this work, we show how to construct indistinguishability obfuscation from subexponential hardness of four well-founded assumptions. We prove:

Let $\tau \in (0,\infty), \delta \in (0,1), \epsilon \in (0,1)$ be arbitrary constants. Assume sub-exponential security of the following assumptions, where $\lambda$ is a security parameter, and the parameters $\ell,k,n$ below ... more >>>

TR21-085 | 21st June 2021
Ilya Volkovich

The Final Nail in the Coffin of Statistically-Secure Obfuscator.

We present an elementary, self-contained proof of the result of Goldwasser and Rothblum [GR07] that the existence of a (perfect) statistically secure obfuscator implies a collapse of the polynomial hierarchy. In fact, we show that an existence of a weaker object implies a somewhat stronger statement. In addition, we extend ... more >>>

TR23-038 | 28th March 2023
Rahul Ilango, Jiatu Li, Ryan Williams

Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic

The range avoidance problem (denoted by Avoid) asks to find a string outside of the range of a given circuit $C:\{0,1\}^n\to\{0,1\}^m$, where $m>n$. Although at least half of the strings of length $m$ are correct answers, it is not clear how to deterministically find one. Recent results of Korten (FOCS'21) ... more >>>

TR23-079 | 31st May 2023
Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich

Mutual Empowerment between Circuit Obfuscation and Circuit Minimization

We study close connections between Indistinguishability Obfuscation ($IO$) and the Minimum Circuit Size Problem ($MCSP$), and argue that algorithms for one of $MCSP$ or $IO$ would empower the other one. Some of our main results are:

\item If there exists a perfect (imperfect) $IO$ that is computationally secure ... more >>>

ISSN 1433-8092 | Imprint