| Non-malleable extractors and codes, with their many tampered extensions E Chattopadhyay, V Goyal, X Li Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 94 | 2016 |
| Improved non-malleable extractors, non-malleable codes and independent source extractors X Li Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 81 | 2017 |
| Privacy amplification and nonmalleable extractors via character sums Y Dodis, X Li, TD Wooley, D Zuckerman SIAM Journal on Computing 43 (2), 800-830, 2014 | 65 | 2014 |
| Non-malleable extractors, two-source extractors and privacy amplification X Li 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 688-697, 2012 | 58 | 2012 |
| Three-source extractors for polylogarithmic min-entropy X Li 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 863-882, 2015 | 47 | 2015 |
| 2-source extractors under computational assumptions and cryptography with defective randomness YT Kalai, X Li, A Rao 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 617-626, 2009 | 46 | 2009 |
| Deterministic document exchange protocols, and almost optimal binary codes for edit errors K Cheng, Z Jin, X Li, K Wu 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 43 | 2018 |
| Improved two-source extractors, and affine extractors for polylogarithmic entropy X Li 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 43 | 2016 |
| Extractors for a constant number of independent sources with polylogarithmic min-entropy X Li 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 100-109, 2013 | 43 | 2013 |
| Improved constructions of three source extractors X Li 2011 IEEE 26th Annual Conference on Computational Complexity, 126-136, 2011 | 42 | 2011 |
| 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 | 38 | 2017 |
| Network extractor protocols YT Kalai, X Li, A Rao, D Zuckerman 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 654-663, 2008 | 38 | 2008 |
| Multiple-copy entanglement transformation and entanglement catalysis R Duan, Y Feng, X Li, M Ying Physical Review A 71 (4), 042319, 2005 | 38 | 2005 |
| New independent source extractors with exponential improvement X Li Proceedings of the forty-fifth annual ACM Symposium on Theory of Computing …, 2013 | 37 | 2013 |
| Non-malleable extractors and non-malleable codes: Partially optimal constructions X Li arXiv preprint arXiv:1804.04005, 2018 | 36 | 2018 |
| Design extractors, non-malleable condensers and privacy amplification X Li Proceedings of the forty-fourth annual ACM Symposium on Theory of Computing …, 2012 | 36 | 2012 |
| 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 | 32 | 2016 |
| Non-malleable condensers for arbitrary min-entropy, and almost optimal protocols for privacy amplification X Li Theory of Cryptography Conference, 502-531, 2015 | 30 | 2015 |
| Robust pseudorandom generators Y Ishai, E Kushilevitz, X Li, R Ostrovsky, M Prabhakaran, A Sahai, ... International Colloquium on Automata, Languages, and Programming, 576-588, 2013 | 30 | 2013 |
| A new approach to affine extractors and dispersers X Li 2011 IEEE 26th Annual Conference on Computational Complexity, 137-147, 2011 | 29 | 2011 |
Eshan ChattopadhyayCornell UniversityVerified email at cornell.edu
