Rafail Ostrovsky

About

Rafail Ostrovsky holds the Norman E. Friedman Chair in Knowledge Sciences at UCLA Samueli School of Engineering. He is a distinguished professor of computer science and mathematics at UCLA. His research focuses on the theory of computation, cryptography and security, distributed algorithms, high-dimensional search, routing and flow control in communication networks, and cybersecurity and the future internet. Ostrovsky has authored over 350 refereed publications and holds 15 issued patents. He has served as chair of the IEEE Technical Committee on Mathematical Foundations of Computing and has been involved in numerous international conference programs and editorial boards. His work has earned him multiple awards, including the IEEE Computer Society Edward J. McCluskey Technical Achievement Award, the RSA Award for Excellence in Mathematics, and the W. Wallace McDowell Award, the highest award given by the IEEE Computer Society. He is a Fellow of the AAAS, ACM, IEEE, and IACR, and a foreign member of Academia Europaea.

Research topics

• Computer Science
• Artificial Intelligence
• Computer Security
• Theoretical computer science
• Programming language
• Discrete mathematics
• Mathematics
• Computer network
• Distributed computing
• Operating system

Selected publications

• ATLAS: Efficient and Scalable MPC in the Honest Majority Setting

  Lecture notes in computer science · 2021 · 50 citations

  DOI

• Efficient 3-Party Distributed ORAM

  Lecture notes in computer science · 2020 · 40 citations

  Senior authorCorresponding
  DOI

• Improving Line-Point Zero Knowledge

  Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security · 2022-11-07 · 30 citations

  articleSenior author

  Recent advances in fast protocols for vector oblivious linear evaluation (VOLE) have inspired a family of new VOLE-based lightweight designated-verifier NIZK protocols (Weng et al., S&P 2021, Baum et al., Crypto 2021, Dittmer et al., ITC 2021, Yang et al., CCS 2021). In particular, the Line-Point Zero Knowledge (LPZK) protocol of Dittmer et al. has the advantage of being entirely non-cryptographic given a single instance of a random VOLE correlation.

  PublisherDOI

• Succinct Non-Interactive Arguments via Linear Interactive Proofs

  Journal of Cryptology · 2022 · 21 citations

  Abstract Succinct non-interactive arguments (SNARGs) enable verifying NP statements with lower complexity than required for classical NP verification. Traditionally, the focus has been on minimizing the length of such arguments; nowadays, researchers have focused also on minimizing verification time, by drawing motivation from the problem of delegating computation. A common relaxation is a preprocessing SNARG, which allows the verifier to conduct an expensive offline phase that is independent of…

  PublisherOA PDFDOI

• PSI from Ring-OLE

  Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security · 2022-11-07 · 19 citations

  articleSenior author

  Private set intersection (PSI) is one of the most extensively studied instances of secure computation. PSI allows two parties to compute the intersection of their input sets without revealing anything else. Other useful variants include PSI-Payload, where the output includes payloads associated with members of the intersection, and PSI-Sum, where the output includes the sum of the payloads instead of individual ones.

  PublisherDOI

Recent grants

• NSFSaTC-BSF: TWC: Small: Cryptography and Communication Complexity

  NSF · $508k · 2016–2020

• TC: Small: Towards Resettable & Statistical Security in Zero Knowledge

  NSF · $568k · 2011–2015

• An In-Depth Study of Homomorphic Encryption in Cryptography

  NSF · $1.1M · 2008–2012

Frequent coauthors

• Brett Hemenway

  55 shared

• Ivan Visconti

  Sapienza University of Rome

  55 shared

• Eyal Kushilevitz

  Technion – Israel Institute of Technology

  52 shared

• Yuval Ishai

  48 shared

• Amit Sahai

  44 shared

• Steve Lu

  42 shared

• Nishanth Chandran

  35 shared

• Juan A. Garay

  33 shared

Education

• Ph.D., Computer Science

  University of California, Los Angeles

  1990

• M.S., Computer Science

  University of California, Los Angeles

  1986

• B.S., Computer Science

  University of California, Los Angeles

  1984

Awards & honors

• Henry Taub Prize (1993)
• IEEE Computer Society Edward J. McCluskey Technical Achievem…
• RSA Award for Excellence in Mathematics (2018)
• W. Wallace McDowell Award (2022)
• Norman E. Friedmann Chair (2022)

Similar researchers at University of California, Los Angeles

• Demetri Terzopoulosh-93
• Wei Wangh-91
• Eleazar Eskinh-83