- Published 2015 in Electronic Colloquium on Computational Complexity

A circuit C compresses a function f : {0, 1} → {0, 1} if given an input x ∈ {0, 1} the circuit C can shrink x to a shorter `-bit string x′ such that later, a computationallyunbounded solver D will be able to compute f(x) based on x′. In this paper we study the existence of functions which are incompressible by circuits of some fixed polynomial size s = n. Motivated by cryptographic applications, we focus on average-case (`, ) incompressibility, which guarantees that on a random input x ∈ {0, 1}, for every size s circuit C : {0, 1} → {0, 1} and any unbounded solver D, the success probability Prx[D(C(x)) = f(x)] is upper-bounded by 2−m + . While this notion of incompressibility appeared in several works (e.g., Dubrov and Ishai, STOC 06), so far no explicit constructions of efficiently computable incompressible functions were known. In this work we present the following results: (1) Assuming that E is hard for exponential size nondeterministic circuits, we give polynomial time computable incompressible functions f for size n circuits. We can achieve a boolean f with ` = (1−o(1)) ·n and = n−c. Our technique generalizes to the case of PRGs against nonboolean circuits, improving and simplifying the previous construction of Shaltiel and Artemenko (STOC 14). (2) We show that it is possible to achieve negligible error parameter = n−ω(1) for nonboolean functions. Specifically, assuming that E is hard for exponential size Σ3-circuits, we construct a nonboolean function f : {0, 1} → {0, 1} which is incompressible by size n circuits with ` = Ω(n) and extremely small = n−c · 2−m. Our construction combines the techniques of Trevisan and Vadhan (FOCS 00) with a new notion of relative error deterministic extractor which may be of independent interest. (3) We show that the task of constructing an incompressible boolean function f : {0, 1} → {0, 1} with negligible error parameter cannot be achieved by “existing proof techniques”. Namely, nondeterministic reductions (or even Σi reductions) cannot get = n −ω(1) for boolean incompressible functions. Our results also apply to constructions of standard Nisan-Wigderson type PRGs and (standard) boolean functions that are hard on average, explaining, in retrospective, the limitations of existing constructions. Our impossibility result builds on an approach of Shaltiel and Viola (STOC 08). ∗A preliminary version of this paper appears in the 30th Conference on Computational Complexity (CCC’15). ISSN 1433-8092 Electronic Colloquium on Computational Complexity, Revision 1 of Report No. 51 (2015)

@article{Applebaum2015IncompressibleFR,
title={Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterminsitic Reductions},
author={Benny Applebaum and Sergei Artemenko and Ronen Shaltiel and Guang Yang},
journal={Electronic Colloquium on Computational Complexity (ECCC)},
year={2015},
volume={22},
pages={51}
}