Abstract
We consider two of the most fundamental theorems in Cryptography. The first, due to Håstad et al. [HILL99], is that pseudorandom generators can be constructed from any one-way function. The second due to Yao [Yao82] states that the existence of weak one-way functions (i.e. functions on which every efficient algorithm fails to invert with some noticeable probability) implies the existence of full fledged one-way functions. These powerful plausibility results shape our understanding of hardness and randomness in Cryptography. Unfortunately, the reductions given in [HILL99, Yao82] are not as security preserving as one may desire. The main reason for the security deterioration is the input blow up in both of these constructions. For example, given one-way functions on n bits one obtains by [HILL99] pseudorandom generators with seed length Ω(n 8).
This paper revisits a technique that we call the Randomized Iterate, introduced by Goldreich, et. al.[GKL93]. This technique was used in to give a construction of pseudorandom generators from regular one-way functions. We simplify and strengthen this technique in order to obtain a similar reduction where the seed length of the resulting generators is as short as \({\cal{O}}(n \log n)\) rather than Ω(n 3) in [GKL93]. Our technique has the potential of implying seed-length \({\cal{O}}(n)\), and the only bottleneck for such a result is the parameters of current generators against space bounded computations. We give a reduction with similar parameters for security amplification of regular one-way functions. This improves upon the reduction of Goldreich et al. [GIL+90] in that the reduction does not need to know the regularity parameter of the functions (in terms of security, the two reductions are incomparable). Finally, we show that the randomized iterate may even be useful in the general context of [HILL99]. In Particular, we use the randomized iterate to replace the basic building block of the [HILL99] construction. Interestingly, this modification improves efficiency by an n 3 factor and reduces the seed length to \({\cal{O}}(n^7)\) (which also implies improvement in the security of the construction).
Chapter PDF
References
Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC\(^{\mbox{0}}\). In: 45th FOCS, pp. 166–175 (2004)
Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo random bits. In: 23th FOCS, pp. 112–117 (1982)
Di Crescenzo, G., Impagliazzo, R.: Security-preserving hardness-amplification for any regular one-way function. In: 31st STOC, pp. 169–178 (1999)
Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM 33(2), 792–807 (1986)
Goldreich, O., Impagliazzo, R., Levin, L., Venkatesan, R., Zuckerman, D.: Security preserving amplification of hardness. In: 31st FOCS, pp. 318–326 (1990)
Goldreich, O., Krawczyk, H., Luby, M.: On the existence of pseudorandom generators. SIAM Journal of Computing 22(6), 1163–1175 (1993)
Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: 21st STOC, pp. 25–32 (1989)
Haitner, I., Harnik, D., Reingold, O.: On the power of the randomized iterate. ECCC, TR05-135 (2005)
Haitner, I., Harnik, D., Reingold, O.: Efficient pseudorandom generators from exponentially hard one-way functions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 228–239. Springer, Heidelberg (2006)
Håstad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal of Computing 29(4), 1364–1396 (1999)
Herzberg, A., Luby, M.: Public randomness in cryptography. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 421–432. Springer, Heidelberg (1993)
Holenstein, T.: Pseudorandom generators from one-way functions: A simple construction for any hardness. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 443–461. Springer, Heidelberg (2006)
Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: 30th FOCS, pp. 230–235 (1989)
Impagliazzo, R., Nisan, N., Wigderson, A.: Pseudorandomness for network algorithms. In: 26th STOC, pp. 356–364 (1994)
Impagliazzo, R., Zuckerman, D.: How to recycle random bits. In: 30th FOCS, pp. 248–253 (1989)
Levin, L.A.: One-way functions and pseudorandom generators. Combinatorica 7, 357–363 (1987)
Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal of Computing 17(2), 373–386 (1988)
Naor, M.: Bit commitment using pseudorandomness. Journal of Cryptology 4(2), 151–158 (1991)
Nisan, N.: Pseudorandom generators for space-bounded computation. Combinatorica 12(4), 449–461 (1992)
Nisan, N., Zuckerman, D.: Randomness is linear in space. Journal of Computer and System Sciences (JCSS) 52(1), 43–52 (1996)
Phillips, S.: Security preserving hardness amplification using PRGs for bounded space. Preliminary Report (unpublished 1993)
Yao, A.C.: Theory and application of trapdoor functions. In: 23rd FOCS, pp. 80–91 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haitner, I., Harnik, D., Reingold, O. (2006). On the Power of the Randomized Iterate. In: Dwork, C. (eds) Advances in Cryptology - CRYPTO 2006. CRYPTO 2006. Lecture Notes in Computer Science, vol 4117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11818175_2
Download citation
DOI: https://doi.org/10.1007/11818175_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37432-9
Online ISBN: 978-3-540-37433-6
eBook Packages: Computer ScienceComputer Science (R0)