Rafail Ostrovsky

UCLA Health — United States

Computer Science · Physical Sciences

71h-index28.6kcitations524works1.82yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Cryptography and Data Security(378), Complexity and Algorithms in Graphs(211), Privacy-Preserving Technologies in Data(123), Cryptographic Implementations and Security(82), Distributed systems and fault tolerance(49)

Publications524 total

Universally Composable Almost-Everywhere Secure Computation
Journal of Cryptology·2026· 2 citedOpen Access
Fast Networks for High-Performance Distributed Trust
arXiv (Cornell University)·2025Open Access
Budget and Profit Approximations for Spanning Tree Interdiction
arXiv (Cornell University)·2025Open Access
Game of Trust: How Trustworthy Does Your Blockchain Think You Are?
arXiv (Cornell University)·2025Open Access
Multi-Server Oblivious RAM
2025· 7 cited
Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions
Lecture notes in computer science·2025· 1 cited
Zero-Knowledge RAM: Doubly Efficient and Black-Box
Lecture notes in computer science·2025· 2 cited
Multiparty Garbling from OT with Linear Scaling and RAM Support
Lecture notes in computer science·2025· 1 cited
Query-Reusable Proof Systems
Lecture notes in computer science·2025
Towards Building Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing
Lecture notes in computer science·2025· 1 cited
Black-Box Constant-Round Secure 2PC with Succinct Communication
Lecture notes in computer science·2025· 2 cited
Dishonest Majority Constant-Round MPC with Linear Communication from DDH
Lecture notes in computer science·2024· 7 cited
Adaptive Security, Erasures, and Network Assumptions in Communication-Local MPC
Lecture notes in computer science·2024
Boosting the Performance of High-Assurance Cryptography: Parallel Execution and Optimizing Memory Access in Formally-Verified Line-Point Zero-Knowledge
2023· 5 cited
Linear-time 2-party secure merge from additively homomorphic encryption
Journal of Computer and System Sciences·2023· 4 cited
List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing
Lecture notes in computer science·2023· 4 citedOpen Access
Trapdoor Hash Functions and Their Applications
IACR Cryptology ePrint Archive·2023Open Access
DORAM Revisited: Maliciously Secure RAM-MPC with Logarithmic Overhead
Lecture notes in computer science·2023· 4 citedOpen Access
Anonymous Permutation Routing
Lecture notes in computer science·2023Open Access
Tri-State Circuits
Lecture notes in computer science·2023· 7 cited
page 1 of 27Next →

Frequent Co-authors

Amit Sahai(13), Eyal Kushilevitz(12), Yuval Ishai(9), Giovanni Di Crescenzo(5), Jonathan Katz(4), Steve Lu(4), Yuval Rabani(4), Dan Boneh(3), Adam Smith(3), Reza Curtmola(3), Juan A. Garay(3), Seny Kamara(3), Moti Yung(3), Jens Groth(3), William E. Skeith(3), Giuseppe Persiano(2), Yevgeniy Dodis(2), Brent Waters(2), Ran Canetti(2), Leonard J. Schulman(2)