The following pages link to Rafail Ostrovsky (Q166365):
Displaying 50 items.
- Trapdoor hash functions and their applications (Q2304914) (← links)
- Universally composable secure computation with corrupted tokens (Q2304927) (← links)
- Reusable non-interactive secure computation (Q2304929) (← links)
- Cryptographic sensing (Q2304933) (← links)
- Local correctability of expander codes (Q2347805) (← links)
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles (Q2377064) (← links)
- Private searching on streaming data (Q2463447) (← links)
- Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
- (Q2754165) (← links)
- Stability preserving transformations: Packet routing networks with edge capacities and speeds (Q2768354) (← links)
- Efficient and non-interactive non-malleable commitment (Q2778839) (← links)
- (Q2778842) (← links)
- Amortizing randomness in private multiparty computations (Q2790103) (← links)
- Universal service-providers for database private information retrieval (extended abstract) (Q2790104) (← links)
- Communication-Optimal Proactive Secret Sharing for Dynamic Groups (Q2794492) (← links)
- Adaptive Security with Quasi-Optimal Rate (Q2796140) (← links)
- Fast distributed almost stable matchings (Q2796247) (← links)
- Private Large-Scale Databases with Distributed Searchable Symmetric Encryption (Q2799008) (← links)
- Simple and efficient leader election in the full information model (Q2817614) (← links)
- Computational complexity and knowledge complexity (extended abstract) (Q2817645) (← links)
- Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract) (Q2819552) (← links)
- Lower bounds for high dimensional nearest neighbor search and related problems (Q2819560) (← links)
- High-Precision Secure Computation of Satellite Collision Probabilities (Q2827717) (← links)
- Proactive Secret Sharing with a Dishonest Majority (Q2827737) (← links)
- Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) (← links)
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds (Q2829950) (← links)
- Nearly Simultaneously Resettable Black-Box Zero Knowledge (Q2843238) (← links)
- Approximating Large Frequency Moments with Pick-and-Drop Sampling (Q2851847) (← links)
- Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams (Q2851848) (← links)
- Building Lossy Trapdoor Functions from Lossy Encryption (Q2867156) (← links)
- Constant-Round Concurrent Zero Knowledge in the Bounded Player Model (Q2867209) (← links)
- Maliciously Circuit-Private FHE (Q2874525) (← links)
- Secure Multi-Party Computation with Identifiable Abort (Q2874547) (← links)
- Measuring independence of datasets (Q2875153) (← links)
- Zero-one frequency laws (Q2875154) (← links)
- Privacy amplification with asymptotically optimal entropy loss (Q2875205) (← links)
- Identifying Cheaters without an Honest Majority (Q2891474) (← links)
- Resettable Statistical Zero Knowledge (Q2891502) (← links)
- Simultaneously Resettable Arguments of Knowledge (Q2891504) (← links)
- Unconditionally-Secure Robust Secret Sharing with Compact Shares (Q2894408) (← links)
- On Homomorphic Encryption and Chosen-Ciphertext Security (Q2900208) (← links)
- Correlated Product Security from Any One-Way Function (Q2900242) (← links)
- Extended-DDH and Lossy Trapdoor Functions (Q2900248) (← links)
- 5PM: Secure Pattern Matching (Q2912798) (← links)
- Impossibility Results for Static Input Secure Computation (Q2914274) (← links)
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority (Q2914294) (← links)
- Communication-Efficient MPC for General Adversary Structures (Q2922658) (← links)
- On Selective-Opening Attacks against Encryption Schemes (Q2922682) (← links)
- Position-based cryptography (Q2929699) (← links)
- Efficient Error-Correcting Codes for Sliding Windows (Q2938105) (← links)
