Rafail Ostrovsky

Rafail Ostrovsky is a distinguished professor of computer science and mathematics at UCLA and a well-known researcher in algorithms and cryptography.

Biography

Rafail Ostrovsky received his Ph.D. from MIT in 1992.

He is a member of the editorial board of Algorithmica [1], Editorial Board of Journal of Cryptology [2] and Editorial and Advisory Board of the International Journal of Information and Computer Security [3].

Awards

• 2022 W. Wallace McDowell Award "for visionary contributions to computer security theory and practice, including foreseeing new cloud vulnerabilities and then pioneering corresponding novel solutions"
• 2021 AAAS Fellow
• 2021 Fellow of the Association for Computing Machinery "for contributions to the foundations of cryptography"
• 2019 Academia Europaea Foreign Member
• 2018 RSA Award for Excellence in Mathematics "for contributions to the theory and to new variants of secure multi-party computations"
• 2017 IEEE Edward J. McCluskey Technical Achievement Award "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”
• 2013 IACR Fellow "for numerous contributions to the scientific foundations of cryptography and for sustained educational leadership in cryptography"
• 1993 Henry Taub Prize

Publications

Some of Ostrovsky's contributions to computer science include:

• 1990 Introduced (with R. Venkatesan and M. Yung) the notion ofhttps://services27.ieee.org/fellowsdirectory/home.html interactive hashing proved essential for constructing statistical zero-knowledge proofs for NP based on any one-way function (see NOVY and ECCC TR06-075).
• 1991 Introduced (with M. Yung) the notion of mobile adversary (later renamed proactive security) (see survey of Goldwasser [4]
• 1990 Introduced the first poly-logarithmic Oblivious RAM (ORAM) scheme.
• 1993 Proved (with A. Wigderson) equivalence ofone-way functions and zero-knowledge [5].
• 1996 Introduced (with R. Canetti, C. Dwork and M. Naor) the notion of deniable encryption [6].
• 1997 Introduced (with E. Kushilevitz) the first single server private information retrieval scheme [7] .
• 1997 Showed (with E. Kushilevitz and Y. Rabani) (1+ε) poly-time and poly-size approximate-nearest neighbor search for high-dimensional data for L1-norm and Euclidean space.

References

External links

• Ostrovsky's home page
• Some of Ostrovsky's publications

1. Deniable encryption
2. K-means++
3. Private information retrieval
4. Silvio Micali
5. Oblivious RAM
6. Non-interactive zero-knowledge proof
7. Oblivious transfer
8. Ostrovsky (surname)
9. List of cryptographers
10. Jonathan Katz (computer scientist)
11. Symposium on Foundations of Computer Science
12. Secure multi-party computation
13. Amit Sahai
14. Proactive secret sharing
15. International Association for Cryptologic Research
16. Commitment scheme
17. List of people by Erdős number
18. Seny Kamara
19. Locally decodable code
20. List of fellows of the Association for Computing Machinery