| Explicit two-source extractors and resilient functions E Chattopadhyay, D Zuckerman Annals of Mathematics 189 (3), 653-705, 2019 | 183 | 2019 |
| Non-malleable extractors and codes, with their many tampered extensions E Chattopadhyay, V Goyal, X Li SIAM Journal on Computing 49 (5), 999–1040, 2020 | 124* | 2020 |
| Non-malleable codes against constant split-state tampering E Chattopadhyay, D Zuckerman 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 306-315, 2014 | 100* | 2014 |
| Pseudorandom generators from polarizing random walks E Chattopadhyay, P Hatami, K Hosseini, S Lovett Theory of Computing 15 (1), 1-26, 2019 | 56 | 2019 |
| Non-malleable codes and extractors for small-depth circuits, and affine functions E Chattopadhyay, X Li Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 48 | 2017 |
| Explicit non-malleable extractors, multi-source extractors, and almost optimal privacy amplification protocols E Chattopadhyay, X Li 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 40 | 2016 |
| Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates E Chattopadhyay, P Hatami, S Lovett, A Tal 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2018 | 39 | 2018 |
| Improved pseudorandomness for unordered branching programs through local monotonicity E Chattopadhyay, P Hatami, O Reingold, A Tal Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 35 | 2018 |
| Extractors and secret sharing against bounded collusion protocols E Chattopadhyay, J Goodman, V Goyal, A Kumar, X Li, R Meka, ... 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 24* | 2020 |
| Extractors for sumset sources E Chattopadhyay, X Li Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 22 | 2016 |
| Optimal error pseudodistributions for read-once branching programs E Chattopadhyay, JJ Liao arXiv preprint arXiv:2002.07208, 2020 | 19 | 2020 |
| Non-malleable codes, extractors and secret sharing for interleaved tampering and composition of tampering E Chattopadhyay, X Li Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC …, 2020 | 18* | 2020 |
| A new approach for constructing low-error, two-source extractors A Ben-Aroya, E Chattopadhyay, D Doron, X Li, A Ta-Shma 33rd Computational Complexity Conference (CCC 2018), 2018 | 18* | 2018 |
| Affine extractors for almost logarithmic entropy E Chattopadhyay, J Goodman, JJ Liao 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 16 | 2022 |
| Extractors for adversarial sources via extremal hypergraphs E Chattopadhyay, J Goodman, V Goyal, X Li Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 16 | 2020 |
| Improved extractors for small-space sources E Chattopadhyay, J Goodman 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 13* | 2022 |
| Fractional pseudorandom generators from any fourier level E Chattopadhyay, J Gaitonde, CH Lee, S Lovett, A Shetty arXiv preprint arXiv:2008.01316, 2020 | 12 | 2020 |
| New extractors for interleaved sources E Chattopadhyay, D Zuckerman 31st Conference on Computational Complexity (CCC 2016), 2016 | 11 | 2016 |
| On low discrepancy samplings in product spaces of motion groups C Bajaj, A Bhowmick, E Chattopadhyay, D Zuckerman arXiv preprint arXiv:1411.7753, 2014 | 10 | 2014 |
| Extractors for sum of two sources E Chattopadhyay, JJ Liao Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 9 | 2022 |
Xin LiJohns Hopkins UniversityVerified email at cs.jhu.edu
