معرفی
Eshan Chattopadhyay is a prominent researcher in theoretical computer science, focusing on computational complexity, pseudorandomness, and cryptography. His work centers on the explicit construction of randomness extractors, condensers, pseudorandom generators, and non-malleable codes, often improving entropy requirements and error bounds. He has made significant contributions to derandomization, space-bounded computation, and tamper-resilient cryptography. His research is published extensively in the Electronic Colloquium on Computational Complexity (ECCC), indicating deep engagement with foundational aspects of computer science.
Research Interests: Eshan's research spans randomness extraction from weak sources, including sumset sources, polynomial sources, and adversarial models. He investigates pseudorandomness for branching programs, linear threshold functions, and Fourier-based constructions. His work in cryptography includes non-malleable codes, leakage resilience, and secret sharing under bounded collusion. He also contributes to combinatorics through extremal hypergraphs and designs, and to complexity theory via lower bounds and derandomization techniques.
The recent articles (2021–2025) show a continued focus on improving extractor and condenser constructions under challenging models such as number-on-forehead protocols, online adversaries, and interleaved or adversarial sources. There is a strong trend toward handling sources with very low entropy, achieving near-optimal parameters, and extending results to two-sided and unbalanced settings in expander graphs. His collaborations with leading researchers like Xin Li, David Zuckerman, and Jesse Goodman reflect his central role in the community.
Scientific Awards:
- No specific awards mentioned in the provided text.
Advising and Grants: While no formal students or grants are listed, the volume and depth of publications suggest active mentorship and likely grant funding in theoretical computer science. His work often involves junior collaborators, indicating a role in guiding emerging researchers.
Labs and Teams: No specific lab or team affiliations are mentioned in the scraped content. However, his frequent co-authorship with researchers from institutions like UT Austin, CMU, and others implies participation in collaborative research networks focused on complexity and cryptography.
حوزههای پژوهشی
