Publications

Found 10 results
Author Title [ Type(Desc)] Year
Filters: First Letter Of Last Name is O and Author is Rafail Ostrovsky  [Clear All Filters]
Technical Report
Kushilevitz, E., Micali S., & Ostrovsky R. (1993).  Any Non-Private Boolean Function Is Complete For Private Multi-Party Computations.
Goldreich, O., Ostrovsky R., & Petrank E. (1994).  Computational Complexity and Knowledge Complexity.
Ostrovsky, R., & Wilkerson D. (1994).  Faster Computation On Directed Networks of Automata.
Kutten, S., Ostrovsky R., & Patt-Shamir B. (1993).  How and When to Be Unique.
Goldwasser, S., & Ostrovsky R. (1992).  Invariant Signatures and Non-Interactive Zero-Knowledge Proofs Are Equivalent.
Kushilevitz, E., Ostrovsky R., & Rosén A. (1994).  LOG-Space Polynomial End-to-End Communication.
Alon, N., Blum M. E., Fiat A., Kannan S., Naor M., & Ostrovsky R. (1993).  Matching Nuts and Bolts.
Ostrovsky, R., & Wigderson A. (1993).  One-Way Functions Are Essential for Non-Trivial Zero-Knowledge.
Naor, M., Ostrovsky R., Venkatesan R., & Yung M. (1992).  Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions.
Goldreich, O., & Ostrovsky R. (1993).  Software Protection and Simulation on Oblivious RAMs.