default search action
Eshan Chattopadhyay
Person information
- affiliation: Cornell University, Ithaca, NY, USA
- affiliation (former): Institute for Advanced Study, Princeton, School of Mathematics
- affiliation (former): University of California, Berkeley, Simons Institute
- affiliation (former): University of Texas at Austin, Department of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c29]Eshan Chattopadhyay, Jesse Goodman, Mohit Gurumukhani:
Extractors for Polynomial Sources over 𝔽2. ITCS 2024: 28:1-28:24 - [c28]Eshan Chattopadhyay, Jyun-Jie Liao:
Recursive Error Reduction for Regular Branching Programs. ITCS 2024: 29:1-29:20 - [i50]Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach, Yunya Zhao:
Two-Sided Lossless Expanders in the Unbalanced Setting. CoRR abs/2409.04549 (2024) - [i49]Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach, Yunya Zhao:
Two-Sided Lossless Expanders in the Unbalanced Setting. Electron. Colloquium Comput. Complex. TR24 (2024) - [i48]Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach:
Condensing against Online Adversaries. Electron. Colloquium Comput. Complex. TR24: TR24-171 (2024) - 2023
- [c27]Eshan Chattopadhyay, Jyun-Jie Liao:
Hardness Against Linear Branching Programs and More. CCC 2023: 9:1-9:27 - [i47]Eshan Chattopadhyay, Jyun-Jie Liao:
Recursive Error Reduction for Regular Branching Programs. CoRR abs/2309.04551 (2023) - [i46]Eshan Chattopadhyay, Jesse Goodman, Mohit Gurumukhani:
Extractors for Polynomial Sources over F2. CoRR abs/2309.11019 (2023) - [i45]Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach
:
On the Existence of Seedless Condensers: Exploring the Terrain. CoRR abs/2312.15087 (2023) - [i44]Eshan Chattopadhyay, Jesse Goodman, Mohit Gurumukhani:
Extractors for Polynomial Sources over $\mathbb{F}_2$. Electron. Colloquium Comput. Complex. TR23 (2023) - [i43]Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach:
On the Existence of Seedless Condensers: Exploring the Terrain. Electron. Colloquium Comput. Complex. TR23 (2023) - [i42]Eshan Chattopadhyay, Jyun-Jie Liao:
Recursive Error Reduction for Regular Branching Programs. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j4]Eshan Chattopadhyay:
Recent Advances in Randomness Extraction. Entropy 24(7): 880 (2022) - [c26]Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro
Low-Degree Polynomials Extract From Local Sources. ICALP 2022: 10:1-10:20 - [c25]Eshan Chattopadhyay, Jesse Goodman, David Zuckerman:
The Space Complexity of Sampling. ITCS 2022: 40:1-40:23 - [c24]Eshan Chattopadhyay, Jyun-Jie Liao:
Extractors for sum of two sources. STOC 2022: 1584-1597 - [i41]Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro:
Low-Degree Polynomials Extract from Local Sources. CoRR abs/2205.13725 (2022) - [i40]Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro:
Low-Degree Polynomials Extract from Local Sources. Electron. Colloquium Comput. Complex. TR22 (2022) - [i39]Eshan Chattopadhyay, Jyun-Jie Liao:
Hardness against Linear Branching Programs and More. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c23]Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, Abhishek Shetty:
Fractional Pseudorandom Generators from Any Fourier Level. CCC 2021: 10:1-10:24 - [c22]Eshan Chattopadhyay, Jesse Goodman:
Improved Extractors for Small-Space Sources. FOCS 2021: 610-621 - [c21]Eshan Chattopadhyay, Jesse Goodman, Jyun-Jie Liao:
Affine Extractors for Almost Logarithmic Entropy. FOCS 2021: 622-633 - [i38]Eshan Chattopadhyay, Jyun-Jie Liao:
Extractors for Sum of Two Sources. CoRR abs/2110.12652 (2021) - [i37]Eshan Chattopadhyay, Jesse Goodman, Jyun-Jie Liao:
Affine Extractors for Almost Logarithmic Entropy. Electron. Colloquium Comput. Complex. TR21 (2021) - [i36]Eshan Chattopadhyay, Jesse Goodman, David Zuckerman:
The Space Complexity of Sampling. Electron. Colloquium Comput. Complex. TR21 (2021) - [i35]Eshan Chattopadhyay, Jyun-Jie Liao:
Extractors for Sum of Two Sources. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j3]Eshan Chattopadhyay, Vipul Goyal, Xin Li:
Nonmalleable Extractors and Codes, with Their Many Tampered Extensions. SIAM J. Comput. 49(5): 999-1040 (2020) - [j2]Eshan Chattopadhyay:
Guest Column: A Recipe for Constructing Two-Source Extractors. SIGACT News 51(2): 38-57 (2020) - [c20]Eshan Chattopadhyay, Jyun-Jie Liao:
Optimal Error Pseudodistributions for Read-Once Branching Programs. CCC 2020: 25:1-25:27 - [c19]Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan:
Non-malleability Against Polynomial Tampering. CRYPTO (3) 2020: 97-126 - [c18]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar, Xin Li, Raghu Meka, David Zuckerman:
Extractors and Secret Sharing Against Bounded Collusion Protocols. FOCS 2020: 1226-1242 - [c17]Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini
XOR lemmas for resilient functions against polynomials. STOC 2020: 234-246 - [c16]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li:
Extractors for adversarial sources via extremal hypergraphs. STOC 2020: 1184-1197 - [c15]Eshan Chattopadhyay, Xin Li:
Non-malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering. TCC (3) 2020: 584-613 - [i34]Eshan Chattopadhyay, Jyun-Jie Liao:
Optimal Error Pseudodistributions for Read-Once Branching Programs. CoRR abs/2002.07208 (2020) - [i33]Eshan Chattopadhyay, Jesse Goodman:
Explicit Extremal Designs and Applications to Extractors. CoRR abs/2007.07772 (2020) - [i32]Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, Abhishek Shetty:
Fractional Pseudorandom Generators from Any Fourier Level. CoRR abs/2008.01316 (2020) - [i31]Marshall Ball
Non-Malleability against Polynomial Tampering. Electron. Colloquium Comput. Complex. TR20 (2020) - [i30]Eshan Chattopadhyay, Jesse Goodman:
Explicit Extremal Designs and Applications to Extractors. Electron. Colloquium Comput. Complex. TR20 (2020) - [i29]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li:
Leakage-Resilient Extractors and Secret-Sharing against Bounded Collusion Protocols. Electron. Colloquium Comput. Complex. TR20 (2020) - [i28]Eshan Chattopadhyay, Jason Gaitonde, Abhishek Shetty:
Fractional Pseudorandom Generators from the $k$th Fourier Level. Electron. Colloquium Comput. Complex. TR20 (2020) - [i27]Eshan Chattopadhyay, Jyun-Jie Liao:
Optimal Error Pseudodistributions for Read-Once Branching Programs. Electron. Colloquium Comput. Complex. TR20 (2020) - [i26]Marshall Ball
Non-Malleability against Polynomial Tampering. IACR Cryptol. ePrint Arch. 2020: 147 (2020) - [i25]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li:
Leakage-Resilient Extractors and Secret-Sharing against Bounded Collusion Protocols. IACR Cryptol. ePrint Arch. 2020: 478 (2020)
2010 – 2019
- 2019
- [j1]Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini
Pseudorandom Generators from Polarizing Random Walks. Theory Comput. 15: 1-26 (2019) - [c14]Eshan Chattopadhyay, Anindya De, Rocco A. Servedio
Simple and Efficient Pseudorandom Generators from Gaussian Processes. CCC 2019: 4:1-4:33 - [c13]Eshan Chattopadhyay, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu
Privacy Amplification from Non-malleable Codes. INDOCRYPT 2019: 318-337 - [c12]Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal:
Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates. ITCS 2019: 22:1-22:15 - [i24]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li:
Extractors for Adversarial Sources via Extremal Hypergraphs. Electron. Colloquium Comput. Complex. TR19 (2019) - [i23]Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman:
XOR Lemmas for Resilient Functions Against Polynomials. Electron. Colloquium Comput. Complex. TR19 (2019) - [i22]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li:
Extractors for Adversarial Sources via Extremal Hypergraphs. IACR Cryptol. ePrint Arch. 2019: 1450 (2019) - 2018
- [c11]Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini
Pseudorandom Generators from Polarizing Random Walks. CCC 2018: 1:1-1:21 - [c10]Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron
A New Approach for Constructing Low-Error, Two-Source Extractors. CCC 2018: 3:1-3:19 - [c9]Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal:
Improved pseudorandomness for unordered branching programs through local monotonicity. STOC 2018: 363-375 - [i21]Eshan Chattopadhyay, Xin Li:
Non-Malleable Extractors and Codes in the Interleaved Split-State Model and More. CoRR abs/1804.05228 (2018) - [i20]Eshan Chattopadhyay, Anindya De, Rocco A. Servedio:
Simple and efficient pseudorandom generators from Gaussian processes. Electron. Colloquium Comput. Complex. TR18 (2018) - [i19]Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett:
Pseudorandom Generators from Polarizing Random Walks. Electron. Colloquium Comput. Complex. TR18 (2018) - [i18]Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal:
Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates. Electron. Colloquium Comput. Complex. TR18 (2018) - [i17]Eshan Chattopadhyay, Xin Li:
Non-Malleable Extractors and Codes in the Interleaved Split-State Model and More. Electron. Colloquium Comput. Complex. TR18 (2018) - [i16]Eshan Chattopadhyay, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar:
Privacy Amplification from Non-malleable Codes. IACR Cryptol. ePrint Arch. 2018: 293 (2018) - [i15]Eshan Chattopadhyay, Xin Li:
Non-Malleable Extractors and Codes for Composition of Tampering, Interleaved Tampering and More. IACR Cryptol. ePrint Arch. 2018: 1069 (2018) - 2017
- [c8]Eshan Chattopadhyay, Xin Li:
Non-malleable codes and extractors for small-depth circuits, and affine functions. STOC 2017: 1171-1184 - [i14]Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma:
A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate. Electron. Colloquium Comput. Complex. TR17 (2017) - [i13]Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal:
Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c7]Eshan Chattopadhyay, David Zuckerman:
New Extractors for Interleaved Sources. CCC 2016: 7:1-7:28 - [c6]Eshan Chattopadhyay, Xin Li:
Explicit Non-malleable Extractors, Multi-source Extractors, and Almost Optimal Privacy Amplification Protocols. FOCS 2016: 158-167 - [c5]Eshan Chattopadhyay, Vipul Goyal, Xin Li:
Non-malleable extractors and codes, with their many tampered extensions. STOC 2016: 285-298 - [c4]Eshan Chattopadhyay, Xin Li:
Extractors for sumset sources. STOC 2016: 299-311 - [c3]Eshan Chattopadhyay, David Zuckerman:
Explicit two-source extractors and resilient functions. STOC 2016: 670-683 - [i12]Eshan Chattopadhyay, Xin Li:
Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols. CoRR abs/1603.05226 (2016) - [i11]Eshan Chattopadhyay, Xin Li:
Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols. Electron. Colloquium Comput. Complex. TR16 (2016) - [i10]Eshan Chattopadhyay, Xin Li:
Non-Malleable Codes and Extractors for Small-Depth Circuits, and Affine Functions. Electron. Colloquium Comput. Complex. TR16 (2016) - [i9]Eshan Chattopadhyay, Vipul Goyal, Xin Li:
Non-Malleable Extractors and Codes, with their Many Tampered Extensions. IACR Cryptol. ePrint Arch. 2016: 340 (2016) - 2015
- [i8]Eshan Chattopadhyay, Vipul Goyal, Xin Li:
Non-Malleable Extractors and Codes, with their Many Tampered Extensions. CoRR abs/1505.00107 (2015) - [i7]Eshan Chattopadhyay, Vipul Goyal, Xin Li:
Non-Malleable Extractors and Codes, with their Many Tampered Extensions. Electron. Colloquium Comput. Complex. TR15 (2015) - [i6]Eshan Chattopadhyay, Xin Li:
Extractors for Sumset Sources. Electron. Colloquium Comput. Complex. TR15 (2015) - [i5]Eshan Chattopadhyay, David Zuckerman:
Explicit Two-Source Extractors and Resilient Functions. Electron. Colloquium Comput. Complex. TR15 (2015) - [i4]Eshan Chattopadhyay, David Zuckerman:
New Extractors for Interleaved Sources. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c2]Eshan Chattopadhyay, David Zuckerman:
Non-malleable Codes against Constant Split-State Tampering. FOCS 2014: 306-315 - [i3]Chandrajit L. Bajaj, Abhishek Bhowmick, Eshan Chattopadhyay, David Zuckerman:
On Low Discrepancy Samplings in Product Spaces of Motion Groups. CoRR abs/1411.7753 (2014) - [i2]Eshan Chattopadhyay, David Zuckerman:
Non-Malleable Codes Against Constant Split-State Tampering. Electron. Colloquium Comput. Complex. TR14 (2014) - 2012
- [c1]Eshan Chattopadhyay, Adam R. Klivans, Pravesh Kothari:
An Explicit VC-Theorem for Low-Degree Polynomials. APPROX-RANDOM 2012: 495-504 - [i1]Eshan Chattopadhyay, Adam R. Klivans, Pravesh Kothari:
An Explicit VC-Theorem for Low-Degree Polynomials. Electron. Colloquium Comput. Complex. TR12 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: