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.
Chapter PDF
References
Alon, N., Spencer, J.: The Probabilistic Method. John Wiley, Chichester (1992)
Applebaum, B., Barak, B., Wigderson, A.: Public-key cryptography from different assumptions. In: STOC 2010, pp. 171–180 (2010)
Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC0. In: FOCS 2004, pp. 166–175 (2004)
Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography with Constant Input Locality. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 92–110. Springer, Heidelberg (2007); Journal version in J. Cryptology 22(4), 429-469 (2009)
Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. In: STOC 2000, pp. 435–440 (2000)
Bogdanov, A., Qiao, Y.: On the security of goldreich’s one-way function. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009. LNCS, vol. 5687, pp. 392–405. Springer, Heidelberg (2009)
Cook, J., Etesami, O., Miller, R., Trevisan, L.: Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 521–538. Springer, Heidelberg (2009)
Goldreich, O.: Candidate One-Way Functions Based on Expander Graphs. Electronic Colloquium on Computational Complexity (ECCC) 7(90) (2000)
Goldreich, O., Impagliazzo, R., Levin, L.A., Venkatesan, R., Zuckerman, D.: Security Preserving Amplification of Hardness. In: FOCS 1990, pp. 318–326 (1990)
Goldreich, O., Krawczyk, H., Luby, M.: On the Existence of Pseudorandom Generators. SIAM J. Comput. 22(6), 1163–1175 (1993)
Haitner, I., Harnik, D., Reingold, O.: On the Power of the Randomized Iterate. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 22–40. Springer, Heidelberg (2006)
Impagliazzo, R., Levin, L., Luby, M.: Pseudo-random Generation from One-way Functions. In: STOC 1989, pp. 12–24 (1989)
Impagliazzo, R., Luby, M.: One-way Functions are Essential for Complexity Based Cryptography. In: FOCS 1989, pp. 230–235 (1989)
Mansour, Y., Nisan, N., Tiwari, P.: The Computational Complexity of Universal Hashing. Theor. Comput. Sci. 107(1), 121–133 (1993)
Lin, H.C., Trevisan, L., Wee, H.: On Hardness Amplification of One-Way Functions. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 34–49. Springer, Heidelberg (2005)
Yao, A.C.-C.: Theory and Applications of Trapdoor Functions (Extended Abstract). In: FOCS 1982, pp. 80–91 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 International Association for Cryptologic Research
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-642-19571-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-19571-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19570-9
Online ISBN: 978-3-642-19571-6
eBook Packages: Computer ScienceComputer Science (R0)