{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T11:38:11Z","timestamp":1770982691641,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214050","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"805-816","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Pseudorandom generators with long stretch and low locality from random local one-way functions"],"prefix":"10.1145","author":[{"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"243","volume-title":"Handbook of Satisfiability","author":"Achlioptas D.","year":"2009","unstructured":"D. Achlioptas . Handbook of Satisfiability , chapter Random Satisfiability, pages 243 -- 268 . IOS Press , 2009 . D. Achlioptas. Handbook of Satisfiability, chapter Random Satisfiability, pages 243--268. IOS Press, 2009."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946338"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-005-9006-x"},{"key":"e_1_3_2_2_4_1","volume-title":"Pseudorandom generators with long stretch and low locality from random local one-way functions. Electronic Colloquium on Computational Complexity (ECCC), 18:7","author":"Applebaum B.","year":"2011","unstructured":"B. Applebaum . Pseudorandom generators with long stretch and low locality from random local one-way functions. Electronic Colloquium on Computational Complexity (ECCC), 18:7 , 2011 . B. Applebaum. Pseudorandom generators with long stretch and low locality from random local one-way functions. Electronic Colloquium on Computational Complexity (ECCC), 18:7, 2011."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806715"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_34"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446950"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-007-0237-6"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941487.1941511"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806719"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_30"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987260.1987262"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.9.4"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_31"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/645730.668189"},{"key":"e_1_3_2_2_16_1","volume-title":"Proc. 3rd SCN","author":"Dedic N.","year":"2002","unstructured":"N. Dedic , L. Reyzin , and S. P. Vadhan . An improved pseudorandom generator based on hardness of factoring . In Proc. 3rd SCN , 2002 . N. Dedic, L. Reyzin, and S. P. Vadhan. An improved pseudorandom generator based on hardness of factoring. In Proc. 3rd SCN, 2002."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509985"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"e_1_3_2_2_20_1","volume-title":"M.-Y","author":"Flaxman A.","year":"2008","unstructured":"A. Flaxman . Random planted 3-SAT . In M.-Y . Kao, editor, Encyclopedia of Algorithms. Springer , 2008 . A. Flaxman. Random planted 3-SAT. In M.-Y. Kao, editor, Encyclopedia of Algorithms. Springer, 2008."},{"key":"e_1_3_2_2_21_1","volume-title":"Candidate one-way functions based on expander graphs. Electronic Colloquium on Computational Complexity (ECCC), 7(090)","author":"Goldreich O.","year":"2000","unstructured":"O. Goldreich . Candidate one-way functions based on expander graphs. Electronic Colloquium on Computational Complexity (ECCC), 7(090) , 2000 . O. Goldreich. Candidate one-way functions based on expander graphs. Electronic Colloquium on Computational Complexity (ECCC), 7(090), 2000."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/519078"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222069"},{"key":"e_1_3_2_2_24_1","volume-title":"On yao's XOR-lemma. Electronic Colloquium on Computational Complexity (ECCC), 2(50)","author":"Goldreich O.","year":"1995","unstructured":"O. Goldreich , N. Nisan , and A. Wigderson . On yao's XOR-lemma. Electronic Colloquium on Computational Complexity (ECCC), 2(50) , 1995 . O. Goldreich, N. Nisan, and A. Wigderson. On yao's XOR-lemma. Electronic Colloquium on Computational Complexity (ECCC), 2(50), 1995."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-002-0038-7"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806750"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_3_2_2_28_1","volume-title":"Proc. of 12th CRYPTO","author":"Luby Herzberg","year":"1992","unstructured":"Herzberg and Luby . Public randomness in cryptography . In Proc. of 12th CRYPTO , 1992 . Herzberg and Luby. Public randomness in cryptography. In Proc. of 12th CRYPTO, 1992."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374438"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13182-0_19"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21923"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.59"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22185"},{"key":"e_1_3_2_2_34_1","volume-title":"Goldreich's one-way function candidate and drunken backtracking algorithms. Distinguished major thesis","author":"Miller R.","year":"2009","unstructured":"R. Miller . Goldreich's one-way function candidate and drunken backtracking algorithms. Distinguished major thesis , University of Virginia , 2009 . R. Miller. Goldreich's one-way function candidate and drunken backtracking algorithms. Distinguished major thesis, University of Virginia, 2009."},{"key":"e_1_3_2_2_35_1","first-page":"136","volume-title":"Proc. 44th FOCS","author":"Mossel E.","year":"2003","unstructured":"E. Mossel , A. Shpilka , and L. Trevisan . On \u03b5-biased generators in NC0 . In Proc. 44th FOCS , pages 136 -- 145 , 2003 . E. Mossel, A. Shpilka, and L. Trevisan. On \u03b5-biased generators in NC0. In Proc. 44th FOCS, pages 136--145, 2003."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/972639.972643"},{"key":"e_1_3_2_2_37_1","volume-title":"IIT","author":"Panjwani S. K.","year":"2001","unstructured":"S. K. Panjwani . An experimental evaluation of goldreich's one-way function. Technical report , IIT , Bombay , 2001 . S. K. Panjwani. An experimental evaluation of goldreich's one-way function. Technical report, IIT, Bombay, 2001."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1730"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.95"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","location":"New York New York USA","acronym":"STOC'12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214050","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":38,"alternative-id":["10.1145\/2213977.2214050","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214050","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}