The following pages link to Rafail Ostrovsky (Q166365):
Displaying 50 items.
- (Q4941875) (← links)
- Reducibility and Completeness in Private Computations (Q4943863) (← links)
- Improved algorithms for optimal embeddings (Q4962750) (← links)
- Error-Correcting Codes for Automatic Control (Q4975907) (← links)
- (Q5002775) (← links)
- CNF-FSS and Its Applications (Q5087261) (← links)
- Secure commitment against a powerful adversary (Q5096801) (← links)
- On Input Indistinguishable Proof Systems (Q5167801) (← links)
- Extracting Correlations (Q5171210) (← links)
- Population Stability (Q5197705) (← links)
- Position-Based Quantum Cryptography: Impossibility and Constructions (Q5199205) (← links)
- Constant-Rate Oblivious Transfer from Noisy Channels (Q5199219) (← links)
- Efficient Error-Correcting Codes for Sliding Windows (Q5220468) (← links)
- How to withstand mobile virus attacks (extended abstract) (Q5255805) (← links)
- Black-box non-black-box zero knowledge (Q5259587) (← links)
- Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way (Q5261636) (← links)
- Non-committing Encryption from Φ-hiding (Q5261645) (← links)
- Advances in Cryptology - EUROCRYPT 2004 (Q5307272) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311543) (← links)
- How Hard Is Counting Triangles in the Streaming Model? (Q5326565) (← links)
- Local Correctability of Expander Codes (Q5326590) (← links)
- Robust Pseudorandom Generators (Q5326593) (← links)
- Zero-One Laws for Sliding Windows and Universal Sketches (Q5351923) (← links)
- A Randomized Online Quantile Summary in O(1/epsilon * log(1/epsilon)) Words. (Q5351934) (← links)
- Memory-efficient and self-stabilizing network RESET (extended abstract) (Q5361416) (← links)
- Faster computation on directed networks of automata (Q5361433) (← links)
- Randomness vs. fault-tolerance (Q5361464) (← links)
- Brief Announcement (Q5361962) (← links)
- A Stable Marriage Requires Communication (Q5363098) (← links)
- (Q5365019) (← links)
- Brief Announcement (Q5368994) (← links)
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems (Q5388006) (← links)
- New Techniques for Noninteractive Zero-Knowledge (Q5395682) (← links)
- The effectiveness of lloyd-type methods for the k-means problem (Q5395696) (← links)
- Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing (Q5402969) (← links)
- Cross-Domain Secure Computation (Q5402998) (← links)
- Garbled RAM Revisited (Q5418708) (← links)
- Position-Based Quantum Cryptography: Impossibility and Constructions (Q5419034) (← links)
- Private Locally Decodable Codes (Q5428825) (← links)
- Private Searching on Streaming Data (Q5451028) (← links)
- Almost-Everywhere Secure Computation (Q5458599) (← links)
- Security in Communication Networks (Q5491698) (← links)
- Privacy amplification with asymptotically optimal entropy loss (Q5501933) (← links)
- (Q5692700) (← links)
- Theory of Cryptography (Q5711657) (← links)
- Circuit-Private Multi-key FHE (Q5738758) (← links)
- Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs (Q5738884) (← links)
- Unconditionally Secure Computation with Reduced Interaction (Q5739210) (← links)
- (Q5743385) (← links)
- On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols (Q5744697) (← links)
