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

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

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

On the Construction of Pseudorandom Permutations: Luby—Rackoff Revisited M Naor, O Reingold Journal of Cryptology 12 (1), 29-66, 1999 | 461 | 1999 |

Priced oblivious transfer: How to sell digital goods B Aiello, Y Ishai, O Reingold International Conference on the Theory and Applications of Cryptographic …, 2001 | 446 | 2001 |

Keyword search and oblivious pseudorandom functions MJ Freedman, Y Ishai, B Pinkas, O Reingold Theory of Cryptography Conference, 303-324, 2005 | 341 | 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 | 322 | 2009 |

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

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 | 240 | 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 | 236 | 2015 |

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 | 231 | 2002 |

Extracting all the randomness and reducing the error in Trevisan's extractors R Raz, O Reingold, S Vadhan Journal of Computer and System Sciences 65 (1), 97-128, 2002 | 222 | 2002 |

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 | 208 | 1998 |

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

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 | 200 | 2000 |

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 | 191* | 2003 |

Distributed pseudo-random functions and KDCs M Naor, B Pinkas, O Reingold International Conference on the Theory and Applications of Cryptographic …, 1999 | 187 | 1999 |

Just fast keying: Key agreement in a hostile internet W Aiello, SM Bellovin, M Blaze, R Canetti, J Ioannidis, AD Keromytis, ... ACM Transactions on Information and System Security (TISSEC) 7 (2), 242-273, 2004 | 169 | 2004 |

The limits of two-party differential privacy A McGregor, I Mironov, T Pitassi, O Reingold, K Talwar, S Vadhan 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 81-90, 2010 | 165 | 2010 |