Rafail Ostrovsky

Rafail Ostrovsky (born 1963) is a Professor of Computer Science and Mathematics at UCLA and a well-known researcher in Algorithms and Cryptography. Prof. 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 [http://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/] .Prof. Ostrovsky is a winner of the 2006 IBM Faculty Award; the 2006 and 2005 Xerox Innovation Group Award; the 2004 OKAWA Research Award; the 1993 Henry Taub Prize; 1996 Bellcore prize for excellence in research; and three-time winner of the best published work of the year (1999, 2001, 2002) at SAIC in computer science and mathematics. Some notable achievements of Prof. Ostrovsky 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 Arguments for NP based on any One way function (see [http://www.cs.ucla.edu/~rafail/PUBLIC/10.html NOVY] and [http://eccc.hpi-web.de/eccc-reports/2006/TR06-075/index.html NOV] ).
* 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] ) or over 230 citations in [http://scholar.google.com/scholar?hl=en&lr=&cluster=16876204603976795719 Google Scholar] )
* 1992 Proved the existence of asymptotically-optimal [http://www.cs.ucla.edu/~rafail/PUBLIC/09.html "software protection"] scheme (later renamed "searching on encrypted data") assuming the existence of Tamper-resistant Microprocessor
* 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 Invented (with E. Kushilevitz) the first single server Private Information Retrieval protocol [http://www.cs.ucla.edu/~rafail/PUBLIC/34.html] (see over 220 citations in [http://scholar.google.com/scholar?hl=en&lr=&cluster=18241228131050222006 Google Scholar] ).
* 1997 Showed (with E. Kushilevitz and Y. Rabani) (1+ε) poly-time and poly-size approximate-NNS for high-dimensional data for L1-Norm and Euclidian space (see over 180 citations in [http://scholar.google.com/scholar?hl=en&lr=&cluster=3582393584382162472 Google Scholar] ).

External links

* [http://www.cs.ucla.edu/~rafail/ Professor Ostrovsky's home page]
* [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/o/Ostrovsky:Rafail.html Some of Ostrovsky's publications]