Rafail Ostrovsky
From Wikipedia, the free encyclopedia
Rafail Ostrovsky (1963) is a Professor of Computer Science and Mathematics Departments at UCLA and a well-known researcher in Algorithms and Cryptography. At UCLA, he also heads security and cryptography multi-disciplinary CICS center at Henry Samueli School of Engineering and Applied Science. R.Ostrovsky received his Ph.D. from MIT in 1992. He is a member of the Editorial Board of Algorithmica [1] and Editorial and Advisory Board of the International Journal of Information and Computer Security [2]. Professor Ostrovsky is a winner of the 2006 IBM Faculty Award; the 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 include:
- 1990 Introduced (with R. Venkatesan and M. Yung) the notion of interactive hashing proved essential for constructing Statistical Zero-Knowledge Arguments for NP based on any One way function (see NOVY and NOV).
- 1991 Introduced (with M. Yung) the notion of defense against Mobile adversary (later renamed proactive security) (see survey of Goldwasser [3]) or over 200 citations in Google Scholar)
- 1992 Proved the existence of asymptotically-optimal 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 for any non-trivial language.[4].
- 1996 Proved (with A. Rosen and E. Kushilevitz) equivalence of linear size circuits and cryptographically-private protocols with small use of randomness [5].
- 1996 Introduced (with R. Canetti, C. Dwork and M. Naor) the notion of Deniable Encryption [6].
- 1996 Disproved (With E. Kushilevitz and N. Linial) the Tiwari conjecture from 1984 JACM article on distributed communication complexity
- 1997 Showed (with E. Kushilevitz) the first solution to single server Private Information Retrieval [7] (see over 150 citations in Google Scholar).
- 1997 Showed (with Y. Rabani) near-optimal local-control packet routing algorithm, resolving the open problem of Leighton Maggs and Rao, 1993.
- 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 150 citations in Google Scholar).
- 1998 Showed (with G. DiCresenzo and Y. Ishai) the first non-interactive non-Malleable Commitment [8].
[edit] External links
Categories: 1963 births | Living people | Computer scientists | American computer scientists | Modern cryptographers | Computer security specialists | American academics | American cryptographers | University of California, Los Angeles faculty | Massachusetts Institute of Technology alumni | Erdős number 2
