Academic Appointments


All Publications


  • Incremental Deterministic Public-Key Encryption JOURNAL OF CRYPTOLOGY Mironov, I., Pandey, O., Reingold, O., Segev, G. 2018; 31 (1): 134–61
  • Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity Chattopadhyay, E., Hatami, P., Reingold, O., Tal, A., Diakonikolas, Kempe, D., Henzinger, M. ASSOC COMPUTING MACHINERY. 2018: 363–75
  • Fairness Through Computationally-Bounded Awareness Kim, M. P., Reingold, O., Rothblum, G. N., Bengio, S., Wallach, H., Larochelle, H., Grauman, K., CesaBianchi, N., Garnett, R. NEURAL INFORMATION PROCESSING SYSTEMS (NIPS). 2018
  • Guilt-Free Data Reuse COMMUNICATIONS OF THE ACM Dwork, C., Feldman, V., Hardt, M., Pitassi, T., Reingold, O., Roth, A. 2017; 60 (4): 86-93

    View details for DOI 10.1145/3051088

    View details for Web of Science ID 000398920900029

  • Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space Murtagh, J., Reingold, O., Sidford, A., Vadhan, S., IEEE IEEE. 2017: 801–12
  • FINDING COLLISIONS IN INTERACTIVE PROTOCOLS-TIGHT LOWER BOUNDS ON THE ROUND AND COMMUNICATION COMPLEXITIES OF STATISTICALLY HIDING COMMITMENTS SIAM JOURNAL ON COMPUTING Haitner, I., Hoch, J. J., Reingold, O., Segev, G. 2015; 44 (1): 193-242

    View details for DOI 10.1137/130938438

    View details for Web of Science ID 000353967100007

  • BALLS AND BINS: SMALLER HASH FAMILIES AND FASTER EVALUATION SIAM JOURNAL ON COMPUTING Celis, L. E., Reingold, O., Segev, G., Wieder, U. 2013; 42 (3): 1030-1050

    View details for DOI 10.1137/120871626

    View details for Web of Science ID 000323888700009

  • Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring INFORMATION PROCESSING LETTERS Biham, E., Boneh, D., Reingold, O. 1999; 70 (2): 83-87