| Boosting and differential privacy C Dwork, GN Rothblum, S Vadhan 2010 IEEE 51st annual symposium on foundations of computer science, 51-60, 2010 | 1170 | 2010 |
| 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 | 891 | 2010 |
| Delegating computation: interactive proofs for muggles S Goldwasser, YT Kalai, GN Rothblum Journal of the ACM (JACM) 62 (4), 1-64, 2015 | 875 | 2015 |
| Concentrated differential privacy C Dwork, GN Rothblum arXiv preprint arXiv:1603.01887, 2016 | 572 | 2016 |
| 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 | 509 | 2009 |
| 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 | 500 | 2010 |
| Multicalibration: Calibration for the (computationally-identifiable) masses U Hébert-Johnson, M Kim, O Reingold, G Rothblum International Conference on Machine Learning, 1939-1948, 2018 | 478 | 2018 |
| On best-possible obfuscation S Goldwasser, GN Rothblum Theory of Cryptography: 4th Theory of Cryptography Conference, TCC 2007 …, 2007 | 338* | 2007 |
| One-time programs S Goldwasser, YT Kalai, GN Rothblum Advances in Cryptology–CRYPTO 2008: 28th Annual International Cryptology …, 2008 | 324 | 2008 |
| Securely obfuscating re-encryption S Hohenberger, GN Rothblum, A Shelat, V Vaikuntanathan Journal of cryptology 24 (4), 694-719, 2011 | 280* | 2011 |
| Virtual black-box obfuscation for all circuits via generic graded encoding Z Brakerski, GN Rothblum Theory of Cryptography Conference, 1-25, 2014 | 279 | 2014 |
| The complexity of online memory checking M Naor, GN Rothblum Journal of the ACM (JACM) 56 (1), 1-46, 2009 | 251 | 2009 |
| Pan-Private Streaming Algorithms. C Dwork, M Naor, T Pitassi, GN Rothblum, S Yekhanin ics, 66-80, 2010 | 248 | 2010 |
| Constant-round interactive proofs for delegating computation O Reingold, GN Rothblum, RD Rothblum Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 244 | 2016 |
| Fiat-Shamir: from practice to theory R Canetti, Y Chen, J Holmgren, A Lombardi, GN Rothblum, RD Rothblum, ... Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 194 | 2019 |
| Composable and versatile privacy via truncated cdp M Bun, C Dwork, GN Rothblum, T Steinke Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 192 | 2018 |
| Practical delegation of computation using multiple servers R Canetti, B Riva, GN Rothblum Proceedings of the 18th ACM conference on Computer and communications …, 2011 | 189 | 2011 |
| Fairness through computationally-bounded awareness M Kim, O Reingold, G Rothblum Advances in neural information processing systems 31, 2018 | 179 | 2018 |
| Leakage-resilient signatures S Faust, E Kiltz, K Pietrzak, GN Rothblum Theory of Cryptography: 7th Theory of Cryptography Conference, TCC 2010 …, 2010 | 179 | 2010 |
| Developing a COVID-19 mortality risk prediction model when individual-level data are not available N Barda, D Riesel, A Akriv, J Levy, U Finkel, G Yona, D Greenfeld, ... Nature communications 11 (1), 4439, 2020 | 138 | 2020 |
