Rafail Ostrovsky

Affiliations: 
Computer Science University of California, Los Angeles, Los Angeles, CA 
Area:
theory of computation; cryptography and security; distributed algorithms; high-dimensional search; routing and flow control in communication networks
Google:
"Rafail Ostrovsky"
Cross-listing: Computer Science Tree

Parents

Sign in to add mentor
Silvio Micali grad student 1992 (Computer Science Tree)

Children

Sign in to add trainee
Shailesh Vaya grad student 2006 UCLA
William E. Skeith grad student 2007 UCLA
Vipul Goyal grad student 2009 UCLA
Steve N. Lu grad student 2009 UCLA
Paul H. Bunn grad student 2010 UCLA
Brett Hemenway grad student 2010 UCLA
Ryan Moriarty grad student 2010 UCLA
Omkant Pandey grad student 2010 UCLA
Vladimir Braverman grad student 2011 UCLA
Nishanth Chandran grad student 2011 UCLA
Michael Shindler grad student 2011 UCLA
Joshua W. Baron grad student 2012 UCLA
Abhishek Jain grad student 2012 UCLA
Hakan A. Seyalioglu grad student 2012 UCLA
Chongwon Cho grad student 2013 UCLA
Sanjam Garg grad student 2013 UCLA
Clinton A. Givens grad student 2013 UCLA
Chen-Kuei Lee grad student 2013 UCLA
Ran Gelles grad student 2014 UCLA
Silas I. Richelson grad student 2014 UCLA
Alan J. Roytman grad student 2014 UCLA
Akshay Wadia grad student 2014 UCLA
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Khamsemanan N, Ostrovsky R, Skeith WE. (2016) On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols Siam Journal On Discrete Mathematics. 30: 266-295
Damgård I, Nielsen JB, Ostrovsky R, et al. (2016) Unconditionally secure computation with reduced interaction Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9666: 420-447
Hemenway B, Ostrovsky R, Richelson S, et al. (2016) Adaptive security with quasi-optimal rate Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9562: 525-541
Ishai Y, Kushilevitz E, Lu S, et al. (2016) Private large-scale databases with distributed Searchable symmetric encryption Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9610: 90-107
Felber D, Ostrovsky R. (2015) A randomized online quantile summary in O(1/∈ log 1/∈) words Leibniz International Proceedings in Informatics, Lipics. 40: 775-785
Braverman V, Ostrovsky R, Roytman A. (2015) Zero-one laws for sliding windows and universal sketches Leibniz International Proceedings in Informatics, Lipics. 40: 573-590
Ostrovsky R, Rosenbaum W. (2015) Fast distributed almost stable matchings Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 2015: 101-108
Garg S, Lu S, Ostrovsky R, et al. (2015) Garbled RAM from one-way functions Proceedings of the Annual Acm Symposium On Theory of Computing. 14: 449-458
Franklin M, Gelles R, Ostrovsky R, et al. (2015) Optimal coding for streaming authentication and interactive communication Ieee Transactions On Information Theory. 61: 133-145
Garg S, Lu S, Ostrovsky R. (2015) Black-Box Garbled RAM Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2015: 210-229
See more...