Fairness through awareness C Dwork, M Hardt, T Pitassi, O Reingold, R Zemel Proceedings of the 3rd innovations in theoretical computer science …, 2012 | 3502 | 2012 |

Undirected connectivity in log-space O Reingold Journal of the ACM (JACM) 55 (4), 1-24, 2008 | 975 | 2008 |

Number-theoretic constructions of efficient pseudo-random functions M Naor, O Reingold Journal of the ACM (JACM) 51 (2), 231-262, 2004 | 870 | 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 | 592 | 2000 |

Priced oblivious transfer: How to sell digital goods B Aiello, Y Ishai, O Reingold International Conference on the Theory and Applications of Cryptographic …, 2001 | 536 | 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 | 522 | 1997 |

Keyword search and oblivious pseudorandom functions MJ Freedman, Y Ishai, B Pinkas, O Reingold Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005 …, 2005 | 511 | 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 | 464 | 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 | 388 | 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 | 371 | 2015 |

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 | 363 | 2018 |

Notions of reducibility between cryptographic primitives O Reingold, L Trevisan, S Vadhan Theory of Cryptography Conference, 1-20, 2004 | 315 | 2004 |

Computational differential privacy I Mironov, O Pandey, O Reingold, S Vadhan Annual International Cryptology Conference, 126-142, 2009 | 298 | 2009 |

Distributed pseudo-random functions and KDCs M Naor, B Pinkas, O Reingold International conference on the theory and applications of cryptographic …, 1999 | 268 | 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 | 262 | 2002 |

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 | 258 | 1999 |

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 | 242 | 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 | 235 | 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 | 228 | 2000 |

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 | 223 | 2016 |