{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:29:12Z","timestamp":1725578952058},"publisher-location":"Berlin, Heidelberg","reference-count":13,"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_30","type":"book-chapter","created":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T12:04:42Z","timestamp":1300795482000},"page":"504-521","source":"Crossref","is-referenced-by-count":4,"title":["Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators"],"prefix":"10.1007","author":[{"given":"Josh","family":"Bronson","sequence":"first","affiliation":[]},{"given":"Ali","family":"Juma","sequence":"additional","affiliation":[]},{"given":"Periklis A.","family":"Papakonstantinou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"30_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00037-006-0211-8","volume":"15","author":"B. Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. Computational Complexity\u00a015(2), 115\u2013162 (2006) (also CCC 2005)","journal-title":"Computational Complexity"},{"issue":"4","key":"30_CR2","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 NC0. SIAM J. Comput.\u00a036(4), 845\u2013888 (2006) (also FOCS 2004)","journal-title":"SIAM J. Comput."},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-74143-5_6","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"B. Applebaum","year":"2007","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography with constant input locality. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 92\u2013110. Springer, Heidelberg (2007)"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/11830924_25","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"B. Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: On pseudorandom generators with linear stretch in NC0. Comput. Complexity 17(1), 38{69 (2008); also In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol.\u00a04110, pp. 260\u2013271. Springer, Heidelberg (2006)"},{"issue":"1","key":"30_CR5","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 effciency of generic cryptographic constructions. SIAM J. Comput.\u00a035(1), 217\u2013246 (2005)","journal-title":"SIAM J. Comput."},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/73007.73010","volume-title":"STOC 1989","author":"O. Goldreich","year":"1989","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC 1989, pp. 25\u201332. ACM, Berlin (1989)"},{"key":"30_CR7","first-page":"437","volume-title":"STOC 2010","author":"I. Haitner","year":"2010","unstructured":"Haitner, I., Reingold, O., Vadhan, S.: Efficiency improvements in constructing pseu-dorandom generators from one-way functions. In: STOC 2010, pp. 437\u2013446. ACM, New York (2010)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: STOC 1989 (1989)","DOI":"10.1145\/73007.73012"},{"key":"30_CR9","first-page":"294","volume-title":"FOCS 2000","author":"Y. Ishai","year":"2000","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: a new representation with applications to round-efficient secure computation. In: Young, D.C. (ed.) FOCS 2000, pp. 294\u2013304. IEEE Computer Society, Los Alamitos (2000)"},{"key":"30_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)"},{"key":"30_CR11","series-title":"LNCS","first-page":"504","volume-title":"TCC 2011","author":"E. Miles","year":"2011","unstructured":"Miles, E., Viola, E.: On the complexity of increasing the stretch of pseudorandom generators. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 504\u2013521. Springer, Heidelberg (2011)"},{"key":"30_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":"30_CR13","first-page":"183","volume-title":"CCC 2005","author":"E. Viola","year":"2005","unstructured":"Viola, E.: On constructing parallel pseudorandom generators from one-way functions. In: CCC 2005, pp. 183\u2013197. IEEE Computer Society, Los Alamitos (2005)"}],"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_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:48:26Z","timestamp":1606186106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19571-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642195709","9783642195716"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19571-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}