Doubly-efficient zkSNARKs without trusted setup RS Wahby, I Tzialla, A Shelat, J Thaler, M Walfish
2018 IEEE Symposium on Security and Privacy (SP), 926-943, 2018
345 2018 Practical verified computation with streaming interactive proofs G Cormode, M Mitzenmacher, J Thaler
Proceedings of the 3rd Innovations in Theoretical Computer Science …, 2012
298 2012 Time-optimal interactive proofs for circuit evaluation J Thaler
Annual Cryptology Conference, 71-89, 2013
253 2013 Reliably learning the relu in polynomial time S Goel, V Kanade, A Klivans, J Thaler
Conference on Learning Theory, 1004-1042, 2017
140 2017 Brakedown: Linear-time and field-agnostic SNARKs for R1CS A Golovnev, J Lee, S Setty, J Thaler, RS Wahby
Annual International Cryptology Conference, 193-226, 2023
111 * 2023 Faster algorithms for privately releasing marginals J Thaler, J Ullman, S Vadhan
International Colloquium on Automata, Languages, and Programming, 810-821, 2012
106 2012 {Verifiable} Computation with Massively Parallel Interactive Proofs J Thaler, M Roberts, M Mitzenmacher, H Pfister
4th USENIX Workshop on Hot Topics in Cloud Computing (HotCloud 12), 2012
98 2012 Full accounting for verifiable outsourcing RS Wahby, Y Ji, AJ Blumberg, A Shelat, J Thaler, M Walfish, T Wies
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
94 2017 Proofs, arguments, and zero-knowledge J Thaler
Foundations and Trends® in Privacy and Security 4 (2–4), 117-660, 2022
92 2022 Verifying computations with streaming interactive proofs G Cormode, J Thaler, K Yi
arXiv preprint arXiv:1109.6882, 2011
89 2011 The polynomial method strikes back: Tight quantum query bounds via dual polynomials M Bun, R Kothari, J Thaler
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
77 2018 Dual lower bounds for approximate degree and Markov–Bernstein inequalities M Bun, J Thaler
Information and Computation 243, 2-25, 2015
67 2015 Hierarchical heavy hitters with the space saving algorithm M Mitzenmacher, T Steinke, J Thaler
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and …, 2012
61 2012 Variable selection is hard D Foster, H Karloff, J Thaler
Conference on Learning Theory, 696-709, 2015
54 2015 Faster private release of marginals on small databases K Chandrasekaran, J Thaler, J Ullman, A Wan
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
52 2014 On the power of statistical zero knowledge A Bouland, L Chen, D Holden, J Thaler, PN Vasudevan
SIAM Journal on Computing 49 (4), FOCS17-1-FOCS17-58, 2019
48 2019 A Nearly Optimal Lower Bound on the Approximate Degree of AC M Bun, J Thaler
SIAM Journal on Computing 49 (4), FOCS17-59-FOCS17-96, 2019
48 2019 Parallel peeling algorithms J Jiang, M Mitzenmacher, J Thaler
ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-27, 2017
46 2017 Streaming graph computations with a helpful advisor G Cormode, M Mitzenmacher, J Thaler
Algorithmica 65 (2), 409-442, 2013
45 2013 Hardness amplification and the approximate degree of constant-depth circuits M Bun, J Thaler
Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015
43 2015 