{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T11:01:59Z","timestamp":1777287719961,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540374329","type":"print"},{"value":"9783540374336","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11818175_2","type":"book-chapter","created":{"date-parts":[[2006,9,23]],"date-time":"2006-09-23T06:21:52Z","timestamp":1158992512000},"page":"22-40","source":"Crossref","is-referenced-by-count":34,"title":["On the Power of the Randomized Iterate"],"prefix":"10.1007","author":[{"given":"Iftach","family":"Haitner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Harnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Reingold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC $^{\\mbox{0}}$ . In: 45th FOCS, pp. 166\u2013175 (2004)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo random bits. In: 23th FOCS, pp. 112\u2013117 (1982)","DOI":"10.1109\/SFCS.1982.72"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Impagliazzo, R.: Security-preserving hardness-amplification for any regular one-way function. In: 31st STOC, pp. 169\u2013178 (1999)","DOI":"10.1145\/301250.301296"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM\u00a033(2), 792\u2013807 (1986)","journal-title":"Journal of the ACM"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Impagliazzo, R., Levin, L., Venkatesan, R., Zuckerman, D.: Security preserving amplification of hardness. In: 31st FOCS, pp. 318\u2013326 (1990)","DOI":"10.1109\/FSCS.1990.89550"},{"issue":"6","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/0222069","volume":"22","author":"O. Goldreich","year":"1993","unstructured":"Goldreich, O., Krawczyk, H., Luby, M.: On the existence of pseudorandom generators. SIAM Journal of Computing\u00a022(6), 1163\u20131175 (1993)","journal-title":"SIAM Journal of Computing"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: 21st STOC, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Haitner, I., Harnik, D., Reingold, O.: On the power of the randomized iterate. ECCC, TR05-135 (2005)","DOI":"10.1007\/11818175_2"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/11787006_20","volume-title":"Automata, Languages and Programming","author":"I. Haitner","year":"2006","unstructured":"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.\u00a04052, pp. 228\u2013239. Springer, Heidelberg (2006)"},{"issue":"4","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"29","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal of Computing\u00a029(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal of Computing"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/3-540-48071-4_29","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"A. Herzberg","year":"1993","unstructured":"Herzberg, A., Luby, M.: Public randomness in cryptography. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 421\u2013432. Springer, Heidelberg (1993)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/11681878_23","volume-title":"Theory of Cryptography","author":"T. Holenstein","year":"2006","unstructured":"Holenstein, T.: Pseudorandom generators from one-way functions: A simple construction for any hardness. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 443\u2013461. Springer, Heidelberg (2006)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: 30th FOCS, pp. 230\u2013235 (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Nisan, N., Wigderson, A.: Pseudorandomness for network algorithms. In: 26th STOC, pp. 356\u2013364 (1994)","DOI":"10.1145\/195058.195190"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Zuckerman, D.: How to recycle random bits. In: 30th FOCS, pp. 248\u2013253 (1989)","DOI":"10.1109\/SFCS.1989.63486"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579323","volume":"7","author":"L.A. Levin","year":"1987","unstructured":"Levin, L.A.: One-way functions and pseudorandom generators. Combinatorica\u00a07, 357\u2013363 (1987)","journal-title":"Combinatorica"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal of Computing\u00a017(2), 373\u2013386 (1988)","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. Journal of Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"Journal of Cryptology"},{"issue":"4","key":"2_CR19","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/BF01305237","volume":"12","author":"N. Nisan","year":"1992","unstructured":"Nisan, N.: Pseudorandom generators for space-bounded computation. Combinatorica\u00a012(4), 449\u2013461 (1992)","journal-title":"Combinatorica"},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N. Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. Journal of Computer and System Sciences (JCSS)\u00a052(1), 43\u201352 (1996)","journal-title":"Journal of Computer and System Sciences (JCSS)"},{"key":"2_CR21","unstructured":"Phillips, S.: Security preserving hardness amplification using PRGs for bounded space. Preliminary Report (unpublished 1993)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and application of trapdoor functions. In: 23rd FOCS, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11818175_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T23:18:42Z","timestamp":1683587922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11818175_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540374329","9783540374336"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11818175_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}