The following pages link to Rafail Ostrovsky (Q166365):
Displayed 50 items.
- (Q414876) (redirect page) (← links)
- Optimal sampling from sliding windows (Q414877) (← links)
- (Q484327) (redirect page) (← links)
- Authenticated adversarial routing (Q484328) (← links)
- Weighted sampling without replacement from data streams (Q495669) (← links)
- (Q587063) (redirect page) (← links)
- Visual cryptography on graphs (Q626454) (← links)
- Efficient robust secret sharing from expander graphs (Q680925) (← links)
- Near-optimal radio use for wireless network synchronization (Q714765) (← links)
- On linear-size pseudorandom generators and hardcore functions (Q744085) (← links)
- How to catch \(L_2\)-heavy-hitters on sliding windows (Q744092) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- Adaptive garbled RAM from laconic oblivious transfer (Q775994) (← links)
- Continuously non-malleable codes in the split-state model from minimal assumptions (Q776002) (← links)
- Almost-everywhere secure computation with edge corruptions (Q901366) (← links)
- The linear-array conjecture in communication complexity is false (Q1125618) (← links)
- Perfect zero-knowledge arguments for NP using any one-way permutation (Q1126890) (← links)
- Characterizing linear size circuits in terms of privacy (Q1305927) (← links)
- Adaptive packet routing for bursty adversarial traffic (Q1577008) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Information-theoretic broadcast with dishonest majority for long messages (Q1629421) (← links)
- The price of low communication in secure multi-party computation (Q1675733) (← links)
- Black-box parallel garbled RAM (Q1678363) (← links)
- Four-round concurrent non-malleable commitments from one-way functions (Q1678367) (← links)
- Round-optimal secure two-party computation from trapdoor permutations (Q1690212) (← links)
- Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds (Q1690213) (← links)
- Resettably-sound resettable zero knowledge in constant rounds (Q1690264) (← links)
- Non-interactive secure computation from one-way functions (Q1710666) (← links)
- Space-time tradeoffs for distributed verification (Q1742756) (← links)
- On the message complexity of secure multiparty computation (Q1749308) (← links)
- Minimal complete primitives for secure multi-party computation (Q1777285) (← links)
- Proactive secure multiparty computation with a dishonest majority (Q1796790) (← links)
- Randomness versus fault-tolerance (Q1976006) (← links)
- Efficient range-trapdoor functions and applications: rate-1 OT and more (Q2055715) (← links)
- Threshold garbled circuits and ad hoc secure computation (Q2056781) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- Communication-efficient (proactive) secure computation for dynamic general adversary structures and dynamic groups (Q2106634) (← links)
- Efficient 3-party distributed ORAM (Q2106641) (← links)
- Round optimal secure multiparty computation from minimal assumptions (Q2119049) (← links)
- A refined approximation for Euclidean \(k\)-means (Q2122798) (← links)
- ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- \textsc{EpiGRAM}: practical garbled RAM (Q2169989) (← links)
- Garbled circuits with sublinear evaluator (Q2169991) (← links)
- Adaptively secure computation for RAM programs (Q2170045) (← links)
- Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947) (← links)
- UC-secure multiparty computation from one-way functions using stateless tokens (Q2176666) (← links)
- Oblivious sampling with applications to two-party \(k\)-means clustering (Q2188971) (← links)
- A stable marriage requires communication (Q2278950) (← links)
- Private anonymous data access (Q2292872) (← links)