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