Eshan Chattopadhyay
Eshan Chattopadhyay
Bestätigte E-Mail-Adresse bei cornell.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Explicit two-source extractors and resilient functions
E Chattopadhyay, D Zuckerman
Annals of Mathematics 189 (3), 653-705, 2019
1342019
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
88*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
86*2014
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
362017
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
332016
Pseudorandom generators from polarizing random walks
E Chattopadhyay, P Hatami, K Hosseini, S Lovett
Theory of Computing 15 (1), 1-26, 2019
302019
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
232018
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
202018
Non-malleable codes, extractors and secret sharing for interleaved tampering and composition of tampering
E Chattopadhyay, X Li
Theory of Cryptography Conference, 584-613, 2020
15*2020
Extractors for sumset sources
E Chattopadhyay, X Li
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
132016
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
10*2018
On low discrepancy samplings in product spaces of motion groups
C Bajaj, A Bhowmick, E Chattopadhyay, D Zuckerman
arXiv preprint arXiv:1411.7753, 2014
92014
New extractors for interleaved sources
E Chattopadhyay, D Zuckerman
31st Conference on Computational Complexity (CCC 2016), 2016
62016
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
52020
Privacy amplification from non-malleable codes
E Chattopadhyay, B Kanukurthi, SLB Obbattu, S Sekar
International Conference on Cryptology in India, 318-337, 2019
52019
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
4*2020
Optimal error pseudodistributions for read-once branching programs
E Chattopadhyay, JJ Liao
arXiv preprint arXiv:2002.07208, 2020
42020
Explicit two-source extractors and more
E Chattopadhyay
32016
An explicit vc-theorem for low-degree polynomials
E Chattopadhyay, A Klivans, P Kothari
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012
32012
Non-malleability against polynomial tampering
M Ball, E Chattopadhyay, JJ Liao, T Malkin, LY Tan
Annual International Cryptology Conference, 97-126, 2020
22020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20