{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:28:59Z","timestamp":1725578939376},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642195709"},{"type":"electronic","value":"9783642195716"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19571-6_31","type":"book-chapter","created":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T12:04:42Z","timestamp":1300795482000},"page":"522-539","source":"Crossref","is-referenced-by-count":5,"title":["On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators"],"prefix":"10.1007","author":[{"given":"Eric","family":"Miles","sequence":"first","affiliation":[]},{"given":"Emanuele","family":"Viola","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"31_CR1","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1137\/S0097539705446950","volume":"36","author":"B. Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC\n                  0. SIAM J. Comput.\u00a036(4), 845\u2013888 (2006)","journal-title":"SIAM J. Comput."},{"key":"31_CR2","series-title":"LNCS","first-page":"522","volume-title":"TCC 2011","author":"J. Bronson","year":"2011","unstructured":"Bronson, J., Juma, A., Papakonstantinou, P.A.: Limits on the stretch of non-adaptive constructions of pseudo-random generators. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 522\u2013539. Springer, Heidelberg (2011)"},{"issue":"1","key":"31_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/S0097539704443276","volume":"35","author":"R. Gennaro","year":"2005","unstructured":"Gennaro, R., Gertner, Y., Katz, J., Trevisan, L.: Bounds on the efficiency of generic cryptographic constructions. SIAM J. Comput.\u00a035(1), 217\u2013246 (2005)","journal-title":"SIAM J. Comput."},{"key":"31_CR4","series-title":"Basic Tools","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Tools, vol.\u00a01. Cambridge University Press, Cambridge (2001)"},{"issue":"6","key":"31_CR5","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 J. Comput.\u00a022(6), 1163\u20131175 (1993)","journal-title":"SIAM J. Comput."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.: A hard-core predicate for all one-way functions. In: 21st Annual ACM Symposium on Theory of Computing (STOC), pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O., Vadhan, S.P.: Efficiency improvements in constructing pseudorandom generators from one-way functions. In: 42nd ACM Symposium on Theory of Computing (STOC), pp. 437\u2013446 (2010)","DOI":"10.1145\/1806689.1806750"},{"issue":"4","key":"31_CR8","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.: A pseudorandom generator from any one-way function. SIAM J. Comput.\u00a028(4), 1364\u20131396 (1999) (electronic)","journal-title":"SIAM J. Comput."},{"key":"31_CR9","unstructured":"Impagliazzo, R.: Very strong one-way functions and pseudo-random generators exist relative to a random oracle (1996) (manuscript)"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/11681878_24","volume-title":"Theory of Cryptography","author":"C.-J. Lu","year":"2006","unstructured":"Lu, C.-J.: On the complexity of parallel hardness amplification for one-way functions. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 462\u2013481. Springer, Heidelberg (2006)"},{"issue":"2","key":"31_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N. Nisan","year":"1994","unstructured":"Nisan, N., Wigderson, A.: Hardness vs randomness. J. Computer & Systems Sciences\u00a049(2), 149\u2013167 (1994)","journal-title":"J. Computer & Systems Sciences"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","volume-title":"Theory of Cryptography","author":"O. Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.: Notions of Reducibility between Cryptographic Primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 1\u201320. Springer, Heidelberg (2004)"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/CCC.2005.16","volume-title":"20th Annual Conference on Computational Complexity (CCC)","author":"E. Viola","year":"2005","unstructured":"Viola, E.: On constructing parallel pseudorandom generators from one-way functions. In: 20th Annual Conference on Computational Complexity (CCC), pp. 183\u2013197. IEEE, Los Alamitos (2005)"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1109\/SFCS.1982.45","volume-title":"23rd Annual Symposium on Foundations of Computer Science (FOCS)","author":"A. Yao","year":"1982","unstructured":"Yao, A.: Theory and applications of trapdoor functions. In: 23rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 80\u201391. IEEE, Los Alamitos (1982)"},{"key":"31_CR15","unstructured":"Zimand, M.: Efficient privatization of random bits. In: Randomized Algorithms Satellite Workshop of the 23rd International Symposium on Mathematical Foundations of Computer Science (1998), \n                    \n                      http:\/\/triton.towson.edu\/~mzimand\/pub\/rand-privat.ps"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19571-6_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:48:27Z","timestamp":1606186107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19571-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642195709","9783642195716"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19571-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}