Sledovat
Eshan Chattopadhyay
Eshan Chattopadhyay
Associate Professor at Cornell University
E-mailová adresa ověřena na: cs.cornell.edu - Domovská stránka
Název
Citace
Citace
Rok
Explicit two-source extractors and resilient functions
E Chattopadhyay, D Zuckerman
Annals of Mathematics 189 (3), 653-705, 2019
1902019
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
129*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
101*2014
Pseudorandom generators from polarizing random walks
E Chattopadhyay, P Hatami, K Hosseini, S Lovett
Theory of Computing 15 (1), 1-26, 2019
602019
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
512017
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
422016
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
392018
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
382018
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
29*2020
Extractors for sumset sources
E Chattopadhyay, X Li
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
262016
Optimal error pseudodistributions for read-once branching programs
E Chattopadhyay, JJ Liao
arXiv preprint arXiv:2002.07208, 2020
202020
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
19*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
182022
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
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
162020
Improved extractors for small-space sources
E Chattopadhyay, J Goodman
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
15*2022
Fractional pseudorandom generators from any fourier level
E Chattopadhyay, J Gaitonde, CH Lee, S Lovett, A Shetty
arXiv preprint arXiv:2008.01316, 2020
132020
Extractors for sum of two sources
E Chattopadhyay, JJ Liao
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
122022
New extractors for interleaved sources
E Chattopadhyay, D Zuckerman
31st Conference on Computational Complexity (CCC 2016), 2016
122016
Privacy amplification from non-malleable codes
E Chattopadhyay, B Kanukurthi, SLB Obbattu, S Sekar
International Conference on Cryptology in India, 318-337, 2019
112019
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20