Rafail Ostrovsky Bio
Rafail Ostrovsky - Bio and Professional Interests
Research Interests: All aspects of theory of computation, especially in
cryptography, network algorithms, analysis and classification of high-dimensional data.
Examples of topics include
interactive passwords, fault-tolerance, multi-party computation, zero-knowledge,
algorithms for
high-dimensional geometric problems such as clustering and
nearest-neighbor search, metric embeddings and routing and flow control in communication
networks.
You can also read a somewhat outdated
CV
.
Ph.D.:
MIT, Computer Science, 1992.
Short Bio:
Dr. Rafail Ostrovsky is a Professor of
Computer Science and Mathematics at UCLA.
Prof. Ostrovsky came to UCLA in 2003 from Telcordia Technologies (previously Bell
Communications Research), where he was a senior research scientist in
the Math Sciences Research Center.
Prior to beginning his career at
Telcordia, he was an NSF Mathematical Sciences Postdoctoral Fellow at UC Berkeley.
Dr. Ostrovsky received his
Ph.D. in computer science from
MIT,
in the Theory of Computation
Group of Laboratory
for Computer Science in 1992.
Dr. Ostrovsky's research centers on various
issues in theoretical computer science, including
cryptography, network and distributed algorithms, and high-dimensional search
problems.
He has 8 U.S. patents issued and over 100 papers published in refereed journals and conferences.
He is a member of the Editorial Board of
Algorithmica; and the Editorial Board of
Journal of Cryptology;
he serves on the Editorial
and Advisory Board of the
International Journal of Information and Computer Security and
is a member of the steering committee of the
international symposium of Security in Communication Networks (SCN).
He was the Plenary Invited Speaker for Public Key Cryptography International Conference, 2007. He is the winner of
2007 and 2004 NSF CyberTrust Research Award;
2006 and 2005 Xerox Corporate Innovation Faculty Award;
2006 IBM Faculty Award;
2006 Xerox Corporation Distinguished Lecture Series invited speaker;
2005 Distinguished Cryptographer of the Year Lecture Series NTT Labs, Japan;
OKAWA Foundation 2004 Research Award;
the 1993 Henry Taub Prize; the 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 (SAIC is Telcordia's
parent company with over 40,000 engineers and scientists).
At UCLA, Professor Ostrovsky
heads security and cryptography multi-disciplinary
Research Center (http://www.cs.ucla.edu/security/) at Henry Samueli
School of Engineering and Applied Science.