{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:59:24Z","timestamp":1775282364680,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662464939","type":"print"},{"value":"9783662464946","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46494-6_2","type":"book-chapter","created":{"date-parts":[[2015,3,9]],"date-time":"2015-03-09T21:17:58Z","timestamp":1425935878000},"page":"7-35","source":"Crossref","is-referenced-by-count":6,"title":["The Randomized Iterate, Revisited - Almost Linear Seed Length PRGs from a Broader Class of One-Way Functions"],"prefix":"10.1007","author":[{"given":"Yu","family":"Yu","sequence":"first","affiliation":[]},{"given":"Dawu","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Xiangxue","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Weng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22792-9_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"B. Barak","year":"2011","unstructured":"Barak, B., Dodis, Y., Krawczyk, H., Pereira, O., Pietrzak, K., Standaert, F.-X., Yu, Y.: Leftover hash lemma, revisited. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 1\u201320. Springer, Heidelberg (2011)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudorandom bits. In: Proceedings of the 23rd IEEE Symposium on Foundation of Computer Science (FOCS 1982), pp. 112\u2013117 (1982)","DOI":"10.1109\/SFCS.1982.72"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/978-3-540-78524-8_33","volume-title":"Theory of Cryptography","author":"N. Dedi\u0107","year":"2008","unstructured":"Dedi\u0107, N., Harnik, D., Reyzin, L.: Saving private randomness in one-way functions and pseudorandom generators. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 607\u2013625. Springer, Heidelberg (2008)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-55220-5_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"Y. Dodis","year":"2014","unstructured":"Dodis, Y., Pietrzak, K., Wichs, D.: Key derivation without entropy waste. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol.\u00a08441, pp. 93\u2013110. Springer, Heidelberg (2014)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-36594-2_1","volume-title":"Theory of Cryptography","author":"Y. Dodis","year":"2013","unstructured":"Dodis, Y., Yu, Y.: Overcoming weak expectations. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 1\u201322. Springer, Heidelberg (2013)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511546891"},{"issue":"6","key":"2_CR7","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 on Computing\u00a022(6), 1163\u20131175 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC 1989), pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-22670-0_3","volume-title":"Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation","author":"O. Goldreich","year":"2011","unstructured":"Goldreich, O., Levin, L.A., Nisan, N.: On constructing 1-1 one-way functions. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. LNCS, vol.\u00a06650, pp. 13\u201325. Springer, Heidelberg (2011), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-22670-0_3"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11818175_2","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I. Haitner","year":"2006","unstructured":"Haitner, I., Harnik, D., Reingold, O.: On the power of the randomized iterate. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a0CRYPTO 2006, pp. 22\u201340. Springer, Heidelberg (2006)"},{"issue":"6","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1486","DOI":"10.1137\/080721820","volume":"40","author":"I. Haitner","year":"2011","unstructured":"Haitner, I., Harnik, D., Reingold, O.: On the power of the randomized iterate. SIAM Journal on Computing\u00a040(6), 1486\u20131528 (2011), \n                    \n                      http:\/\/www.cs.tau.ac.il\/~iftachh\/papers\/RandomizedIteate\/RandomIterate.pdf","journal-title":"SIAM Journal on Computing"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O., Vadhan, S.P.: Efficiency improvements in constructing pseudorandom generators from one-way functions. In: Proceedings of the 42nd ACM Symposium on the Theory of Computing (STOC 2010), pp. 437\u2013446 (2010)","DOI":"10.1145\/1806689.1806750"},{"issue":"4","key":"2_CR13","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: Construction of pseudorandom generator from any one-way function. SIAM Journal on Computing\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR14","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_CR15","doi-asserted-by":"crossref","unstructured":"Holenstein, T., Sinha, M.: Constructing a pseudorandom generator requires an almost linear Number of calls. In: Proceedings of the 53rd IEEE Symposium on Foundation of Computer Science (FOCS 2012), pp. 698\u2013707 (2012)","DOI":"10.1109\/FOCS.2012.51"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Nisan, N., Wigderson, A.: Pseudorandomness for network algorithms. In: Proceedings of the 26th ACM Symposium on the Theory of Computing (STOC 1994), pp. 356\u2013364 (1994)","DOI":"10.1145\/195058.195190"},{"issue":"4","key":"2_CR17","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"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Vadhan, S.P., Zheng, C.J.: Characterizing pseudoentropy and simplifying pseudorandom generator constructions. In: Proceedings of the 44th ACM Symposium on the Theory of Computing (STOC 2012), pp. 817\u2013836 (2012)","DOI":"10.1145\/2213977.2214051"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Theory and applications of trapdoor functions (extended abstract). In: Proceedings of the 23rd IEEE Symposium on Foundation of Computer Science (FOCS 1982), pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"},{"key":"2_CR20","unstructured":"Yu, Y., Gu, D., Li, X., Weng, J.: The randomized iterate revisited - almost linear seed length PRGs from a broader class of one-way functions. Tech. Rep. 2014\/392, Cryptology e-print archive, full version of this work, \n                    \n                      http:\/\/eprint.iacr.org\/2014\/392"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-42045-0_14","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"Y. Yu","year":"2013","unstructured":"Yu, Y., Li, X., Weng, J.: Pseudorandom generators from regular one-way functions: New constructions with improved parameters. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol.\u00a08270, pp. 261\u2013279. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46494-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T11:12:59Z","timestamp":1559128379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46494-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662464939","9783662464946"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46494-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}