The SCEAS System
| |||||||

## Search the dblp DataBase
Rafail Ostrovsky:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - 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] - William Aiello, Sachin Lodha, Rafail Ostrovsky
**Fast Digital Identity Revocation (Extended Abstract).**[Citation Graph (0, 0)][DBLP] CRYPTO, 1998, pp:137-152 [Conf] - Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky
**Deniable Encryption.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1997, pp:90-104 [Conf] - Giovanni Di Crescenzo, Rafail Ostrovsky
**On Concurrent Zero-Knowledge with Pre-processing.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1999, pp:485-502 [Conf] - Shlomi Dolev, Rafail Ostrovsky
**Efficient Anonymous Multicast and Reception (Extended Abstract).**[Citation Graph (0, 0)][DBLP] CRYPTO, 1997, pp:395-409 [Conf] - 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] - 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] - Joe Kilian, Silvio Micali, Rafail Ostrovsky
**Minimum Resource Zero-Knowledge Proofs (Extended Abstract).**[Citation Graph (0, 0)][DBLP] CRYPTO, 1989, pp:545-546 [Conf] - Ari Juels, Michael Luby, Rafail Ostrovsky
**Security of Blind Digital Signatures (Extended Abstract).**[Citation Graph (0, 0)][DBLP] CRYPTO, 1997, pp:150-164 [Conf] - Jonathan Katz, Rafail Ostrovsky
**Round-Optimal Secure Two-Party Computation.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2004, pp:335-354 [Conf] - 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] - Rafail Ostrovsky
**An Efficient Software Protection Scheme.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1989, pp:610-611 [Conf] - Rafail Ostrovsky, William E. Skeith III
**Private Searching on Streaming Data.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2005, pp:223-240 [Conf] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - Jens Groth, Rafail Ostrovsky, Amit Sahai
**Perfect Non-interactive Zero Knowledge for NP.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2006, pp:339-358 [Conf] - Jonathan Katz, Steven Myers, Rafail Ostrovsky
**Cryptographic Counters and Applications to Electronic Voting.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2001, pp:78-92 [Conf] - 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] - 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] - 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] - 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] - Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
**Interactive Hashing Simplifies Zero-Knowledge Protocol Design.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 1993, pp:267-273 [Conf] - Richard J. Lipton, Rafail Ostrovsky
**Micropayments via Efficient Coin-Flipping.**[Citation Graph (0, 0)][DBLP] Financial Cryptography, 1998, pp:1-15 [Conf] - 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] - Joe Kilian, Silvio Micali, Rafail Ostrovsky
**Minimum Resource Zero-Knowledge Proofs (Extended Abstract)**[Citation Graph (0, 0)][DBLP] FOCS, 1989, pp:474-479 [Conf] - 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] - 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] - Rafail Ostrovsky, Yuval Rabani
**Polynomial Time Approximation Schemes for Geometric k-Clustering.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:349-358 [Conf] - Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman
**Error-Correcting Codes for Automatic Control.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:309-316 [Conf] - Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
**Cryptography from Anonymity.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:239-248 [Conf] - 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] - 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] - 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] - 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] - 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] - 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] - Baruch Awerbuch, Rafail Ostrovsky
**Memory-Efficient and Self-Stabilizing Network {RESET} (Extended Abstract).**[Citation Graph (0, 0)][DBLP] PODC, 1994, pp:254-263 [Conf] - Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
**Randomness vs. Fault-Tolerance.**[Citation Graph (0, 0)][DBLP] PODC, 1997, pp:35-44 [Conf] - 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] - 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] - Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
**Amortizing Randomness in Private Multiparty Computations.**[Citation Graph (0, 0)][DBLP] PODC, 1998, pp:81-90 [Conf] - Rafail Ostrovsky, Boaz Patt-Shamir
**Optimal and Efficient Clock Synchronization Under Drifting Clocks.**[Citation Graph (0, 0)][DBLP] PODC, 1999, pp:3-12 [Conf] - 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] - Rafail Ostrovsky, Moti Yung
**How to Withstand Mobile Virus Attacks (Extended Abstract).**[Citation Graph (0, 0)][DBLP] PODC, 1991, pp:51-59 [Conf] - Jonathan Katz, Rafail Ostrovsky, Michael O. Rabin
**Identity-Based Zero Knowledge.**[Citation Graph (0, 0)][DBLP] SCN, 2004, pp:180-192 [Conf] - 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] - 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] - 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] - 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] - 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] - Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
**Secure Commitment Against A Powerful Adversary.**[Citation Graph (0, 0)][DBLP] STACS, 1992, pp:439-448 [Conf] - 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] - Mihir Bellare, Silvio Micali, Rafail Ostrovsky
**Perfect Zero-Knowledge in Constant Rounds**[Citation Graph (0, 0)][DBLP] STOC, 1990, pp:482-493 [Conf] - Mihir Bellare, Silvio Micali, Rafail Ostrovsky
**The (True) Complexity of Statistical Zero Knowledge**[Citation Graph (0, 0)][DBLP] STOC, 1990, pp:494-502 [Conf] - 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] - 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] - 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] - 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] - Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky
**Non-Interactive and Non-Malleable Commitment.**[Citation Graph (0, 0)][DBLP] STOC, 1998, pp:141-150 [Conf] - Oded Goldreich, Rafail Ostrovsky, Erez Petrank
**Computational complexity and knowledge complexity (extended abstract).**[Citation Graph (0, 0)][DBLP] STOC, 1994, pp:534-543 [Conf] - Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
**Batch codes and their applications.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:262-271 [Conf] - 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] - 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] - 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] - 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] - 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] - Rafail Ostrovsky
**Efficient Computation on Oblivious RAMs**[Citation Graph (0, 0)][DBLP] STOC, 1990, pp:514-523 [Conf] - Rafail Ostrovsky, Yuval Rabani
**Low distortion embeddings for edit distance.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:218-224 [Conf] - Rafail Ostrovsky, Yuval Rabani
**Universal**[Citation Graph (0, 0)][DBLP]*O*(Congestion + Dilation + log^{1+epsilon}*N*) Local Control Packet Switching Algorithms. STOC, 1997, pp:644-653 [Conf] - 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] - Rafail Ostrovsky, Victor Shoup
**Private Information Storage (Extended Abstract).**[Citation Graph (0, 0)][DBLP] STOC, 1997, pp:294-303 [Conf] - Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
**Sufficient Conditions for Collision-Resistant Hashing.**[Citation Graph (0, 0)][DBLP] TCC, 2005, pp:445-456 [Conf] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
**Perfect Zero-Knowledge Arguments for**[Citation Graph (0, 0)][DBLP]*NP*Using Any One-Way Permutation. J. Cryptology, 1998, v:11, n:2, pp:87-108 [Journal] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - Jens Groth, Rafail Ostrovsky
**Cryptography in the Multi-string Model.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:323-341 [Conf] - 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] - Rafail Ostrovsky, Omkant Pandey, Amit Sahai
**Private Locally Decodable Codes.**[Citation Graph (0, 0)][DBLP] ICALP, 2007, pp:387-398 [Conf] - 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] - 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] - Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniolo
**Succinct Sampling on Streams**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - 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] - Rafail Ostrovsky, Yuval Rabani
**Low distortion embeddings for edit distance.**[Citation Graph (0, 0)][DBLP] J. ACM, 2007, v:54, n:5, pp:- [Journal] **Near-Optimal Radio Use for Wireless Network Synchronization.**[Citation Graph (, )][DBLP]**Secure two-party k-means clustering.**[Citation Graph (, )][DBLP]**Attribute-based encryption with non-monotonic access structures.**[Citation Graph (, )][DBLP]**Visual Cryptography on Graphs.**[Citation Graph (, )][DBLP]**Communication Complexity in Algebraic Two-Party Protocols.**[Citation Graph (, )][DBLP]**Circular-Secure Encryption from Decision Diffie-Hellman.**[Citation Graph (, )][DBLP]**Public-Key Locally-Decodable Codes.**[Citation Graph (, )][DBLP]**Position Based Cryptography.**[Citation Graph (, )][DBLP]**Equivalence of Uniform Key Agreement and Composition Insecurity.**[Citation Graph (, )][DBLP]**Password-Authenticated Session-Key Generation on the Internet in the Plain Model.**[Citation Graph (, )][DBLP]**05411 Abstracts Collection -- Anonymous Communication and its Applications.**[Citation Graph (, )][DBLP]**Almost-Everywhere Secure Computation.**[Citation Graph (, )][DBLP]**Secure Message Transmission with Small Public Discussion.**[Citation Graph (, )][DBLP]**Smooth Histograms for Sliding Windows.**[Citation Graph (, )][DBLP]**Round Complexity of Authenticated Broadcast with a Dishonest Majority.**[Citation Graph (, )][DBLP]**Covert Multi-Party Computation.**[Citation Graph (, )][DBLP]**Extracting Correlations.**[Citation Graph (, )][DBLP]**Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model.**[Citation Graph (, )][DBLP]**Asynchronous Throughput-Optimal Routing in Malicious Networks.**[Citation Graph (, )][DBLP]**Improved Fault Tolerance and Secure Computation on Sparse Networks.**[Citation Graph (, )][DBLP]**Optimal sampling from sliding windows.**[Citation Graph (, )][DBLP]**Public-Key Encryption with Efficient Amortized Updates.**[Citation Graph (, )][DBLP]**AMS Without 4-Wise Independence on Product Domains.**[Citation Graph (, )][DBLP]**Cryptography with constant computational overhead.**[Citation Graph (, )][DBLP]**Privacy amplification with asymptotically optimal entropy loss.**[Citation Graph (, )][DBLP]**Zero-one frequency laws.**[Citation Graph (, )][DBLP]**Measuring independence of datasets.**[Citation Graph (, )][DBLP]**Authenticated Adversarial Routing.**[Citation Graph (, )][DBLP]**Simulation-Based Concurrent Non-malleable Commitments and Decommitments.**[Citation Graph (, )][DBLP]**Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge.**[Citation Graph (, )][DBLP]**On Complete Primitives for Fairness.**[Citation Graph (, )][DBLP]**Measuring $k$-Wise Independence of Streaming Data**[Citation Graph (, )][DBLP]**Optimal-Rate Coding Theorem For Adversarial Networks in the Public-Key Setting**[Citation Graph (, )][DBLP]**Near-Optimal Radio Use For Wireless Network Synchronization**[Citation Graph (, )][DBLP]**Measuring Independence of Datasets**[Citation Graph (, )][DBLP]**Throughput in Asynchronous Networks**[Citation Graph (, )][DBLP]**Algebraic Lower Bounds for Computing on Encrypted Data.**[Citation Graph (, )][DBLP]**Public Key Encryption Which is Simultaneously a Locally-Decodable Error-Correcting Code.**[Citation Graph (, )][DBLP]**Concurrent Non-Malleable Witness Indistinguishability and its Applications.**[Citation Graph (, )][DBLP]**Improved Algorithms for Optimal Embeddings.**[Citation Graph (, )][DBLP]
Search in 0.009secs, Finished in 0.014secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |