The following pages link to Rafail Ostrovsky (Q166365):
Displaying 50 items.
- Public-Key Locally-Decodable Codes (Q3600217) (← links)
- Communication Complexity in Algebraic Two-Party Protocols (Q3600230) (← links)
- Simulation-Based Concurrent Non-malleable Commitments and Decommitments (Q3611761) (← links)
- Authenticated Adversarial Routing (Q3611765) (← links)
- Public Key Encryption That Allows PIR Queries (Q3612544) (← links)
- Cryptography in the Multi-string Model (Q3612557) (← links)
- Near-Optimal Radio Use for Wireless Network Synchronization (Q3654147) (← links)
- Computational Complexity and Knowledge Complexity (Q4210087) (← links)
- Log-Space Polynomial End-to-End Communication (Q4210121) (← links)
- (Q4228448) (← links)
- (Q4228509) (← links)
- (Q4234105) (← links)
- (Q4249326) (← links)
- Conditional Oblivious Transfer and Timed-Release Encryption (Q4250755) (← links)
- (Q4287362) (← links)
- (Q4314042) (← links)
- (Q4318694) (← links)
- Invariant signatures and non-interactive zero-knowledge proofs are equivalent (Q4318696) (← links)
- (Q4364544) (← links)
- (Q4364566) (← links)
- Software protection and simulation on oblivious RAMs (Q4371676) (← links)
- (Q4414266) (← links)
- Amortizing Randomness in Private Multiparty Computations (Q4443108) (← links)
- (Q4471371) (← links)
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces (Q4507359) (← links)
- The Las-Vegas Processor Identity Problem (How and When to Be Unique) (Q4521525) (← links)
- (Q4526994) (← links)
- (Q4527032) (← links)
- (Q4542531) (← links)
- (Q4542554) (← links)
- (Q4542584) (← links)
- Coding for Interactive Communication Correcting Insertions and Deletions (Q4566488) (← links)
- Matrix Balancing in <i>L</i><sub>p</sub> Norms: Bounding the Convergence Rate of Osborne's Iteration (Q4575746) (← links)
- (Q4591370) (← links)
- Provably Secure Virus Detection: Using The Observer Effect Against Malware. (Q4598168) (← links)
- (Q4598200) (← links)
- (Q4783745) (← links)
- (Q4785498) (← links)
- (Q4858457) (← links)
- (Q4875231) (← links)
- Concurrent Zero Knowledge in the Bounded Player Model (Q4910271) (← links)
- Succinct Non-interactive Arguments via Linear Interactive Proofs (Q4910285) (← links)
- Distributed Oblivious RAM for Secure Two-Party Computation (Q4910289) (← links)
- Revisiting Lower and Upper Bounds for Selective Decommitments (Q4910298) (← links)
- Cryptography Using Captcha Puzzles (Q4916003) (← links)
- Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions (Q4924440) (← links)
- How to Garble RAM Programs? (Q4924441) (← links)
- On Linear-Size Pseudorandom Generators and Hardcore Functions (Q4925235) (← links)
- How to Catch L 2-Heavy-Hitters on Sliding Windows (Q4925278) (← links)
- (Q4934711) (← links)
