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(log3 n) 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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
N. Alon, J. Spencer, The Probabilistic Method (Wiley, New York, 1992)
B. Applebaum, Y. Ishai, E. Kushilevitz, Cryptography in NC0, in FOCS 2004 (2004), pp. 166–175
B. Applebaum, Y. Ishai, E. Kushilevitz, Cryptography with constant input locality, in CRYPTO 2007 (2007), pp. 92–110. Journal version in J. Cryptol. 22(4), 429–469 (2009)
B. Applebaum, B. Barak, A. Wigderson, Public-key cryptography from different assumptions, in STOC 2010 (2010), pp. 171–180
J. Blömer, R.M. Karp, E. Welzl, The rank of sparse random matrices over finite fields. Random Struct. Algorithms 10(4), 407–419 (1997)
A. Blum, A. Kalai, H. Wasserman, Noise-tolerant learning, the parity problem, and the statistical query model, in STOC 2000 (2000), pp. 435–440
A. Bogdanov, Y. Qiao, On the security of Goldreich’s one-way function, in APPROX-RANDOM 2009 (2009), pp. 392–405
J. Cook, O. Etesami, R. Miller, L. Trevisan, Goldreich’s one-way function candidate and myopic backtracking algorithms, in TCC 2009 (2009), pp. 521–538
D.P. Dubhashi, A. Panconesi, Concentration of Measure for the Analysis of Randomized Algorithms (Cambridge University Press, Cambridge, 2009)
O. Goldreich, Candidate one-way functions based on expander graphs, in Electronic Colloquium on Computational Complexity (ECCC), vol. 7(90) (2000)
O. Goldreich, R. Impagliazzo, L.A. Levin, R. Venkatesan, D. Zuckerman, Security preserving amplification of hardness, in FOCS 1990 (1990), pp. 318–326
O. Goldreich, H. Krawczyk, M. Luby, On the existence of pseudorandom generators. SIAM J. Comput. 22(6), 1163–1175 (1993)
I. Haitner, D. Harnik, O. Reingold, On the power of the randomized iterate, in CRYPTO 2006 (2006), pp. 22–40
R. Impagliazzo, M. Luby, One-way functions are essential for complexity based cryptography, in FOCS 1989 (1989), pp. 230–235
R. Impagliazzo, L. Levin, M. Luby, Pseudo-random generation from one-way functions, in STOC 1989 (1989), pp. 12–24
Y. Mansour, N. Nisan, P. Tiwari, The computational complexity of universal hashing. Theor. Comput. Sci. 107(1), 121–133 (1993)
H.C. Lin, L. Trevisan, H. Wee, On hardness amplification of one-way functions, in TCC 2005 (2005), pp. 34–49
A.C.-C. Yao, Theory and applications of trapdoor functions (Extended Abstract), in FOCS 1982 (1982), pp. 80–91
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Ran Canetti
This paper was solicited from TCC 2011.
Rights and permissions
About this article
Cite this article
Bogdanov, A., Rosen, A. Input Locality and Hardness Amplification. J Cryptol 26, 144–171 (2013). https://doi.org/10.1007/s00145-011-9117-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00145-011-9117-y