| 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 | 4666* | 2008 |
| 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 | 4517 | 2004 |
| 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 | 3635 | 2006 |
| Software protection and simulation on oblivious RAMs O Goldreich, R Ostrovsky Journal of the ACM (JACM) 43 (3), 431-473, 1996 | 2322 | 1996 |
| 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 | 1594 | 2007 |
| 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 | 1455 | 1997 |
| 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 | 1030 | 2002 |
| How to withstand mobile virus attacks R Ostrovsky, M Yung Proceedings of the tenth annual ACM symposium on Principles of distributed …, 1991 | 834 | 1991 |
| 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 | 747 | 2000 |
| 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 | 666 | 2012 |
| 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 | 654 | 2007 |
| Deniable encryption R Canetti, C Dwork, M Naor, R Ostrovsky Annual International Cryptology Conference, 90-104, 1997 | 614 | 1997 |
| 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 | 590 | 2001 |
| Perfect noninteractive zero-knowledge for NP J Groth, R Ostrovsky, A Sahai | 523 | 2005 |
| Succinct non-interactive arguments via linear interactive proofs N Bitansky, A Chiesa, Y Ishai, R Ostrovsky, O Paneth Theory of Cryptography, 315-333, 2013 | 500 | 2013 |
| Sequential aggregate signatures and multisignatures without random oracles S Lu, R Ostrovsky, A Sahai, H Shacham, B Waters Annual international conference on the theory and applications of …, 2006 | 494 | 2006 |
| 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 | 426 | 2007 |
| Robust non-interactive zero knowledge A De Santis, G Di Crescenzo, R Ostrovsky, G Persiano, A Sahai Annual International Cryptology Conference, 566-598, 2001 | 425 | 2001 |
| Efficient computation on oblivious RAMs R Ostrovsky Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990 | 382 | 1990 |
| Circular-secure encryption from decision diffie-hellman D Boneh, S Halevi, M Hamburg, R Ostrovsky Annual International Cryptology Conference, 108-125, 2008 | 372 | 2008 |
Eyal KushilevitzComputer Science Department, TechnionVerified email at cs.technion.ac.il
