Eshan Chattopadhyay

According to our database, Eshan Chattopadhyay authored at least 45 papers between 2012 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Lower Bounds for Leader Election and Collective Coin Flipping, Revisited.

Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach, Rocco A. Servedio

CoRR, April, 2025

Leakage-Resilient Extractors against Number-on-Forehead Protocols.

Eshan Chattopadhyay, Jesse Goodman

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024

Condensing against Online Adversaries.

Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach

Electron. Colloquium Comput. Complex., 2024

Two-Sided Lossless Expanders in the Unbalanced Setting.

Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach, Yunya Zhao

Electron. Colloquium Comput. Complex., 2024

Recursive Error Reduction for Regular Branching Programs.

Eshan Chattopadhyay, Jyun-Jie Liao

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Extractors for Polynomial Sources over 𝔽₂.

Eshan Chattopadhyay, Jesse Goodman, Mohit Gurumukhani

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

On the Existence of Seedless Condensers: Exploring the Terrain.

Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Extractors for Polynomial Sources over $\mathbb{F}_2$.

Eshan Chattopadhyay, Jesse Goodman, Mohit Gurumukhani

Electron. Colloquium Comput. Complex., 2023

Hardness Against Linear Branching Programs and More.

Eshan Chattopadhyay, Jyun-Jie Liao

Proceedings of the 38th Computational Complexity Conference, 2023

2022

Recent Advances in Randomness Extraction.

Eshan Chattopadhyay

Entropy, 2022

Extractors for sum of two sources.

Eshan Chattopadhyay, Jyun-Jie Liao

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

The Space Complexity of Sampling.

Eshan Chattopadhyay, Jesse Goodman, David Zuckerman

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Low-Degree Polynomials Extract From Local Sources.

Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Affine Extractors for Almost Logarithmic Entropy.

Eshan Chattopadhyay, Jesse Goodman, Jyun-Jie Liao

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Improved Extractors for Small-Space Sources.

Eshan Chattopadhyay, Jesse Goodman

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Fractional Pseudorandom Generators from Any Fourier Level.

Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, Abhishek Shetty

Proceedings of the 36th Computational Complexity Conference, 2021

2020

Guest Column: A Recipe for Constructing Two-Source Extractors.

Eshan Chattopadhyay

SIGACT News, 2020

Nonmalleable Extractors and Codes, with Their Many Tampered Extensions.

Eshan Chattopadhyay, Vipul Goyal, Xin Li

SIAM J. Comput., 2020

Fractional Pseudorandom Generators from the $k$th Fourier Level.

Eshan Chattopadhyay, Jason Gaitonde, Abhishek Shetty

Electron. Colloquium Comput. Complex., 2020

Leakage-Resilient Extractors and Secret-Sharing against Bounded Collusion Protocols.

Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li

Electron. Colloquium Comput. Complex., 2020

Explicit Extremal Designs and Applications to Extractors.

Eshan Chattopadhyay, Jesse Goodman

Electron. Colloquium Comput. Complex., 2020

Non-malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering.

Eshan Chattopadhyay, Xin Li

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

XOR lemmas for resilient functions against polynomials.

Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Extractors for adversarial sources via extremal hypergraphs.

Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Extractors and Secret Sharing Against Bounded Collusion Protocols.

Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar, Xin Li, Raghu Meka, David Zuckerman

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Non-malleability Against Polynomial Tampering.

Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Optimal Error Pseudodistributions for Read-Once Branching Programs.

Eshan Chattopadhyay, Jyun-Jie Liao

Proceedings of the 35th Computational Complexity Conference, 2020

2019

Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates.

Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Privacy Amplification from Non-malleable Codes.

Eshan Chattopadhyay, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar

Proceedings of the Progress in Cryptology - INDOCRYPT 2019, 2019

Simple and Efficient Pseudorandom Generators from Gaussian Processes.

Eshan Chattopadhyay, Anindya De, Rocco A. Servedio

Proceedings of the 34th Computational Complexity Conference, 2019

2018

Non-Malleable Extractors and Codes for Composition of Tampering, Interleaved Tampering and More.

Eshan Chattopadhyay, Xin Li

IACR Cryptol. ePrint Arch., 2018

Non-Malleable Extractors and Codes in the Interleaved Split-State Model and More.

Eshan Chattopadhyay, Xin Li

Electron. Colloquium Comput. Complex., 2018

Improved pseudorandomness for unordered branching programs through local monotonicity.

Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Pseudorandom Generators from Polarizing Random Walks.

Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett

Proceedings of the 33rd Computational Complexity Conference, 2018

A New Approach for Constructing Low-Error, Two-Source Extractors.

Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma

Proceedings of the 33rd Computational Complexity Conference, 2018

2017

A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate.

Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma

Electron. Colloquium Comput. Complex., 2017

Non-malleable codes and extractors for small-depth circuits, and affine functions.

Eshan Chattopadhyay, Xin Li

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016

Explicit two-source extractors and resilient functions.

Eshan Chattopadhyay, David Zuckerman

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Extractors for sumset sources.

Eshan Chattopadhyay, Xin Li

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Non-malleable extractors and codes, with their many tampered extensions.

Eshan Chattopadhyay, Vipul Goyal, Xin Li

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Explicit Non-malleable Extractors, Multi-source Extractors, and Almost Optimal Privacy Amplification Protocols.

Eshan Chattopadhyay, Xin Li

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

New Extractors for Interleaved Sources.

Eshan Chattopadhyay, David Zuckerman

Proceedings of the 31st Conference on Computational Complexity, 2016

2014

On Low Discrepancy Samplings in Product Spaces of Motion Groups.

Chandrajit L. Bajaj, Abhishek Bhowmick, Eshan Chattopadhyay, David Zuckerman

CoRR, 2014

Non-malleable Codes against Constant Split-State Tampering.

Eshan Chattopadhyay, David Zuckerman

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2012

An Explicit VC-Theorem for Low-Degree Polynomials.

Eshan Chattopadhyay, Adam R. Klivans, Pravesh Kothari

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012