Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR11-012 | 2nd February 2011 10:04

Input locality and hardness amplification

RSS-Feed




TR11-012
Authors: Andrej Bogdanov, Alon Rosen
Publication: 2nd February 2011 10:18
Downloads: 1269
Keywords: 


Abstract:

We establish new hardness amplification results for one-way functions in which each input bit influences only a small number of output bits (a.k.a. input-local functions). Our transformations differ from previous ones in that they approximately preserve input locality and at the same time retain the input size of the original function.

Let $f \colon \{0,1\}^n \to \{0,1\}^m$ be a one-way function with input locality $d$, and suppose that $f$ cannot be inverted in time $\exp(\tilde{O}(\sqrt{n}\cdot d))$ on an $\epsilon$-fraction of inputs. Our main results can be summarized as follows:

1. If $f$ is injective then it is equally hard to invert $f$ on a $(1-\epsilon)$-fraction of inputs.

2. If $f$ is regular then there is a function $g\colon \{0,1\}^n \!\to\! \{0,1\}^{m+O(n)}$ that~is $d+O(\log^3 n)$ input local and is equally hard to invert on a $(1-\epsilon)$-fraction of inputs.

A natural candidate for a function with small input locality and for which no sub-exponential time attacks are known is Goldreich's one-way function. To make our results applicable to this function, we prove that when its input locality is set to be $d=O(\log n)$ certain variants of the function are (almost) regular with high probability.

In some cases, our techniques are applicable even when the input locality is not small. We demonstrate this by extending our first main result to one-way functions of the "parity with noise" type.



ISSN 1433-8092 | Imprint