The following pages link to Danny Harnik (Q862421):
Displaying 14 items.
- Completeness in two-party secure computation: A computational view (Q862422) (← links)
- Constant-round oblivious transfer in the bounded storage model (Q877811) (← links)
- On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications (Q3053146) (← links)
- Higher lower bounds on monotone size (Q3192005) (← links)
- On the Power of the Randomized Iterate (Q3225163) (← links)
- Completeness in two-party secure computation (Q3580999) (← links)
- Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions (Q3591440) (← links)
- On Everlasting Security in the Hybrid Bounded Storage Model (Q3591443) (← links)
- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? (Q3612555) (← links)
- On Robust Combiners for Oblivious Transfer and Other Primitives (Q5385724) (← links)
- OT-Combiners via Secure Computation (Q5445517) (← links)
- Saving Private Randomness in One-Way Functions and Pseudorandom Generators (Q5445528) (← links)
- On the Power of the Randomized Iterate (Q5756642) (← links)
- Theory of Cryptography (Q5901786) (← links)
