Eshan Chattopadhyay

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 77

Top Topics

Error Reduction

Gaussian Process

Image And Video Data

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Eshan Chattopadhyay, Jyun-Jie Liao
Recursive Error Reduction for Regular Branching Programs. ITCS (2024)
Eshan Chattopadhyay, Jesse Goodman, Mohit Gurumukhani
. ITCS (2024)
Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach
On the Existence of Seedless Condensers: Exploring the Terrain. Electron. Colloquium Comput. Complex. (2023)
Eshan Chattopadhyay, Jyun-Jie Liao
Hardness Against Linear Branching Programs and More. CCC (2023)
Eshan Chattopadhyay, Jyun-Jie Liao
Recursive Error Reduction for Regular Branching Programs. CoRR (2023)
Eshan Chattopadhyay, Jesse Goodman, Mohit Gurumukhani
Extractors for Polynomial Sources over $\mathbb{F}_2$. Electron. Colloquium Comput. Complex. (2023)
Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach
On the Existence of Seedless Condensers: Exploring the Terrain. CoRR (2023)
Eshan Chattopadhyay, Jesse Goodman, Mohit Gurumukhani
. CoRR (2023)
Eshan Chattopadhyay, Jyun-Jie Liao
Recursive Error Reduction for Regular Branching Programs. Electron. Colloquium Comput. Complex. (2023)
Eshan Chattopadhyay, Jyun-Jie Liao
Extractors for sum of two sources. STOC (2022)
Eshan Chattopadhyay
Recent Advances in Randomness Extraction. Entropy 24 (7) (2022)
Eshan Chattopadhyay, Jesse Goodman
Improved Extractors for Small-Space Sources. FOCS (2022)
Eshan Chattopadhyay, Jesse Goodman, David Zuckerman
The Space Complexity of Sampling. ITCS (2022)
Eshan Chattopadhyay, Jesse Goodman, Jyun-Jie Liao
Affine Extractors for Almost Logarithmic Entropy. FOCS (2022)
Eshan Chattopadhyay, Jyun-Jie Liao
Hardness against Linear Branching Programs and More. Electron. Colloquium Comput. Complex. (2022)
Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João L. Ribeiro
Low-Degree Polynomials Extract From Local Sources. ICALP (2022)
Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João L. Ribeiro
Low-Degree Polynomials Extract from Local Sources. CoRR (2022)
Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João L. Ribeiro
Low-Degree Polynomials Extract from Local Sources. Electron. Colloquium Comput. Complex. (2022)
Eshan Chattopadhyay, Jesse Goodman, Jyun-Jie Liao
Affine Extractors for Almost Logarithmic Entropy. Electron. Colloquium Comput. Complex. 28 (2021)
Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, Abhishek Shetty
Fractional Pseudorandom Generators from Any Fourier Level. Computational Complexity Conference (2021)
Eshan Chattopadhyay, Jyun-Jie Liao
Extractors for Sum of Two Sources. CoRR (2021)
Eshan Chattopadhyay, Jesse Goodman, David Zuckerman
The Space Complexity of Sampling. Electron. Colloquium Comput. Complex. 28 (2021)
Eshan Chattopadhyay, Jesse Goodman
Improved Extractors for Small-Space Sources. FOCS (2021)
Eshan Chattopadhyay, Jyun-Jie Liao
Extractors for Sum of Two Sources. Electron. Colloquium Comput. Complex. 28 (2021)
Eshan Chattopadhyay, Jesse Goodman, Jyun-Jie Liao
Affine Extractors for Almost Logarithmic Entropy. FOCS (2021)
Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan
Non-Malleability against Polynomial Tampering. Electron. Colloquium Comput. Complex. 27 (2020)
Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li
Extractors for adversarial sources via extremal hypergraphs. STOC (2020)
Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan
Non-Malleability against Polynomial Tampering. IACR Cryptol. ePrint Arch. 2020 (2020)
Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li
Leakage-Resilient Extractors and Secret-Sharing against Bounded Collusion Protocols. IACR Cryptol. ePrint Arch. 2020 (2020)
Eshan Chattopadhyay, Jesse Goodman
Explicit Extremal Designs and Applications to Extractors. CoRR (2020)
Eshan Chattopadhyay, Jason Gaitonde, Abhishek Shetty
Fractional Pseudorandom Generators from the $k$th Fourier Level. Electron. Colloquium Comput. Complex. 27 (2020)
Eshan Chattopadhyay, Jyun-Jie Liao
Optimal Error Pseudodistributions for Read-Once Branching Programs. Electron. Colloquium Comput. Complex. 27 (2020)
Eshan Chattopadhyay, Jyun-Jie Liao
Optimal Error Pseudodistributions for Read-Once Branching Programs. CoRR (2020)
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman
XOR lemmas for resilient functions against polynomials. STOC (2020)
Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, Abhishek Shetty
Fractional Pseudorandom Generators from Any Fourier Level. CoRR (2020)
Eshan Chattopadhyay, Vipul Goyal, Xin Li
Nonmalleable Extractors and Codes, with Their Many Tampered Extensions. SIAM J. Comput. 49 (5) (2020)
Eshan Chattopadhyay, Xin Li
Non-malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering. TCC (3) (2020)
Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li
Leakage-Resilient Extractors and Secret-Sharing against Bounded Collusion Protocols. Electron. Colloquium Comput. Complex. 27 (2020)
Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan
Non-malleability Against Polynomial Tampering. CRYPTO (3) (2020)
Eshan Chattopadhyay, Jesse Goodman
Explicit Extremal Designs and Applications to Extractors. Electron. Colloquium Comput. Complex. 27 (2020)
Eshan Chattopadhyay
Guest Column: A Recipe for Constructing Two-Source Extractors. SIGACT News 51 (2) (2020)
Eshan Chattopadhyay, Jyun-Jie Liao
Optimal Error Pseudodistributions for Read-Once Branching Programs. Computational Complexity Conference (2020)
Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar, Xin Li, Raghu Meka, David Zuckerman
Extractors and Secret Sharing Against Bounded Collusion Protocols. FOCS (2020)
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
Pseudorandom Generators from Polarizing Random Walks. Theory Comput. 15 (2019)
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman
XOR Lemmas for Resilient Functions Against Polynomials. Electron. Colloquium Comput. Complex. 26 (2019)
Eshan Chattopadhyay, Anindya De, Rocco A. Servedio
Simple and Efficient Pseudorandom Generators from Gaussian Processes. Computational Complexity Conference (2019)
Eshan Chattopadhyay, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar
Privacy Amplification from Non-malleable Codes. INDOCRYPT (2019)
Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li
Extractors for Adversarial Sources via Extremal Hypergraphs. Electron. Colloquium Comput. Complex. 26 (2019)
Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li
Extractors for Adversarial Sources via Extremal Hypergraphs. IACR Cryptol. ePrint Arch. 2019 (2019)
Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal
Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates. ITCS (2019)
Eshan Chattopadhyay, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar
Privacy Amplification from Non-malleable Codes. IACR Cryptol. ePrint Arch. 2018 (2018)
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. 25 (2018)
Eshan Chattopadhyay, Xin Li
Non-Malleable Extractors and Codes for Composition of Tampering, Interleaved Tampering and More. IACR Cryptol. ePrint Arch. 2018 (2018)
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
Pseudorandom Generators from Polarizing Random Walks. Electron. Colloquium Comput. Complex. 25 (2018)
Eshan Chattopadhyay, Xin Li
Non-Malleable Extractors and Codes in the Interleaved Split-State Model and More. CoRR (2018)
Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma
A New Approach for Constructing Low-Error, Two-Source Extractors. Computational Complexity Conference (2018)
Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal
Improved pseudorandomness for unordered branching programs through local monotonicity. STOC (2018)
Eshan Chattopadhyay, Xin Li
Non-Malleable Extractors and Codes in the Interleaved Split-State Model and More. Electron. Colloquium Comput. Complex. 25 (2018)
Eshan Chattopadhyay, Anindya De, Rocco A. Servedio
Simple and efficient pseudorandom generators from Gaussian processes. Electron. Colloquium Comput. Complex. 25 (2018)
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
Pseudorandom Generators from Polarizing Random Walks. Computational Complexity Conference (2018)
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. 24 (2017)
Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal
Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity. Electron. Colloquium Comput. Complex. 24 (2017)
Eshan Chattopadhyay, Xin Li
Non-malleable codes and extractors for small-depth circuits, and affine functions. STOC (2017)
Eshan Chattopadhyay, David Zuckerman
New Extractors for Interleaved Sources. Computational Complexity Conference (2016)
Eshan Chattopadhyay, Xin Li
Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols. Electron. Colloquium Comput. Complex. 23 (2016)
Eshan Chattopadhyay, Vipul Goyal, Xin Li
Non-Malleable Extractors and Codes, with their Many Tampered Extensions. IACR Cryptol. ePrint Arch. 2016 (2016)
Eshan Chattopadhyay, Xin Li
Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols. CoRR (2016)
Eshan Chattopadhyay, Xin Li
Explicit Non-malleable Extractors, Multi-source Extractors, and Almost Optimal Privacy Amplification Protocols. FOCS (2016)
Eshan Chattopadhyay, Xin Li
Extractors for sumset sources. STOC (2016)
Eshan Chattopadhyay, Vipul Goyal, Xin Li
Non-malleable extractors and codes, with their many tampered extensions. STOC (2016)
Eshan Chattopadhyay, Xin Li
Non-Malleable Codes and Extractors for Small-Depth Circuits, and Affine Functions. Electron. Colloquium Comput. Complex. 23 (2016)
Eshan Chattopadhyay, David Zuckerman
Explicit two-source extractors and resilient functions. STOC (2016)
Eshan Chattopadhyay, David Zuckerman
Explicit Two-Source Extractors and Resilient Functions. Electron. Colloquium Comput. Complex. 22 (2015)
Eshan Chattopadhyay, Vipul Goyal, Xin Li
Non-Malleable Extractors and Codes, with their Many Tampered Extensions. Electron. Colloquium Comput. Complex. 22 (2015)
Eshan Chattopadhyay, David Zuckerman
New Extractors for Interleaved Sources. Electron. Colloquium Comput. Complex. 22 (2015)
Eshan Chattopadhyay, Xin Li
Extractors for Sumset Sources. Electron. Colloquium Comput. Complex. 22 (2015)
Eshan Chattopadhyay, Vipul Goyal, Xin Li
Non-Malleable Extractors and Codes, with their Many Tampered Extensions. CoRR (2015)
Eshan Chattopadhyay, David Zuckerman
Non-Malleable Codes Against Constant Split-State Tampering. Electron. Colloquium Comput. Complex. 21 (2014)
Eshan Chattopadhyay, David Zuckerman
Non-malleable Codes against Constant Split-State Tampering. FOCS (2014)
Chandrajit L. Bajaj, Abhishek Bhowmick, Eshan Chattopadhyay, David Zuckerman
On Low Discrepancy Samplings in Product Spaces of Motion Groups. CoRR (2014)
Eshan Chattopadhyay, Adam R. Klivans, Pravesh Kothari
An Explicit VC-Theorem for Low-Degree Polynomials. APPROX-RANDOM (2012)
Eshan Chattopadhyay, Adam R. Klivans, Pravesh Kothari
An Explicit VC-Theorem for Low-Degree Polynomials. Electron. Colloquium Comput. Complex. 19 (2012)