Rafail M. Ostrovsky
Artificial Intelligence · 1996–2019
A researcher in the Science corpus: 20 papers; trusts 64 researchers and is trusted by 205 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 147 citations into it; #2,402 of 36,961 by trust here, #2,549 by citations
- Computational Theory and Mathematics — 80 citations into it; #857 of 12,489 by trust here, #839 by citations
- Computer Networks and Communications — 64 citations into it; #212 of 9,996 by trust here, #518 by citations
- Information Systems — 53 citations into it; #202 of 9,233 by trust here, #479 by citations
- Privacy & Security — 40 citations into it; #53 of 710 by trust here, #118 by citations
- Computer Vision and Pattern Recognition — 26 citations into it; #3,733 of 21,973 by trust here, #2,983 by citations
- Algorithms & Complexity — 17 citations into it
- Atomic and Molecular Physics, and Optics — 11 citations into it; #120 of 7,158 by trust here, #1,505 by citations
Whom Rafail M. Ostrovsky trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Dan Boneh
- Silvio Micali
- Shafi Goldwasser
- Ran Canetti
- Ivan Bjerre Damgård
- Benny Chor
- Eyal Kushilevitz
- Oded Goldreich
- Amit Sahai
- Craig Gentry
Who trusts Rafail M. Ostrovsky overall
- Dan Boneh
- Yuval Ishai
- Elaine Shi
- Raphael Bost
- Brent Waters
- Emil Stefanov
- Seny Kamara
- O. Ohrimenko
- Lei Yang
- Niv Gilboa
Papers from Rafail M. Ostrovsky's perspective
Ordered by how strongly the researchers Rafail M. Ostrovsky trusts endorse each paper. Same corpus, a different order for every researcher.
- New Directions in Cryptography
- Replication is not needed: single database, computationally-private information retrieval
- Probabilistic Encryption
- A method for obtaining digital signatures and public-key cryptosystems
- Random oracles are practical: a paradigm for designing efficient protocols
- How to share a secret
- Short Signatures from the Weil Pairing
- Protocols for secure computations
- Security and Composition of Multiparty Cryptographic Protocols (Journal of Cryptology)
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Their papers
- The Effectiveness of Lloyd-Type Methods for the k-Means Problem (2006) — 529 citations
- Efficient Arguments without Short PCPs (2007) — 137 citations
- Attribute-based encryption with non-monotonic access structures (2007) — 1,228 citations
- Non-interactive Zaps and New Techniques for NIZK (2006) — 218 citations
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority (2012) — 120 citations
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles (2006) — 355 citations
- Zero-knowledge from secure multiparty computation (2007) — 478 citations
- Batch codes and their applications (2004) — 286 citations
- Private Anonymous Data Access (2019) — 33 citations
- Public Key Encryption That Allows PIR Queries (2007) — 307 citations
- Cryptography from Anonymity (2006) — 168 citations
- Searchable symmetric encryption: Improved definitions and efficient constructions (2006) — 2,852 citations
- Private Searching on Streaming Data (2005) — 258 citations
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data (2004) — 3,285 citations
- Public Key Encryption with Keyword Search (2004) — 3,500 citations
- Universally composable two-party and multi-party secure computation (2002) — 791 citations
- Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords (2001) — 440 citations
- Replication is not needed: single database, computationally-private information retrieval (1997)
- Software protection and simulation on oblivious RAMs (1996)
- Universally Composable Two-Party and Multi-party Secure Computation