Rafail Ostrovsky
{{Short description|American cryptographer (born 1963)}}
{{Multiple issues|
{{BLP sources|date=October 2021}}
{{External links|date=October 2021}}
}}
{{Infobox scientist
| name = Rafail Ostrovsky
| image = Rafail Ostrovsky.jpg
| birth_date = {{birth year and age|1963}}
| death_date =
| nationality = American
| fields = Algorithms and cryptography
| workplaces = UCLA
| alma_mater = MIT
| thesis_title = Software Protection and Simulation on Oblivious RAMs
| thesis_year = 1992
| thesis_url = http://web.cs.ucla.edu/~rafail/PUBLIC/09.pdf
| doctoral_advisor = Silvio Micali
| doctoral_students = {{Plainlist|
}}
| known_for =
| awards =
| website = {{URL|http://www.cs.ucla.edu/~rafail/}}
}}
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
[http://www.cs.northwestern.edu/~kao/Algorithmica_Editors.htm], Editorial Board of Journal of Cryptology [https://www.springer.com/west/home/computer/foundations?SGWID=4-156-70-1009426-detailsPage=journal|editorialBoard] and Editorial and Advisory Board of the International Journal of Information and Computer Security [http://www.icebnet.org/IJICS/].
Awards
- 2022 W. Wallace McDowell Award{{citation|url=https://www.computer.org/volunteering/awards/mcdowell|title=W. Wallace McDowell Award|date=6 April 2018 |publisher=IEEE}} "for visionary contributions to computer security theory and practice, including foreseeing new cloud vulnerabilities and then pioneering corresponding novel solutions"
- 2021 AAAS Fellow{{citation|url=https://www.science.org/doi/10.1126/science.ada0325|title=2021 AAAS Fellows approved by the AAAS Council|publisher=aaas.org|doi=10.1126/science.ada0325 |journal=Science |date=2022 |volume=375 |issue=6579 |pages=393–397 |bibcode=2022Sci...375..393. |url-access=subscription }}
- 2021 Fellow of the Association for Computing Machinery{{citation|url=https://www.acm.org/media-center/2022/january/fellows-2021|title=ACM Names 71 Fellows for Computing Advances that are Driving Innovation|publisher=ACM|date=January 19, 2022}} "for contributions to the foundations of cryptography"
- 2019 Academia Europaea Foreign Member {{citation|url=https://www.ae-info.org/ae/Acad_Main/List_of_Members|title=The Academy of Europe}}
- 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 {{citation|url=https://www.computer.org/volunteering/awards/technical-achievement|title=IEEE Technical Achievement Award|date=9 April 2018 |publisher=IEEE}} "for outstanding contributions to cryptographic protocols and systems, enhancing the scope of cryptographic applications and of assured cryptographic security."
- 2017 IEEE Fellow,{{citation|url=https://services27.ieee.org/fellowsdirectory/home.html|title= IEEE Fellows Directory|publisher=IEEE}} "for contributions to cryptography”
- 2013 IACR Fellow "for numerous contributions to the scientific foundations of cryptography and for sustained educational leadership in cryptography" {{citation|url=https://www.iacr.org/fellows/2013/ostrovsky.html|title=IACR Fellows|publisher=IACR}}
- 1993 Henry Taub Prize
Publications
Some of Ostrovsky's contributions to computer science include:
- 1990 Introduced (with R. Venkatesan and M. Yung) the notion of [http://www.cs.ucla.edu/~rafail/PUBLIC/07.html interactive hashing] proved essential for constructing statistical zero-knowledge proofs for NP based on any one-way function (see [http://www.cs.ucla.edu/~rafail/PUBLIC/10.html NOVY] and {{ECCC|2006|06|075}}).
- 1991 Introduced (with M. Yung) the notion of [http://www.cs.ucla.edu/~rafail/PUBLIC/05.html mobile adversary] (later renamed proactive security) (see survey of Goldwasser [http://theory.lcs.mit.edu/~cis/pubs/shafi/1997-podc.pdf]
- 1990 Introduced the first poly-logarithmic Oblivious RAM [http://www.cs.ucla.edu/~rafail/PUBLIC/09.html (ORAM)] scheme.
- 1993 Proved (with A. Wigderson) equivalence of one-way functions and zero-knowledge [http://www.cs.ucla.edu/~rafail/PUBLIC/14.html].
- 1996 Introduced (with R. Canetti, C. Dwork and M. Naor) the notion of deniable encryption [http://www.cs.ucla.edu/~rafail/PUBLIC/29.html].
- 1997 Introduced (with E. Kushilevitz) the first single server private information retrieval scheme [http://www.cs.ucla.edu/~rafail/PUBLIC/34.html] .
- 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
{{Reflist}}
External links
- [http://www.cs.ucla.edu/~rafail/ Ostrovsky's home page]
- [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/o/Ostrovsky:Rafail.html Some of Ostrovsky's publications]
{{authority control}}
{{DEFAULTSORT:Ostrovsky, Rafail}}
Category:Jewish American scientists
Category:Modern cryptographers
Category:American theoretical computer scientists
Category:American computer security academics
Category:American cryptographers
Category:University of California, Los Angeles faculty