The following pages link to Rafail Ostrovsky (Q166365):
Displaying 50 items.
- Garbled RAM From One-Way Functions (Q2941537) (← links)
- Optimal and efficient clock synchronization under drifting clocks (Q2942746) (← links)
- How to withstand mobile virus attacks, revisited (Q2943628) (← links)
- Fast and unconditionally secure anonymous channel (Q2943631) (← links)
- Locally Decodable Codes for Edit Distance (Q2947534) (← links)
- Broadcast (and Round) Efficient Verifiable Secret Sharing (Q2948264) (← links)
- Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World (Q2948395) (← links)
- Secure Message Transmission With Small Public Discussion (Q2986460) (← links)
- The Hidden Graph Model (Q2989026) (← links)
- Efficient Non-interactive Secure Computation (Q3003395) (← links)
- Secure Message Transmission by Public Discussion: A Brief Survey (Q3005585) (← links)
- Effective Computations on Sliding Windows (Q3068626) (← links)
- Public Key Locally Decodable Codes with Short Keys (Q3088130) (← links)
- Deterministic and Energy-Optimal Wireless Synchronization (Q3095330) (← links)
- Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security (Q3102176) (← links)
- AMS without 4-wise independence on product domains (Q3113742) (← links)
- Matching nuts and bolts (Q3128932) (← links)
- (Q3149675) (← links)
- Self-Stabilizing Symmetry Breaking in Constant Space (Q3149884) (← links)
- Edge Fault Tolerance on Sparse Networks (Q3167034) (← links)
- Multiparty Proximity Testing with Dishonest Majority from Equality Testing (Q3167042) (← links)
- Position Based Cryptography (Q3183576) (← links)
- Polynomial-time approximation schemes for geometric min-sum median clustering (Q3196638) (← links)
- (Q3210144) (← links)
- (Q3374903) (← links)
- (Q3374904) (← links)
- On Complete Primitives for Fairness (Q3408189) (← links)
- Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge (Q3408214) (← links)
- Efficient and secure authenticated key exchange using weak passwords (Q3455565) (← links)
- Impossibility of Black-Box Simulation Against Leakage Attacks (Q3457063) (← links)
- Cryptography with One-Way Communication (Q3457066) (← links)
- Round-Optimal Black-Box Two-Party Computation (Q3457073) (← links)
- Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting (Q3457094) (← links)
- Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions (Q3498392) (← links)
- Visual Cryptography on Graphs (Q3511331) (← links)
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model (Q3519532) (← links)
- (Q3549593) (← links)
- (Q3549728) (← links)
- Secure Message Transmission with Small Public Discussion (Q3563835) (← links)
- Zero-Knowledge Proofs from Secure Multiparty Computation (Q3575162) (← links)
- Universally composable two-party and multi-party secure computation (Q3579187) (← links)
- Batch codes and their applications (Q3580973) (← links)
- Password-Authenticated Session-Key Generation on the Internet in the Plain Model (Q3582760) (← links)
- Equivalence of Uniform Key Agreement and Composition Insecurity (Q3582770) (← links)
- Asynchronous Throughput-Optimal Routing in Malicious Networks (Q3587442) (← links)
- Improved Fault Tolerance and Secure Computation on Sparse Networks (Q3587443) (← links)
- Public-Key Encryption with Efficient Amortized Updates (Q3588328) (← links)
- Perfect Non-interactive Zero Knowledge for NP (Q3593105) (← links)
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles (Q3593112) (← links)
- Circular-Secure Encryption from Decision Diffie-Hellman (Q3600216) (← links)
