Academic Appointments


All Publications


  • 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