Følg
Rafail Ostrovsky
Rafail Ostrovsky
Norman E. Friedman Chair in Knowledge Sciences, Distinguished Prof. of CS & MATH
Verifisert e-postadresse på cs.ucla.edu - Startside
Tittel
Sitert av
Sitert av
År
Public key encryption with keyword search
D Boneh, G Di Crescenzo, R Ostrovsky, G Persiano
International conference on the theory and applications of cryptographic …, 2004
44612004
Fuzzy extractors: How to generate strong keys from biometrics and other noisy data
Y Dodis, R Ostrovsky, L Reyzin, A Smith
SIAM journal on computing 38 (1), 97-139, 2008
4436*2008
Searchable symmetric encryption: improved definitions and efficient constructions
R Curtmola, J Garay, S Kamara, R Ostrovsky
Proceedings of the 13th ACM conference on Computer and communications …, 2006
35152006
Software protection and simulation on oblivious RAMs
O Goldreich, R Ostrovsky
Journal of the ACM (JACM) 43 (3), 431-473, 1996
22121996
Attribute-based encryption with non-monotonic access structures
R Ostrovsky, A Sahai, B Waters
Proceedings of the 14th ACM conference on Computer and communications …, 2007
15792007
Replication is not needed: Single database, computationally-private information retrieval
E Kushilevitz, R Ostrovsky
Proceedings 38th annual symposium on foundations of computer science, 364-373, 1997
13801997
Universally composable two-party and multi-party secure computation
R Canetti, Y Lindell, R Ostrovsky, A Sahai
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
9762002
How to withstand mobile virus attacks
R Ostrovsky, M Yung
Proceedings of the tenth annual ACM symposium on Principles of distributed …, 1991
8181991
Efficient search for approximate nearest neighbor in high dimensional spaces
E Kushilevitz, R Ostrovsky, Y Rabani
SIAM Journal on Computing 30 (2), 457-474, 2000
7202000
The effectiveness of lloyd-type methods for the k-means problem
R Ostrovsky, Y Rabani, LJ Schulman, C Swamy
Journal of the ACM (JACM) 59 (6), 28, 2012
6352012
Deniable encryption
R Canetti, C Dwork, M Naor, R Ostrovsky
Advances in Cryptology—CRYPTO'97: 17th Annual International Cryptology …, 1997
5951997
Efficient password-authenticated key exchange using human-memorable passwords
J Katz, R Ostrovsky, M Yung
International Conference on the Theory and Applications of Cryptographic …, 2001
5872001
Zero-knowledge from secure multiparty computation
Y Ishai, E Kushilevitz, R Ostrovsky, A Sahai
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
5622007
Perfect noninteractive zero-knowledge for NP
J Groth, R Ostrovsky, A Sahai
4932005
Sequential aggregate signatures and multisignatures without random oracles
S Lu, R Ostrovsky, A Sahai, H Shacham, B Waters
Advances in Cryptology-EUROCRYPT 2006: 24th Annual International Conference …, 2006
4812006
Succinct non-interactive arguments via linear interactive proofs
N Bitansky, A Chiesa, Y Ishai, R Ostrovsky, O Paneth
Theory of Cryptography, 315-333, 2013
454*2013
Robust non-interactive zero knowledge
A De Santis, G Di Crescenzo, R Ostrovsky, G Persiano, A Sahai
Advances in Cryptology—CRYPTO 2001: 21st Annual International Cryptology …, 2001
4052001
A survey of single-database private information retrieval: Techniques and applications
R Ostrovsky, WE Skeith III
International Workshop on Public Key Cryptography, 393-411, 2007
3982007
Public key encryption that allows PIR queries
D Boneh, E Kushilevitz, R Ostrovsky, WE Skeith III
Annual International Cryptology Conference, 50-67, 2007
3742007
Efficient computation on oblivious RAMs
R Ostrovsky
Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990
3681990
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–20