{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:10:04Z","timestamp":1750695004746,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","funder":[{"name":"NSF (National Science Foundation)","award":["2045576"],"award-info":[{"award-number":["2045576"]}]},{"name":"Simons Investigator Award","award":["409864"],"award-info":[{"award-number":["409864"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718272","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:21:27Z","timestamp":1750026087000},"page":"604-614","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Leakage-Resilient Extractors against Number-on-Forehead Protocols"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9140-3160","authenticated-orcid":false,"given":"Eshan","family":"Chattopadhyay","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2552-1921","authenticated-orcid":false,"given":"Jesse","family":"Goodman","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1016\/0022-0000(92)90047-M"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1137\/S0097539705447141"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1007\/BF01263423"},{"key":"e_1_3_2_1_4_1","volume-title":"23rd International Conference on Randomization and Computation (RANDOM","author":"Ben-Aroya Avraham","year":"2019","unstructured":"Avraham Ben-Aroya, Gil Cohen, Dean Doron, and Amnon Ta-Shma. 2019. Two-source condensers with low error and small entropy gap via entropy-resilient functions. In 23rd International Conference on Randomization and Computation (RANDOM 2019)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1109\/SFCS.1985.15"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1137\/0217014"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/62212.62222"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1142\/S1793042105000108"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1112\/S0024610706022721"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.5555\/646766.704151"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/800061.808737"},{"key":"e_1_3_2_1_12_1","volume-title":"62nd Annual Symposium on Foundations of Computer Science (FOCS","author":"Chattopadhyay Eshan","year":"2021","unstructured":"Eshan Chattopadhyay and Jesse Goodman. 2021. Improved extractors for small-space sources. In 62nd Annual Symposium on Foundations of Computer Science (FOCS 2021). IEEE, 610\u2013621."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1109\/FOCS46700.2020.00117"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/3357713.3384339"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/2897518.2897643"},{"key":"e_1_3_2_1_16_1","volume-title":"Leibniz International Proceedings in Informatics (LIPIcs): 38th Computational Complexity Conference (CCC","author":"Chattopadhyay Eshan","year":"2023","unstructured":"Eshan Chattopadhyay and Jyun-Jie Liao. 2023. Hardness against linear branching programs and more. In Leibniz International Proceedings in Informatics (LIPIcs): 38th Computational Complexity Conference (CCC 2023)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.4007\/annals.2019.189.3.1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1007\/s00145-015-9219-z"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1109\/SFCS.1985.55"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1137\/0217015"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/2840728.2840734"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1137\/120868414"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1109\/FOCS.2004.44"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/1536414.1536496"},{"key":"e_1_3_2_1_25_1","volume-title":"Hadamard tensors and lower bounds on multiparty communication complexity. computational complexity, 22","author":"Ford Jeff","year":"2013","unstructured":"Jeff Ford and Anna G\u00e1l. 2013. Hadamard tensors and lower bounds on multiparty communication complexity. computational complexity, 22 (2013), 595\u2013622."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1007\/978-3-642-19571-6_19"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1007\/11561927_22"},{"unstructured":"Jesse Goodman and Vipul Goyal. 2025. Two-source extractors don\u2019t shrink. Unpublished manuscript","key":"e_1_3_2_1_28_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1109\/FOCS61266.2024.00096"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1007\/978-3-540-78524-8_9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1007\/s00145-013-9152-y"},{"key":"e_1_3_2_1_32_1","volume-title":"Linear Branching Programs and Directional Affine Extractors. In 37th Computational Complexity Conference (CCC","author":"Gryaznov Svyatoslav","year":"2022","unstructured":"Svyatoslav Gryaznov, Pavel Pudl\u00e1k, and Navid Talebanfard. 2022. Linear Branching Programs and Directional Affine Extractors. In 37th Computational Complexity Conference (CCC 2022)."},{"key":"e_1_3_2_1_33_1","volume-title":"Better extractors for better codes? In 36th annual ACM Symposium on Theory of Computing (STOC","author":"Guruswami Venkatesan","year":"2004","unstructured":"Venkatesan Guruswami. 2004. Better extractors for better codes? In 36th annual ACM Symposium on Theory of Computing (STOC 2004). 436\u2013444."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1103\/RevModPhys.89.015004"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1016\/j.jcss.2010.06.014"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1109\/ISIT.2004.1365267"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1007\/11586821_22"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1109\/FOCS.2019.00045"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.1109\/TIT.2005.847746"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1112\/S0025579319000238"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1145\/3519935.3519976"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.1109\/FOCS.2015.58"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.1109\/FOCS57990.2023.00075"},{"key":"e_1_3_2_1_44_1","volume-title":"Winter 2019: Multi-party protocols. https:\/\/cseweb.ucsd.edu\/classes\/wi19\/cse291-b\/5-multiparty.pdf Lecture notes","author":"Lovett Shachar","year":"2019","unstructured":"Shachar Lovett. 2019. CSE 291: Communication Complexity, Winter 2019: Multi-party protocols. https:\/\/cseweb.ucsd.edu\/classes\/wi19\/cse291-b\/5-multiparty.pdf Lecture notes, University of California, San Diego. Version dated March 22, 2019"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_45_1","DOI":"10.5555\/646762.706169"},{"unstructured":"Anup Rao. 2007. An exposition of Bourgain\u2019s 2-source extractor. In Electronic Colloquium on Computational Complexity (ECCC). 14.","key":"e_1_3_2_1_46_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_47_1","DOI":"10.1137\/060671218"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_48_1","DOI":"10.1016\/0020-0190(93)90041-7"},{"key":"e_1_3_2_1_49_1","volume-title":"Foundations and Trends\u00ae in Theoretical Computer Science, 7, 1\u20133","author":"Vadhan Salil","year":"2012","unstructured":"Salil Vadhan. 2012. Pseudorandomness. Foundations and Trends\u00ae in Theoretical Computer Science, 7, 1\u20133 (2012), 1\u2013336."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_50_1","DOI":"10.1007\/BF02579325"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_51_1","DOI":"10.1145\/1515698.1515709"},{"key":"e_1_3_2_1_52_1","first-page":"36","article-title":"Various techniques used in connection with random digits","volume":"12","author":"von Neumann John","year":"1951","unstructured":"John von Neumann. 1951. Various techniques used in connection with random digits. Applied Math Series, 12, 36-38 (1951), 1.","journal-title":"Applied Math Series"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_53_1","DOI":"10.1109\/FSCS.1990.89583"},{"key":"e_1_3_2_1_54_1","volume-title":"11th Annual ACM Symposium on Theory of Computing (STOC","author":"Chi-Chih Yao Andrew","year":"1979","unstructured":"Andrew Chi-Chih Yao. 1979. Some complexity questions related to distributive computing. In 11th Annual ACM Symposium on Theory of Computing (STOC 1979). 209\u2013213."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_55_1","DOI":"10.4086\/toc.2007.v003a006"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC '25","name":"STOC '25: 57th Annual ACM Symposium on Theory of Computing","location":"Prague Czechia"},"container-title":["Proceedings of the 57th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717823.3718272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:47:36Z","timestamp":1750693656000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":55,"alternative-id":["10.1145\/3717823.3718272","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718272","relation":{},"subject":[],"published":{"date-parts":[[2025,6,15]]},"assertion":[{"value":"2025-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}