| Fairness through awareness C Dwork, M Hardt, T Pitassi, O Reingold, R Zemel Proceedings of the 3rd innovations in theoretical computer science …, 2012 | 3061 | 2012 |
| Undirected connectivity in log-space O Reingold Journal of the ACM (JACM) 55 (4), 1-24, 2008 | 943 | 2008 |
| Number-theoretic constructions of efficient pseudo-random functions M Naor, O Reingold Journal of the ACM (JACM) 51 (2), 231-262, 2004 | 841 | 2004 |
| Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors O Reingold, S Vadhan, A Wigderson Proceedings 41st Annual Symposium on Foundations of Computer Science, 3-13, 2000 | 575 | 2000 |
| Priced oblivious transfer: How to sell digital goods B Aiello, Y Ishai, O Reingold Advances in Cryptology—EUROCRYPT 2001: International Conference on the …, 2001 | 531 | 2001 |
| On the construction of pseudo-random permutations: Luby-Rackoff revisited M Naor, O Reingold Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 515 | 1997 |
| Keyword Search and Oblivious Pseudorandom Functions. MJ Freedman, Y Ishai, B Pinkas, O Reingold TCC 3378, 303-324, 2005 | 473 | 2005 |
| 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 | 442 | 2009 |
| Preserving statistical validity in adaptive data analysis C Dwork, V Feldman, M Hardt, T Pitassi, O Reingold, AL Roth Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 371 | 2015 |
| The reusable holdout: Preserving validity in adaptive data analysis C Dwork, V Feldman, M Hardt, T Pitassi, O Reingold, A Roth Science 349 (6248), 636-638, 2015 | 363 | 2015 |
| Notions of reducibility between cryptographic primitives O Reingold, L Trevisan, S Vadhan Theory of Cryptography: First Theory of Cryptography Conference, TCC 2004 …, 2004 | 304 | 2004 |
| 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 | 296 | 2018 |
| Computational differential privacy I Mironov, O Pandey, O Reingold, S Vadhan Advances in Cryptology-CRYPTO 2009: 29th Annual International Cryptology …, 2009 | 283 | 2009 |
| Distributed pseudo-random functions and KDCs M Naor, B Pinkas, O Reingold Advances in Cryptology—EUROCRYPT’99: International Conference on the Theory …, 1999 | 256 | 1999 |
| Extracting all the randomness and reducing the error in Trevisan's extractors R Raz, O Reingold, S Vadhan Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999 | 255 | 1999 |
| Randomness conductors and constant-degree lossless expanders M Capalbo, O Reingold, S Vadhan, A Wigderson Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 248 | 2002 |
| Generalization in adaptive data analysis and holdout reuse C Dwork, V Feldman, M Hardt, T Pitassi, O Reingold, A Roth Advances in Neural Information Processing Systems 28, 2015 | 233 | 2015 |
| Magic functions: In memoriam: Bernard m. dwork 1923--1998 C Dwork, M Naor, O Reingold, L Stockmeyer Journal of the ACM (JACM) 50 (6), 852-921, 2003 | 230 | 2003 |
| The relationship between public key encryption and oblivious transfer Y Gertner, S Kannan, T Malkin, O Reingold, M Viswanathan Proceedings 41st Annual Symposium on Foundations of Computer Science, 325-335, 2000 | 223 | 2000 |
| Perfectly one-way probabilistic hash functions (preliminary version) R Canetti, D Micciancio, O Reingold Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 215 | 1998 |
