The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rafail Ostrovsky: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joan Feigenbaum, Rafail Ostrovsky
    A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1991, pp:352-359 [Conf]
  2. Reza Curtmola, Juan A. Garay, Seny Kamara, Rafail Ostrovsky
    Searchable symmetric encryption: improved definitions and efficient constructions. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2006, pp:79-88 [Conf]
  3. Rafail Ostrovsky
    One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:133-138 [Conf]
  4. William Aiello, Sachin Lodha, Rafail Ostrovsky
    Fast Digital Identity Revocation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1998, pp:137-152 [Conf]
  5. Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky
    Deniable Encryption. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1997, pp:90-104 [Conf]
  6. Giovanni Di Crescenzo, Rafail Ostrovsky
    On Concurrent Zero-Knowledge with Pre-processing. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:485-502 [Conf]
  7. Shlomi Dolev, Rafail Ostrovsky
    Efficient Anonymous Multicast and Reception (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1997, pp:395-409 [Conf]
  8. Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky
    Minimal Complete Primitives for Secure Multi-party Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:80-100 [Conf]
  9. Shafi Goldwasser, Rafail Ostrovsky
    Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:228-245 [Conf]
  10. Joe Kilian, Silvio Micali, Rafail Ostrovsky
    Minimum Resource Zero-Knowledge Proofs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1989, pp:545-546 [Conf]
  11. Ari Juels, Michael Luby, Rafail Ostrovsky
    Security of Blind Digital Signatures (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1997, pp:150-164 [Conf]
  12. Jonathan Katz, Rafail Ostrovsky
    Round-Optimal Secure Two-Party Computation. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:335-354 [Conf]
  13. Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
    Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:196-214 [Conf]
  14. Rafail Ostrovsky
    An Efficient Software Protection Scheme. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1989, pp:610-611 [Conf]
  15. Rafail Ostrovsky, William E. Skeith III
    Private Searching on Streaming Data. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2005, pp:223-240 [Conf]
  16. Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano, Amit Sahai
    Robust Non-interactive Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:566-598 [Conf]
  17. Jens Groth, Rafail Ostrovsky, Amit Sahai
    Non-interactive Zaps and New Techniques for NIZK. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:97-111 [Conf]
  18. Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano
    Public Key Encryption with Keyword Search. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:506-522 [Conf]
  19. Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam Smith
    Secure Remote Authentication Using Biometric Data. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2005, pp:147-163 [Conf]
  20. Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith
    Efficient and Non-interactive Non-malleable Commitment. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:40-59 [Conf]
  21. Giovanni Di Crescenzo, Tal Malkin, Rafail Ostrovsky
    Single Database Private Information Retrieval Implies Oblivious Transfer. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2000, pp:122-138 [Conf]
  22. Giovanni Di Crescenzo, Rafail Ostrovsky, Sivaramakrishnan Rajagopalan
    Conditional Oblivious Transfer and Timed-Release Encryption. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1999, pp:74-89 [Conf]
  23. Jens Groth, Rafail Ostrovsky, Amit Sahai
    Perfect Non-interactive Zero Knowledge for NP. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2006, pp:339-358 [Conf]
  24. Jonathan Katz, Steven Myers, Rafail Ostrovsky
    Cryptographic Counters and Applications to Electronic Voting. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:78-92 [Conf]
  25. Jonathan Katz, Rafail Ostrovsky, Adam Smith
    Round Efficiency of Multi-party Computation with a Dishonest Majority. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2003, pp:578-595 [Conf]
  26. Jonathan Katz, Rafail Ostrovsky, Moti Yung
    Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:475-494 [Conf]
  27. Eyal Kushilevitz, Rafail Ostrovsky
    One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2000, pp:104-121 [Conf]
  28. Steve Lu, Rafail Ostrovsky, Amit Sahai, Hovav Shacham, Brent Waters
    Sequential Aggregate Signatures and Multisignatures Without Random Oracles. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2006, pp:465-485 [Conf]
  29. Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
    Interactive Hashing Simplifies Zero-Knowledge Protocol Design. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1993, pp:267-273 [Conf]
  30. Richard J. Lipton, Rafail Ostrovsky
    Micropayments via Efficient Coin-Flipping. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 1998, pp:1-15 [Conf]
  31. Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani
    Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:348-356 [Conf]
  32. Joe Kilian, Silvio Micali, Rafail Ostrovsky
    Minimum Resource Zero-Knowledge Proofs (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:474-479 [Conf]
  33. Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky
    Reducibility and Completeness in Multi-Party Private Computations [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:478-489 [Conf]
  34. Eyal Kushilevitz, Rafail Ostrovsky
    Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:364-373 [Conf]
  35. Rafail Ostrovsky, Yuval Rabani
    Polynomial Time Approximation Schemes for Geometric k-Clustering. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:349-358 [Conf]
  36. Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman
    Error-Correcting Codes for Automatic Control. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:309-316 [Conf]
  37. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
    Cryptography from Anonymity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:239-248 [Conf]
  38. Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
    The Effectiveness of Lloyd-Type Methods for the k-Means Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:165-176 [Conf]
  39. William Aiello, Sandeep N. Bhatt, Rafail Ostrovsky, Sivaramakrishnan Rajagopalan
    Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:463-474 [Conf]
  40. Rafail Ostrovsky, Charles Rackoff, Adam Smith
    Efficient Consistency Proofs for Generalized Queries on a Committed Database. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:1041-1053 [Conf]
  41. Rafail Ostrovsky
    HOLMES-I, a prolog-based reason maintenance system for collecting information from multiple experts. [Citation Graph (0, 0)][DBLP]
    IPMU, 1986, pp:329-336 [Conf]
  42. Shay Kutten, Rafail Ostrovsky, Boaz Patt-Shamir
    The Las-Vegas Processor Identity Problem (How and When to Be Unique). [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:150-159 [Conf]
  43. Rafail Ostrovsky, Avi Wigderson
    One-Way Fuctions are Essential for Non-Trivial Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:3-17 [Conf]
  44. Baruch Awerbuch, Rafail Ostrovsky
    Memory-Efficient and Self-Stabilizing Network {RESET} (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1994, pp:254-263 [Conf]
  45. Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Randomness vs. Fault-Tolerance. [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:35-44 [Conf]
  46. Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky
    Universal Service-Providers for Database Private Information Retrieval (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:91-100 [Conf]
  47. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Log-Space Polynomial End-to-End Communication (Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:254- [Conf]
  48. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Amortizing Randomness in Private Multiparty Computations. [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:81-90 [Conf]
  49. Rafail Ostrovsky, Boaz Patt-Shamir
    Optimal and Efficient Clock Synchronization Under Drifting Clocks. [Citation Graph (0, 0)][DBLP]
    PODC, 1999, pp:3-12 [Conf]
  50. Rafail Ostrovsky, Daniel Shawcross Wilkerson
    Faster Computation On Directed Networks of Automata (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:38-46 [Conf]
  51. Rafail Ostrovsky, Moti Yung
    How to Withstand Mobile Virus Attacks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1991, pp:51-59 [Conf]
  52. Jonathan Katz, Rafail Ostrovsky, Michael O. Rabin
    Identity-Based Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    SCN, 2004, pp:180-192 [Conf]
  53. Jonathan Katz, Rafail Ostrovsky, Moti Yung
    Forward Secrecy in Password-Only Key Exchange Protocols. [Citation Graph (0, 0)][DBLP]
    SCN, 2002, pp:29-44 [Conf]
  54. Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky
    Matching Nuts and Bolts. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:690-696 [Conf]
  55. William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosén
    Dynamic routing on networks with fixed-size buffers. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:771-780 [Conf]
  56. Allan Borodin, Rafail Ostrovsky, Yuval Rabani
    Stability preserving transformations: packet routing networks with edge capacities and speeds. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:601-610 [Conf]
  57. Alain J. Mayer, Rafail Ostrovsky, Moti Yung
    Self-Stabilizing Algorithms for Synchronous Unidirectional Rings. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:564-573 [Conf]
  58. Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
    Secure Commitment Against A Powerful Adversary. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:439-448 [Conf]
  59. William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Adaptive Packet Routing for Bursty Adversarial Traffic. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:359-368 [Conf]
  60. Mihir Bellare, Silvio Micali, Rafail Ostrovsky
    Perfect Zero-Knowledge in Constant Rounds [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:482-493 [Conf]
  61. Mihir Bellare, Silvio Micali, Rafail Ostrovsky
    The (True) Complexity of Statistical Zero Knowledge [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:494-502 [Conf]
  62. Allan Borodin, Rafail Ostrovsky, Yuval Rabani
    Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:312-321 [Conf]
  63. Allan Borodin, Rafail Ostrovsky, Yuval Rabani
    Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:435-444 [Conf]
  64. Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Amit Sahai
    Universally composable two-party and multi-party secure computation. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:494-503 [Conf]
  65. Ran Canetti, Rafail Ostrovsky
    Secure Computation with Honest-Looking Parties: What If Nobody Is Truly Honest? (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:255-264 [Conf]
  66. Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky
    Non-Interactive and Non-Malleable Commitment. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:141-150 [Conf]
  67. Oded Goldreich, Rafail Ostrovsky, Erez Petrank
    Computational complexity and knowledge complexity (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:534-543 [Conf]
  68. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
    Batch codes and their applications. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:262-271 [Conf]
  69. Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
    The Linear-Array Conjecture in Communication Complexity is False. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:1-10 [Conf]
  70. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Log-space polynomial end-to-end communication. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:559-568 [Conf]
  71. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Characterizing Linear Size Circuits in Terms of Privacy. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:541-550 [Conf]
  72. Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
    Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:614-623 [Conf]
  73. Alain J. Mayer, Yoram Ofek, Rafail Ostrovsky, Moti Yung
    Self-Stabilizing Symmetry Breaking in Constant-Space (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:667-678 [Conf]
  74. Rafail Ostrovsky
    Efficient Computation on Oblivious RAMs [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:514-523 [Conf]
  75. Rafail Ostrovsky, Yuval Rabani
    Low distortion embeddings for edit distance. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:218-224 [Conf]
  76. Rafail Ostrovsky, Yuval Rabani
    Universal O(Congestion + Dilation + log1+epsilonN) Local Control Packet Switching Algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:644-653 [Conf]
  77. Rafail Ostrovsky, Sridhar Rajagopalan, Umesh V. Vazirani
    Simple and efficient leader election in the full information model. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:234-242 [Conf]
  78. Rafail Ostrovsky, Victor Shoup
    Private Information Storage (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:294-303 [Conf]
  79. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
    Sufficient Conditions for Collision-Resistant Hashing. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:445-456 [Conf]
  80. Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
    The Linear-Array Conjecture in Communication Complexity Is False. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:2, pp:241-254 [Journal]
  81. Jens Groth, Rafail Ostrovsky, Amit Sahai
    Perfect Non-Interactive Zero Knowledge for NP [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:097, pp:- [Journal]
  82. Oded Goldreich, Rafail Ostrovsky, Erez Petrank
    Computational Complexity and Knowledge Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:7, pp:- [Journal]
  83. Oded Goldreich, Rafail Ostrovsky
    Software Protection and Simulation on Oblivious RAMs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:3, pp:431-473 [Journal]
  84. Rafail Ostrovsky, Yuval Rabani
    Polynomial-time approximation schemes for geometric min-sum median clustering. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:2, pp:139-156 [Journal]
  85. Shay Kutten, Rafail Ostrovsky, Boaz Patt-Shamir
    The Las-Vegas Processor Identity Problem (How and When to Be Unique). [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:468-494 [Journal]
  86. William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Adaptive Packet Routing for Bursty Adversarial Traffic. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:3, pp:482-509 [Journal]
  87. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Characterizing Linear Size Circuits in Terms of Pricacy. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:1, pp:129-136 [Journal]
  88. Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky
    Minimal Complete Primitives for Secure Multi-Party Computation. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2005, v:18, n:1, pp:37-61 [Journal]
  89. Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Randomness versus Fault-Tolerance. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2000, v:13, n:1, pp:107-142 [Journal]
  90. Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky
    Universal Service-Providers for Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2001, v:14, n:1, pp:37-74 [Journal]
  91. Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
    Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1998, v:11, n:2, pp:87-108 [Journal]
  92. Allan Borodin, Rafail Ostrovsky, Yuval Rabani
    Stability Preserving Transformations: Packet Routing Networks with Edge Capacities and Speeds. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2004, v:5, n:1, pp:1-12 [Journal]
  93. Allan Borodin, Rafail Ostrovsky, Yuval Rabani
    Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2004, v:56, n:1-3, pp:153-167 [Journal]
  94. Oded Goldreich, Rafail Ostrovsky, Erez Petrank
    Computational Complexity and Knowledge Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1116-1141 [Journal]
  95. Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky
    Reducibility and Completeness in Private Computations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:4, pp:1189-1208 [Journal]
  96. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Log-Space Polynomial End-to-End Communication. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:6, pp:1531-1549 [Journal]
  97. Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
    Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:2, pp:457-474 [Journal]
  98. Alain J. Mayer, Rafail Ostrovsky, Yoram Ofek, Moti Yung
    Self-Stabilizing Symmetry Breaking in Constant Space. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1571-1595 [Journal]
  99. Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
    Amortizing Randomness in Private Multiparty Computations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:4, pp:533-544 [Journal]
  100. Shlomi Dolev, Rafail Ostrovsky
    Xor-trees for efficient anonymous multicast and reception. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Inf. Syst. Secur., 2000, v:3, n:2, pp:63-84 [Journal]
  101. Vipul Goyal, Ryan Moriarty, Rafail Ostrovsky, Amit Sahai
    Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2007, pp:444-459 [Conf]
  102. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
    Efficient Arguments without Short PCPs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:278-291 [Conf]
  103. Jens Groth, Rafail Ostrovsky
    Cryptography in the Multi-string Model. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:323-341 [Conf]
  104. Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III
    Public Key Encryption That Allows PIR Queries. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2007, pp:50-67 [Conf]
  105. Rafail Ostrovsky, Omkant Pandey, Amit Sahai
    Private Locally Decodable Codes. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:387-398 [Conf]
  106. Rafail Ostrovsky, William E. Skeith III
    A Survey of Single-Database Private Information Retrieval: Techniques and Applications. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2007, pp:393-411 [Conf]
  107. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
    Zero-knowledge from secure multiparty computation. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:21-30 [Conf]
  108. Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniolo
    Succinct Sampling on Streams [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  109. Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith
    Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  110. Rafail Ostrovsky, Yuval Rabani
    Low distortion embeddings for edit distance. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:5, pp:- [Journal]

  111. Near-Optimal Radio Use for Wireless Network Synchronization. [Citation Graph (, )][DBLP]


  112. Secure two-party k-means clustering. [Citation Graph (, )][DBLP]


  113. Attribute-based encryption with non-monotonic access structures. [Citation Graph (, )][DBLP]


  114. Visual Cryptography on Graphs. [Citation Graph (, )][DBLP]


  115. Communication Complexity in Algebraic Two-Party Protocols. [Citation Graph (, )][DBLP]


  116. Circular-Secure Encryption from Decision Diffie-Hellman. [Citation Graph (, )][DBLP]


  117. Public-Key Locally-Decodable Codes. [Citation Graph (, )][DBLP]


  118. Position Based Cryptography. [Citation Graph (, )][DBLP]


  119. Equivalence of Uniform Key Agreement and Composition Insecurity. [Citation Graph (, )][DBLP]


  120. Password-Authenticated Session-Key Generation on the Internet in the Plain Model. [Citation Graph (, )][DBLP]


  121. 05411 Abstracts Collection -- Anonymous Communication and its Applications. [Citation Graph (, )][DBLP]


  122. Almost-Everywhere Secure Computation. [Citation Graph (, )][DBLP]


  123. Secure Message Transmission with Small Public Discussion. [Citation Graph (, )][DBLP]


  124. Smooth Histograms for Sliding Windows. [Citation Graph (, )][DBLP]


  125. Round Complexity of Authenticated Broadcast with a Dishonest Majority. [Citation Graph (, )][DBLP]


  126. Covert Multi-Party Computation. [Citation Graph (, )][DBLP]


  127. Extracting Correlations. [Citation Graph (, )][DBLP]


  128. Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model. [Citation Graph (, )][DBLP]


  129. Asynchronous Throughput-Optimal Routing in Malicious Networks. [Citation Graph (, )][DBLP]


  130. Improved Fault Tolerance and Secure Computation on Sparse Networks. [Citation Graph (, )][DBLP]


  131. Optimal sampling from sliding windows. [Citation Graph (, )][DBLP]


  132. Public-Key Encryption with Efficient Amortized Updates. [Citation Graph (, )][DBLP]


  133. AMS Without 4-Wise Independence on Product Domains. [Citation Graph (, )][DBLP]


  134. Cryptography with constant computational overhead. [Citation Graph (, )][DBLP]


  135. Privacy amplification with asymptotically optimal entropy loss. [Citation Graph (, )][DBLP]


  136. Zero-one frequency laws. [Citation Graph (, )][DBLP]


  137. Measuring independence of datasets. [Citation Graph (, )][DBLP]


  138. Authenticated Adversarial Routing. [Citation Graph (, )][DBLP]


  139. Simulation-Based Concurrent Non-malleable Commitments and Decommitments. [Citation Graph (, )][DBLP]


  140. Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge. [Citation Graph (, )][DBLP]


  141. On Complete Primitives for Fairness. [Citation Graph (, )][DBLP]


  142. Measuring $k$-Wise Independence of Streaming Data [Citation Graph (, )][DBLP]


  143. Optimal-Rate Coding Theorem For Adversarial Networks in the Public-Key Setting [Citation Graph (, )][DBLP]


  144. Near-Optimal Radio Use For Wireless Network Synchronization [Citation Graph (, )][DBLP]


  145. Measuring Independence of Datasets [Citation Graph (, )][DBLP]


  146. Throughput in Asynchronous Networks [Citation Graph (, )][DBLP]


  147. Algebraic Lower Bounds for Computing on Encrypted Data. [Citation Graph (, )][DBLP]


  148. Public Key Encryption Which is Simultaneously a Locally-Decodable Error-Correcting Code. [Citation Graph (, )][DBLP]


  149. Concurrent Non-Malleable Witness Indistinguishability and its Applications. [Citation Graph (, )][DBLP]


  150. Improved Algorithms for Optimal Embeddings. [Citation Graph (, )][DBLP]


Search in 0.014secs, Finished in 0.021secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002