{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:59:25Z","timestamp":1775282365600,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"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.2214051","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"817-836","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Characterizing pseudoentropy and simplifying pseudorandom generator constructions"],"prefix":"10.1145","author":[{"given":"Salil","family":"Vadhan","sequence":"first","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}]},{"given":"Colin Jia","family":"Zheng","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496899"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Manuel Blum and Silvio Micali. How to generate cryptographically strong sequences of pseudo random bits. pages 112--117 1982. Manuel Blum and Silvio Micali. How to generate cryptographically strong sequences of pseudo random bits. pages 112--117 1982.","DOI":"10.1109\/SFCS.1982.72"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45198-3_18"},{"key":"e_1_3_2_2_4_1","volume-title":"Wiley","author":"Thomas","year":"2006"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"},{"key":"e_1_3_2_2_6_1","unstructured":"Benjamin Fuller and Leonid Reyzin. Computational entropy and information leakage. 2011. (available at http:\/\/www.cs.bu.edu\/fac\/reyzin). Benjamin Fuller and Leonid Reyzin. Computational entropy and information leakage. 2011. (available at http:\/\/www.cs.bu.edu\/fac\/reyzin)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704443276"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73010"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00162-X"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"e_1_3_2_2_11_1","unstructured":"Oded Goldreich. Computational Complexity: A Conceptual Perspective. 2006. Oded Goldreich. Computational Complexity: A Conceptual Perspective. 2006."},{"key":"e_1_3_2_2_12_1","first-page":"54","volume-title":"In Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity","author":"Goldreich Oded","year":"1998"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_31"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_10"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060689"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_23"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806750"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536497"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374438"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63483"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796290"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195155"},{"key":"e_1_3_2_2_24_1","first-page":"624","volume-title":"In Proceedings of the Fortieth Annual Symposium on Foundations of Computer Science","author":"Adam","year":"1999"},{"key":"e_1_3_2_2_25_1","unstructured":"L.D. Landau and E.M. Lifshitz . Statistical physics volume 5 of Statistical Physics . Oxford : Pergamon Press 1980 . L.D. Landau and E.M. Lifshitz. Statistical physics volume 5 of Statistical Physics. Oxford: Pergamon Press 1980."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237833"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2009144.2009157"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1730"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Salil Vadhan and Colin Jia Zheng. A uniform minmax theorem and its applications. In preparation 2012. Salil Vadhan and Colin Jia Zheng. A uniform minmax theorem and its applications. In preparation 2012.","DOI":"10.1007\/978-3-642-40041-4_6"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Salil P. Vadhan and Colin Jia Zheng. Characterizing pseudoentropy and simplifying pseudorandom generator constructions. Electronic Colloquium on Computational Complexity (ECCC) 18:141 2011. Salil P. Vadhan and Colin Jia Zheng. Characterizing pseudoentropy and simplifying pseudorandom generator constructions. Electronic Colloquium on Computational Complexity (ECCC) 18:141 2011.","DOI":"10.1145\/2213977.2214051"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Andrew C. Yao. Theory and applications of trapdoor functions. pages 80--91 1982. Andrew C. Yao. Theory and applications of trapdoor functions. pages 80--91 1982.","DOI":"10.1109\/SFCS.1982.45"},{"key":"e_1_3_2_2_33_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.2214051","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214051","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.2214051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":33,"alternative-id":["10.1145\/2213977.2214051","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214051","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"}}]}}