World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
88
Citations
40000
World Ranking
669
National Ranking
358

Research.com Recognitions

  • 2022 - W. Wallace McDowell Award, IEEE Computer Society For visionary contributions to computer security theory and practice, including foreseeing new cloud vulnerabilities and then pioneering corresponding novel solutions.
  • 2019 - Member of Academia Europaea
  • 2017 - Edward J. McCluskey Technical Achievement Award, IEEE Computer Society For outstanding contributions to cryptographic protocols and systems, enhancing the scope of cryptographic applications and of assured cryptographic security
  • 2017 - IEEE Fellow For contributions to cryptography

Overview

Rafail Ostrovsky is affiliated with the University of California, Los Angeles in the United States. Their research spans primarily the field of Computer Science with a focus on several subfields including Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Information Systems, and Electrical and Electronic Engineering.

Their main topics of work include:

  • Cryptography and Data Security
  • Complexity and Algorithms in Graphs
  • Privacy-Preserving Technologies in Data
  • Cryptographic Implementations and Security
  • Internet Traffic Analysis and Secure E-voting
  • Blockchain Technology Applications and Security
  • Distributed systems and fault tolerance

Notable recent papers authored or co-authored by Ostrovsky are:

  • Improving Line-Point Zero Knowledge, 2022, Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
  • Line-Point Zero Knowledge and Its Applications, 2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Succinct Non-Interactive Arguments via Linear Interactive Proofs, 2022, Journal of Cryptology
  • PSI from Ring-OLE, 2022, Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
  • Function Secret Sharing for PSI-CA:With Applications to Private Contact Tracing, 2020, arXiv (Cornell University)

Frequently publishing venues for Ostrovsky include:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Lecture notes in computer science
  • Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
  • Journal of Cryptology

Frequent collaborators in their research are:

  • Yuval Ishai
  • Michele Ciampi
  • Vassilis Zikas
  • Brett Hemenway
  • Vipul Goyal

Ostrovsky has contributed to scholarly books, including a contribution published by Springer Science+Business Media titled Cyber Security, Cryptology, and Machine Learning (2022).

Awards received by Ostrovsky comprise:

  • W. Wallace McDowell Award, IEEE Computer Society (2022) for visionary contributions to computer security theory and practice, including foreseeing new cloud vulnerabilities and pioneering novel solutions
  • Member of Academia Europaea (2019)
  • IEEE Fellow (2017) for contributions to cryptography
  • Edward J. McCluskey Technical Achievement Award, IEEE Computer Society (2017) for outstanding contributions to cryptographic protocols and systems

Best Publications

  • Public Key Encryption with Keyword Search

    Dan Boneh;Giovanni Di Crescenzo;Rafail Ostrovsky;Giuseppe Persiano

  • Searchable symmetric encryption: Improved definitions and efficient constructions

    Reza Curtmola;Juan Garay;Seny Kamara;Rafail Ostrovsky

  • Software protection and simulation on oblivious RAMs

    Oded Goldreich;Rafail Ostrovsky

  • Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

    Yevgeniy Dodis;Rafail Ostrovsky;Leonid Reyzin;Adam Smith

  • Attribute-Based Encryption with Non-Monotonic Access Structures.

    Rafail Ostrovsky;Amit Sahai;Brent Waters

  • Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

    Eyal Kushilevitz;Rafail Ostrovsky;Yuval Rabani

  • Replication is not needed: single database, computationally-private information retrieval

    E. Kushilevitz;R. Ostrovsky

  • The effectiveness of lloyd-type methods for the k-means problem

    Rafail Ostrovsky;Yuval Rabani;Leonard J. Schulman;Chaitanya Swamy

  • Universally composable two-party and multi-party secure computation

    Ran Canetti;Yehuda Lindell;Rafail Ostrovsky;Amit Sahai

  • How to withstand mobile virus attacks (extended abstract)

    Rafail Ostrovsky;Moti Yung

  • Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords

    Jonathan Katz;Rafail Ostrovsky;Moti Yung

  • Deniable Encryption

    Ran Canetti;Cynthia Dwork;Moni Naor;Rafail Ostrovsky

  • Zero-knowledge from secure multiparty computation

    Yuval Ishai;Eyal Kushilevitz;Rafail Ostrovsky;Amit Sahai

  • Sequential Aggregate Signatures and Multisignatures without Random Oracles.

    Steve Lu;Rafail Ostrovsky;Amit Sahai;Hovav Shacham

  • Perfect non-interactive zero knowledge for NP

    Jens Groth;Rafail Ostrovsky;Amit Sahai

  • Robust Non-interactive Zero Knowledge

    Alfredo De Santis;Giovanni Di Crescenzo;Rafail Ostrovsky;Giuseppe Persiano

  • Succinct non-interactive arguments via linear interactive proofs

    Nir Bitansky;Alessandro Chiesa;Yuval Ishai;Omer Paneth

  • A survey of single-database private information retrieval: techniques and applications

    Rafail Ostrovsky;Iii. William E. Skeith

  • Public key encryption that allows PIR queries

    Dan Boneh;Eyal Kushilevitz;Rafail Ostrovsky;Iii. William E. Skeith

  • Efficient computation on oblivious RAMs

    R. Ostrovsky

Frequent Co-Authors

Amit Sahai
Amit Sahai University of California, Los Angeles
Eyal Kushilevitz
Eyal Kushilevitz Technion – Israel Institute of Technology
Yuval Ishai
Yuval Ishai Technion – Israel Institute of Technology
Juan A. Garay
Juan A. Garay Texas A&M University
Yuval Rabani
Yuval Rabani Hebrew University of Jerusalem
Vipul Goyal
Vipul Goyal Carnegie Mellon University
Sanjam Garg
Sanjam Garg University of California, Berkeley
Jonathan Katz
Jonathan Katz University of Maryland, College Park
Adam Smith
Adam Smith Boston University
Moti Yung
Moti Yung Columbia University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Computer Science opens doors to a wide range of career opportunities in various industries. Many students also explore related fields through flexible online programs, which can be more affordable and accessible. For those interested in public service or law enforcement, an online criminal justice degree can provide specialized knowledge and skills for future roles in criminal investigation or public safety.

Individuals with a passion for numbers and finance often consider an accounting degree online cheap, which can prepare them for lucrative accounting or auditing positions. If data and analytics are of interest, the best data science master's programs offer advanced training in AI, machine learning, and big data, complementing a background in Computer Science.

Finally, tech-driven roles are growing in sectors like construction, where a 2 year construction management degree can lead to careers in project management or site supervision, connecting technology with practical, real-world applications. Exploring these online degrees provides versatility and increases career prospects for tech-focused learners.

Best Scientists Citing Rafail Ostrovsky

Trending Scientists

Recently Published Articles