Hi! I am a postdoctoral researcher under Avi Wigderson in the School of Mathematics at the Institute for Advanced Study in Princeton. I am also affiliated with the Simons Collaboration on Algorithms and Geometry. I am spending the Spring '17 semester at the Simons Institute in UC Berkeley as a Microsoft Research Fellow in the Pseudorandomness program.

Previously, I finished my PhD in Computer Science at UT Austin under the brilliant guidance of David Zuckerman. Even before that, I was an undergrad in the computer science department at IIT Kanpur.

I do research in theoretical computer science. In particular, I am interested in complexity theory, pseudorandomness and cryptography.

Here are some articles and blogposts (Oded Goldreich's post, Gil Kalai's post) about my research.

An article about my research targeted towards general audience: How random is your randomness, and why does it matter?, with David Zuckerman.

Here is a CV.

Publications

  • 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
    Manuscript, 2017
  • Non-Malleable Codes and Extractors for Small-Depth Circuits, and Affine Functions
    Eshan Chattopadhyay, Xin Li
    STOC 2017
  • Explicit Two-Source Extractors and More
    PhD Thesis, 2016.
    Bert Kay Dissertation Award (given for the best doctoral thesis in computer science at UT Austin)
  • Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols
    Eshan Chattopadhyay, Xin Li
    FOCS 2016
  • Explicit Two-Source Extractors and Resilient Functions
    Eshan Chattopadhyay, David Zuckerman
    STOC 2016, Best Paper Award
  • Extractors for Sumset Sources
    Eshan Chattopadhyay, Xin Li
    STOC 2016
  • Non-Malleable Extractors and Codes, with their Many Tampered Extensions
    Eshan Chattopadhyay, Vipul Goyal, Xin Li
    STOC 2016
  • New Extractors for Interleaved Sources
    Eshan Chattopadhyay, David Zuckerman
    CCC 2016
  • Non-Malleable Codes Against Constant Split-State Tampering
    Eshan Chattopadhyay, David Zuckerman
    FOCS 2014
  • On Low Discrepancy Samplings in Product Spaces of Motion Groups
    Chandrajit Bajaj, Abhishek Bhowmick, Eshan Chattopadhyay, David Zuckerman
    Manuscript, 2014
  • An Explicit VC-Theorem for Low-Degree Polynomials
    Eshan Chattopadhyay, Adam Klivans, Pravesh Kothari
    RANDOM 2012