I am broadly interested in theoretical computer science and I am part of the theory group at Cornell.


Current Teaching: Pseudorandomness and Combinatorial Constructions


  • Simple and efficient pseudorandom generators from Gaussian processes
    Eshan Chattopadhyay, Anindya De, Rocco A. Servedio
    Manuscript 2018
  • Non-Malleable Extractors and Codes for Composition of Tampering, Interleaved Tampering and More
    Eshan Chattopadhyay, Xin Li
    Manuscript 2018
  • Privacy Amplification from Non-Malleable Codes
    Eshan Chattopadhyay, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar
    Manuscript 2018
  • Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates
    Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal
    ITCS 2019
  • Pseudorandom Generators from Polarizing Random Walks
    Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett
    CCC 2018, Invited to ToC special issue
  • A New Approach for Constructing Low-Error, Two-Source Extractors
    Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, Amnon Ta-Shma
    CCC 2018
  • Improved Pseudorandoness for Unordered Branching Programs through Local Monotonicity
    Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal
    STOC 2018
  • 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 (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
  • Program Committees: FSTTCS 2017, FOCS 2018

    Organizational Activities: Randomness Extractors: Constructions and Applications

    General audience article: How random is your randomness, and why does it matter?
    with David Zuckerman.