Eshan Chattopadhyay

Affiliations:
  • Cornell University, Ithaca, NY, USA
  • Institute for Advanced Study, Princeton, School of Mathematics (former)
  • University of California, Berkeley, Simons Institute (former)
  • University of Texas at Austin, Department of Computer Science (former)


According to our database1, Eshan Chattopadhyay authored at least 42 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Two-Sided Lossless Expanders in the Unbalanced Setting.
Electron. Colloquium Comput. Complex., 2024

Extractors for Polynomial Sources over 𝔽<sub>2</sub>.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Recursive Error Reduction for Regular Branching Programs.
Electron. Colloquium Comput. Complex., 2023

On the Existence of Seedless Condensers: Exploring the Terrain.
Electron. Colloquium Comput. Complex., 2023

Extractors for Polynomial Sources over $\mathbb{F}_2$.
Electron. Colloquium Comput. Complex., 2023

2022
Recent Advances in Randomness Extraction.
Entropy, 2022

Hardness against Linear Branching Programs and More.
Electron. Colloquium Comput. Complex., 2022

Low-Degree Polynomials Extract from Local Sources.
Electron. Colloquium Comput. Complex., 2022

2021
Extractors for Sum of Two Sources.
Electron. Colloquium Comput. Complex., 2021

The Space Complexity of Sampling.
Electron. Colloquium Comput. Complex., 2021

Affine Extractors for Almost Logarithmic Entropy.
Electron. Colloquium Comput. Complex., 2021

Improved Extractors for Small-Space Sources.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Fractional Pseudorandom Generators from Any Fourier Level.
Proceedings of the 36th Computational Complexity Conference, 2021

2020
Guest Column: A Recipe for Constructing Two-Source Extractors.
SIGACT News, 2020

Nonmalleable Extractors and Codes, with Their Many Tampered Extensions.
SIAM J. Comput., 2020

Optimal Error Pseudodistributions for Read-Once Branching Programs.
Electron. Colloquium Comput. Complex., 2020

Fractional Pseudorandom Generators from the $k$th Fourier Level.
Electron. Colloquium Comput. Complex., 2020

Leakage-Resilient Extractors and Secret-Sharing against Bounded Collusion Protocols.
Electron. Colloquium Comput. Complex., 2020

Explicit Extremal Designs and Applications to Extractors.
Electron. Colloquium Comput. Complex., 2020

Non-Malleability against Polynomial Tampering.
Electron. Colloquium Comput. Complex., 2020

Non-malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Extractors and Secret Sharing Against Bounded Collusion Protocols.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
XOR Lemmas for Resilient Functions Against Polynomials.
Electron. Colloquium Comput. Complex., 2019

Extractors for Adversarial Sources via Extremal Hypergraphs.
Electron. Colloquium Comput. Complex., 2019

2018
Non-Malleable Extractors and Codes for Composition of Tampering, Interleaved Tampering and More.
IACR Cryptol. ePrint Arch., 2018

Privacy Amplification from Non-malleable Codes.
IACR Cryptol. ePrint Arch., 2018

Non-Malleable Extractors and Codes in the Interleaved Split-State Model and More.
Electron. Colloquium Comput. Complex., 2018

Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates.
Electron. Colloquium Comput. Complex., 2018

Pseudorandom Generators from Polarizing Random Walks.
Electron. Colloquium Comput. Complex., 2018

Simple and efficient pseudorandom generators from Gaussian processes.
Electron. Colloquium Comput. Complex., 2018

A New Approach for Constructing Low-Error, Two-Source Extractors.
Proceedings of the 33rd Computational Complexity Conference, 2018

2017
Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity.
Electron. Colloquium Comput. Complex., 2017

A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate.
Electron. Colloquium Comput. Complex., 2017

2016
Non-Malleable Codes and Extractors for Small-Depth Circuits, and Affine Functions.
Electron. Colloquium Comput. Complex., 2016

Explicit Non-Malleable Extractors, Multi-Source Extractors and Almost Optimal Privacy Amplification Protocols.
Electron. Colloquium Comput. Complex., 2016

2015
New Extractors for Interleaved Sources.
Electron. Colloquium Comput. Complex., 2015

Explicit Two-Source Extractors and Resilient Functions.
Electron. Colloquium Comput. Complex., 2015

Extractors for Sumset Sources.
Electron. Colloquium Comput. Complex., 2015

Non-Malleable Extractors and Codes, with their Many Tampered Extensions.
Electron. Colloquium Comput. Complex., 2015

2014
Non-Malleable Codes Against Constant Split-State Tampering.
Electron. Colloquium Comput. Complex., 2014

On Low Discrepancy Samplings in Product Spaces of Motion Groups.
CoRR, 2014

2012
An Explicit VC-Theorem for Low-Degree Polynomials.
Electron. Colloquium Comput. Complex., 2012


  Loading...