| 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 | 479 | 2018 |
| Practical verified computation with streaming interactive proofs G Cormode, M Mitzenmacher, J Thaler Proceedings of the 3rd Innovations in Theoretical Computer Science …, 2012 | 333 | 2012 |
| Time-optimal interactive proofs for circuit evaluation J Thaler Annual cryptology conference, 71-89, 2013 | 322 | 2013 |
| 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 | 238* | 2023 |
| Proofs, arguments, and zero-knowledge J Thaler Foundations and Trends® in Privacy and Security 4 (2-4), 117-660, 2022 | 189 | 2022 |
| Reliably learning the relu in polynomial time S Goel, V Kanade, A Klivans, J Thaler Conference on Learning Theory, 1004-1042, 2017 | 151 | 2017 |
| Unlocking the lookup singularity with lasso S Setty, J Thaler, R Wahby Annual International Conference on the Theory and Applications of …, 2024 | 127 | 2024 |
| 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 | 115 | 2017 |
| Faster algorithms for privately releasing marginals J Thaler, J Ullman, S Vadhan International Colloquium on Automata, Languages, and Programming, 810-821, 2012 | 115 | 2012 |
| Verifying computations with streaming interactive proofs G Cormode, J Thaler, K Yi arXiv preprint arXiv:1109.6882, 2011 | 105 | 2011 |
| Jolt: Snarks for virtual machines via lookups A Arun, S Setty, J Thaler Annual International Conference on the Theory and Applications of …, 2024 | 101 | 2024 |
| {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 | 101 | 2012 |
| 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 | 90 | 2018 |
| Customizable constraint systems for succinct arguments S Setty, J Thaler, R Wahby Cryptology ePrint Archive, 2023 | 83 | 2023 |
| Dual lower bounds for approximate degree and Markov–Bernstein inequalities M Bun, J Thaler Information and Computation 243, 2-25, 2015 | 69 | 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 | 69 | 2012 |
| Variable selection is hard D Foster, H Karloff, J Thaler Conference on Learning Theory, 696-709, 2015 | 66 | 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 | 56 | 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 | 54 | 2019 |
| Relative error streaming quantiles G Cormode, Z Karnin, E Liberty, J Thaler, P Veselý Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2021 | 51 | 2021 |
