Eshan Chattopadhyay

91 papers A* 16A 12Misc 1Journal 59Unranked 3
YearRankTypeTitle / Venue / Authors
2025 A ed.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2025, Berkeley, CA, USA, August 11-13, 2025
APPROX/RANDOM
Alina Ene, Eshan Chattopadhyay
2025 A* conf
Leakage-Resilient Extractors against Number-on-Forehead Protocols.
STOC
Eshan Chattopadhyay, Jesse Goodman
2025 J jnl
Leakage-Resilient Extractors against Number-on-Forehead Protocols.
CoRR
Eshan Chattopadhyay, Jesse Goodman
2025 J jnl
Leakage-Resilient Extractors against Number-on-Forehead Protocols.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Jesse Goodman
2025 J jnl
Leakage-Resilient Extractors against Number-on-Forehead Protocols.
IACR Cryptol. ePrint Arch.
Eshan Chattopadhyay, Jesse Goodman
2025 J jnl
Lower Bounds for Leader Election and Collective Coin Flipping, Revisited.
CoRR
Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach, Rocco A. Servedio
2024 J jnl
Condensing Against Online Adversaries.
CoRR
Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach
2024 J jnl
Condensing against Online Adversaries.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach
2024 A conf
Extractors for Polynomial Sources over 𝔽
ITCS
Eshan Chattopadhyay, Jesse Goodman, Mohit Gurumukhani
2024 A* conf
On the Existence of Seedless Condensers: Exploring the Terrain.
FOCS
Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach
2024 A conf
Recursive Error Reduction for Regular Branching Programs.
ITCS
Eshan Chattopadhyay, Jyun-Jie Liao
2024 J jnl
Two-Sided Lossless Expanders in the Unbalanced Setting.
CoRR
Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach, Yunya Zhao
2024 J jnl
Two-Sided Lossless Expanders in the Unbalanced Setting.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach, Yunya Zhao
2023 J jnl
Extractors for Polynomial Sources over $\mathbb{F}_2$.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Jesse Goodman, Mohit Gurumukhani
2023 J jnl
Extractors for Polynomial Sources over F
CoRR
Eshan Chattopadhyay, Jesse Goodman, Mohit Gurumukhani
2023 A conf
Hardness Against Linear Branching Programs and More.
CCC
Eshan Chattopadhyay, Jyun-Jie Liao
2023 J jnl
On the Existence of Seedless Condensers: Exploring the Terrain.
CoRR
Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach
2023 J jnl
On the Existence of Seedless Condensers: Exploring the Terrain.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach
2023 J jnl
Recursive Error Reduction for Regular Branching Programs.
CoRR
Eshan Chattopadhyay, Jyun-Jie Liao
2023 J jnl
Recursive Error Reduction for Regular Branching Programs.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Jyun-Jie Liao
2022 A* conf
Extractors for sum of two sources.
STOC
Eshan Chattopadhyay, Jyun-Jie Liao
2022 J jnl
Hardness against Linear Branching Programs and More.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Jyun-Jie Liao
2022 A* conf
Low-Degree Polynomials Extract From Local Sources.
ICALP
Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro
2022 J jnl
Low-Degree Polynomials Extract from Local Sources.
CoRR
Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro
2022 J jnl
Low-Degree Polynomials Extract from Local Sources.
Electron. Colloquium Comput. Complex.
Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro
2022 J jnl
Recent Advances in Randomness Extraction.
Entropy
Eshan Chattopadhyay
2022 A conf
The Space Complexity of Sampling.
ITCS
Eshan Chattopadhyay, Jesse Goodman, David Zuckerman
2021 A* conf
Affine Extractors for Almost Logarithmic Entropy.
FOCS
Eshan Chattopadhyay, Jesse Goodman, Jyun-Jie Liao
2021 J jnl
Affine Extractors for Almost Logarithmic Entropy.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Jesse Goodman, Jyun-Jie Liao
2021 J jnl
Extractors for Sum of Two Sources.
CoRR
Eshan Chattopadhyay, Jyun-Jie Liao
2021 J jnl
Extractors for Sum of Two Sources.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Jyun-Jie Liao
2021 A conf
Fractional Pseudorandom Generators from Any Fourier Level.
CCC
Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, Abhishek Shetty
2021 A* conf
Improved Extractors for Small-Space Sources.
FOCS
Eshan Chattopadhyay, Jesse Goodman
2021 J jnl
The Space Complexity of Sampling.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Jesse Goodman, David Zuckerman
2020 J jnl
Explicit Extremal Designs and Applications to Extractors.
CoRR
Eshan Chattopadhyay, Jesse Goodman
2020 J jnl
Explicit Extremal Designs and Applications to Extractors.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Jesse Goodman
2020 A* conf
Extractors and Secret Sharing Against Bounded Collusion Protocols.
FOCS
Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar, Xin Li, Raghu Meka, David Zuckerman
2020 A* conf
Extractors for adversarial sources via extremal hypergraphs.
STOC
Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li
2020 J jnl
Fractional Pseudorandom Generators from Any Fourier Level.
CoRR
Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, Abhishek Shetty
2020 J jnl
Fractional Pseudorandom Generators from the $k$th Fourier Level.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Jason Gaitonde, Abhishek Shetty
2020 J jnl
Guest Column: A Recipe for Constructing Two-Source Extractors.
SIGACT News
Eshan Chattopadhyay
2020 J jnl
Leakage-Resilient Extractors and Secret-Sharing against Bounded Collusion Protocols.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li
2020 J jnl
Leakage-Resilient Extractors and Secret-Sharing against Bounded Collusion Protocols.
IACR Cryptol. ePrint Arch.
Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li
2020 J jnl
Non-Malleability against Polynomial Tampering.
Electron. Colloquium Comput. Complex.
Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan
2020 J jnl
Non-Malleability against Polynomial Tampering.
IACR Cryptol. ePrint Arch.
Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan
2020 — conf
Non-malleability Against Polynomial Tampering.
CRYPTO (3)
Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan
2020 — conf
Non-malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering.
TCC (3)
Eshan Chattopadhyay, Xin Li
2020 J jnl
Nonmalleable Extractors and Codes, with Their Many Tampered Extensions.
SIAM J. Comput.
Eshan Chattopadhyay, Vipul Goyal, Xin Li
2020 A conf
Optimal Error Pseudodistributions for Read-Once Branching Programs.
CCC
Eshan Chattopadhyay, Jyun-Jie Liao
2020 J jnl
Optimal Error Pseudodistributions for Read-Once Branching Programs.
CoRR
Eshan Chattopadhyay, Jyun-Jie Liao
2020 J jnl
Optimal Error Pseudodistributions for Read-Once Branching Programs.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Jyun-Jie Liao
2020 A* conf
XOR lemmas for resilient functions against polynomials.
STOC
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman
2019 J jnl
Extractors for Adversarial Sources via Extremal Hypergraphs.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li
2019 J jnl
Extractors for Adversarial Sources via Extremal Hypergraphs.
IACR Cryptol. ePrint Arch.
Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li
2019 Misc conf
Privacy Amplification from Non-malleable Codes.
INDOCRYPT
Eshan Chattopadhyay, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar
2019 J jnl
Pseudorandom Generators from Polarizing Random Walks.
Theory Comput.
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
2019 A conf
Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates.
ITCS
Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal
2019 A conf
Simple and Efficient Pseudorandom Generators from Gaussian Processes.
CCC
Eshan Chattopadhyay, Anindya De, Rocco A. Servedio
2019 J jnl
XOR Lemmas for Resilient Functions Against Polynomials.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman
2018 A conf
A New Approach for Constructing Low-Error, Two-Source Extractors.
CCC
Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma
2018 A* conf
Improved pseudorandomness for unordered branching programs through local monotonicity.
STOC
Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal
2018 J jnl
Non-Malleable Extractors and Codes for Composition of Tampering, Interleaved Tampering and More.
IACR Cryptol. ePrint Arch.
Eshan Chattopadhyay, Xin Li
2018 J jnl
Non-Malleable Extractors and Codes in the Interleaved Split-State Model and More.
CoRR
Eshan Chattopadhyay, Xin Li
2018 J jnl
Non-Malleable Extractors and Codes in the Interleaved Split-State Model and More.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Xin Li
2018 J jnl
Privacy Amplification from Non-malleable Codes.
IACR Cryptol. ePrint Arch.
Eshan Chattopadhyay, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar
2018 A conf
Pseudorandom Generators from Polarizing Random Walks.
CCC
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
2018 J jnl
Pseudorandom Generators from Polarizing Random Walks.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
2018 J jnl
Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal
2018 J jnl
Simple and efficient pseudorandom generators from Gaussian processes.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Anindya De, Rocco A. Servedio
2017 J jnl
A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate.
Electron. Colloquium Comput. Complex.
Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma
2017 J jnl
Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal
2017 A* conf
Non-malleable codes and extractors for small-depth circuits, and affine functions.
STOC
Eshan Chattopadhyay, Xin Li
2016 J jnl
Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols.
CoRR
Eshan Chattopadhyay, Xin Li
2016 J jnl
Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Xin Li
2016 A* conf
Explicit Non-malleable Extractors, Multi-source Extractors, and Almost Optimal Privacy Amplification Protocols.
FOCS
Eshan Chattopadhyay, Xin Li
2016 A* conf
Explicit two-source extractors and resilient functions.
STOC
Eshan Chattopadhyay, David Zuckerman
2016 A* conf
Extractors for sumset sources.
STOC
Eshan Chattopadhyay, Xin Li
2016 A conf
New Extractors for Interleaved Sources.
CCC
Eshan Chattopadhyay, David Zuckerman
2016 J jnl
Non-Malleable Codes and Extractors for Small-Depth Circuits, and Affine Functions.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Xin Li
2016 J jnl
Non-Malleable Extractors and Codes, with their Many Tampered Extensions.
IACR Cryptol. ePrint Arch.
Eshan Chattopadhyay, Vipul Goyal, Xin Li
2016 A* conf
Non-malleable extractors and codes, with their many tampered extensions.
STOC
Eshan Chattopadhyay, Vipul Goyal, Xin Li
2015 J jnl
Explicit Two-Source Extractors and Resilient Functions.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, David Zuckerman
2015 J jnl
Extractors for Sumset Sources.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Xin Li
2015 J jnl
New Extractors for Interleaved Sources.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, David Zuckerman
2015 J jnl
Non-Malleable Extractors and Codes, with their Many Tampered Extensions.
CoRR
Eshan Chattopadhyay, Vipul Goyal, Xin Li
2015 J jnl
Non-Malleable Extractors and Codes, with their Many Tampered Extensions.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Vipul Goyal, Xin Li
2014 J jnl
Non-Malleable Codes Against Constant Split-State Tampering.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, David Zuckerman
2014 A* conf
Non-malleable Codes against Constant Split-State Tampering.
FOCS
Eshan Chattopadhyay, David Zuckerman
2014 J jnl
On Low Discrepancy Samplings in Product Spaces of Motion Groups.
CoRR
Chandrajit L. Bajaj, Abhishek Bhowmick, Eshan Chattopadhyay, David Zuckerman
2012 — conf
An Explicit VC-Theorem for Low-Degree Polynomials.
APPROX-RANDOM
Eshan Chattopadhyay, Adam R. Klivans, Pravesh Kothari
2012 J jnl
An Explicit VC-Theorem for Low-Degree Polynomials.
Electron. Colloquium Comput. Complex.
Eshan Chattopadhyay, Adam R. Klivans, Pravesh Kothari