{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:04:17Z","timestamp":1765112657166,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540380443"},{"type":"electronic","value":"9783540380450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11830924_25","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T12:33:54Z","timestamp":1156509234000},"page":"260-271","source":"Crossref","is-referenced-by-count":18,"title":["On Pseudorandom Generators with Linear Stretch in NC0\u00a0"],"prefix":"10.1007","author":[{"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. In: Proc. 44th FOCS, pp. 298\u2013307 (2003)","DOI":"10.1109\/SFCS.2003.1238204"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1002\/rsa.3240050203","volume":"5","author":"N. Alon","year":"1994","unstructured":"Alon, N., Roichman, Y.: Random cayley graphs and expanders. Random Struct. Algorithms\u00a05(2), 271\u2013285 (1994)","journal-title":"Random Struct. Algorithms"},{"key":"#cr-split#-25_CR3.1","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC0. SIAM J. Comput. (to appear);"},{"key":"#cr-split#-25_CR3.2","unstructured":"Preliminary version in FOCS??2004"},{"issue":"3","key":"25_CR4","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. J. of the ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"J. of the ACM"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of np. J. of the ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"J. of the ACM"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Sudan, M., Vadhan, S., Wigderson, A.: Randomness-efficient low-degree tests and short pcps via epsilon-biased sets. In: Proc. 35th STOC, pp. 612\u2013621 (2003)","DOI":"10.1145\/780542.780631"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-48329-2_24","volume-title":"Advances in Cryptology - CRYPTO 1993","author":"A. Blum","year":"1994","unstructured":"Blum, A., Furst, M., Kearns, M., Lipton, R.J.: Cryptographic primitives based on hard learning problems. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 278\u2013291. Springer, Heidelberg (1994)"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput.\u00a013, 850\u2013864 (1984)","journal-title":"SIAM J. Comput."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Capalbo, M., Reingold, O., Vadhan, S., Wigderson, A.: Randomness conductors and constant-degree lossless expanders. In: Proc. 34th STOC, pp. 659\u2013668 (2002)","DOI":"10.1145\/510002.510003"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44683-4_24","volume-title":"Mathematical Foundations of Computer Science 2001","author":"M. Cryan","year":"2001","unstructured":"Cryan, M., Miltersen, P.B.: On pseudorandom generators in NC0. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136. Springer, Heidelberg (2001)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Smith, A.: Correcting errors without leaking partial information. In: Proc. 37th STOC, pp. 654\u2013663 (2005)","DOI":"10.1145\/1060590.1060688"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Feige, U.: Relations between average case complexity and approximation complexity. In: Proc. of 34th STOC, pp. 534\u2013543 (2002)","DOI":"10.1145\/509907.509985"},{"key":"25_CR13","unstructured":"Goldreich, O.: Candidate one-way functions based on expander graphs. ECCC\u00a07(090) (2000)"},{"key":"25_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)"},{"issue":"6","key":"25_CR15","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."},{"issue":"4","key":"25_CR16","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1002\/(SICI)1098-2418(199712)11:4<315::AID-RSA3>3.0.CO;2-1","volume":"11","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Wigderson, A.: Tiny families of functions with random properties: A quality-size trade-off for hashing. Random Struct. Random Struct. Algorithms\u00a011(4), 315\u2013343 (1997)","journal-title":"Random Struct. Algorithms"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Mossel, E., Shpilka, A., Trevisan, L.: On \u03b5-biased generators in NC0. In: Proc. 44th FOCS, pp. 136\u2013145 (2003)","DOI":"10.1109\/SFCS.2003.1238188"},{"issue":"4","key":"25_CR18","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J. Naor","year":"1993","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput.\u00a022(4), 838\u2013856 (1993)","journal-title":"SIAM J. Comput."},{"key":"25_CR19","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. J. of Cryptology\u00a04, 151\u2013158 (1991)","journal-title":"J. of Cryptology"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. J. of Computer and Systems Sciences\u00a043, 425\u2013440 (1991)","journal-title":"J. of Computer and Systems Sciences"},{"issue":"1","key":"25_CR21","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/S0895480197329508","volume":"13","author":"J. Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Tight bounds for depth-two superconcentrators. SIAM J. Discrete Math.\u00a013(1), 2\u201324 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"25_CR22","unstructured":"Vazirani, U.: Randomness, Adversaries and Computation. Ph.d. thesis, UC Berkeley (1986)"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Viola, E.: On constructing parallel pseudorandom generators from one-way functions. In: Proc. 20th CCC, pp. 183\u2013197 (2005)","DOI":"10.1109\/CCC.2005.16"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and application of trapdoor functions. In: Proc. 23rd FOCS, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11830924_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T15:29:12Z","timestamp":1736522952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11830924_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540380443","9783540380450"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11830924_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}