| Boosting and differential privacy C Dwork, GN Rothblum, S Vadhan 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 51-60, 2010 | 558 | 2010 |
| Delegating computation: interactive proofs for muggles S Goldwasser, YT Kalai, GN Rothblum Journal of the ACM (JACM) 62 (4), 1-64, 2015 | 544 | 2015 |
| Differential privacy under continual observation C Dwork, M Naor, T Pitassi, GN Rothblum Proceedings of the forty-second ACM symposium on Theory of computing, 715-724, 2010 | 483 | 2010 |
| A multiplicative weights mechanism for privacy-preserving data analysis M Hardt, GN Rothblum 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 61-70, 2010 | 323 | 2010 |
| On the complexity of differentially private data release: efficient algorithms and hardness results C Dwork, M Naor, O Reingold, GN Rothblum, S Vadhan Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 322 | 2009 |
| On best-possible obfuscation S Goldwasser, GN Rothblum Theory of Cryptography Conference, 194-213, 2007 | 275* | 2007 |
| One-time programs S Goldwasser, YT Kalai, GN Rothblum Annual International Cryptology Conference, 39-56, 2008 | 243 | 2008 |
| Securely obfuscating re-encryption S Hohenberger, GN Rothblum, A Shelat, V Vaikuntanathan Journal of cryptology 24 (4), 694-719, 2011 | 240* | 2011 |
| Virtual black-box obfuscation for all circuits via generic graded encoding Z Brakerski, GN Rothblum Theory of Cryptography Conference, 1-25, 2014 | 225 | 2014 |
| The complexity of online memory checking M Naor, GN Rothblum Journal of the ACM (JACM) 56 (1), 1-46, 2009 | 221 | 2009 |
| Concentrated differential privacy C Dwork, GN Rothblum arXiv preprint arXiv:1603.01887, 2016 | 199 | 2016 |
| Leakage-resilient signatures S Faust, E Kiltz, K Pietrzak, GN Rothblum Theory of Cryptography Conference, 343-360, 2010 | 166 | 2010 |
| Pan-Private Streaming Algorithms. C Dwork, M Naor, T Pitassi, GN Rothblum, S Yekhanin ICS, 66-80, 2010 | 155 | 2010 |
| Practical delegation of computation using multiple servers R Canetti, B Riva, GN Rothblum Proceedings of the 18th ACM conference on Computer and communications …, 2011 | 120 | 2011 |
| Constant-round interactive proofs for delegating computation O Reingold, GN Rothblum, RD Rothblum SIAM Journal on Computing, STOC16-255-STOC16-340, 2019 | 110 | 2019 |
| Obfuscation of hyperplane membership R Canetti, GN Rothblum, M Varia Theory of Cryptography Conference, 72-89, 2010 | 100 | 2010 |
| Two protocols for delegation of computation R Canetti, B Riva, GN Rothblum International Conference on Information Theoretic Security, 37-61, 2012 | 91* | 2012 |
| Securing computation against continuous leakage S Goldwasser, GN Rothblum Annual Cryptology Conference, 59-79, 2010 | 91 | 2010 |
| How to compute in the presence of leakage S Goldwasser, GN Rothblum SIAM Journal on Computing 44 (5), 1480-1549, 2015 | 67 | 2015 |
| Obfuscating conjunctions Z Brakerski, GN Rothblum Journal of Cryptology 30 (1), 289-320, 2017 | 66 | 2017 |
