Theory of Cryptography Conference

TCC 2011: Theory of Cryptography pp 1-18

Input Locality and Hardness Amplification

  • Andrej Bogdanov
  • Alon Rosen
Conference paper

DOI: 10.1007/978-3-642-19571-6_1

Volume 6597 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Bogdanov A., Rosen A. (2011) Input Locality and Hardness Amplification. In: Ishai Y. (eds) Theory of Cryptography. TCC 2011. Lecture Notes in Computer Science, vol 6597. Springer, Berlin, Heidelberg

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 : {0, 1}n → {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 ε-fraction of inputs. Our main results can be summarized as follows:

  • If f is injective then it is equally hard to invert f on a (1 − ε)-fraction of inputs.

  • If f is regular then there is a function g: {0, 1}n → {0, 1}m + O(n) that is d + O(log3n) input local and is equally hard to invert on a (1 − ε)-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(logn) 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.

Keywords

one-way functioninput localityhardness amplificationparity with noise
Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Andrej Bogdanov
    • 1
    • 2
  • Alon Rosen
    • 3
  1. 1.Dept. of CSEChinese Univ. of Hong KongHong Kong
  2. 2.ITCSCChinese Univ. of Hong KongHong Kong
  3. 3.Efi Arazi School of Computer ScienceIDC HerzliyaIsrael