Searching for authors named "Danny Harnik" – sorted by Relevance.
-
Monotone Complexity by Switching Lemma
- Monotone Complexity by Switching Lemma # Danny Harnik + Ran Raz + Abstract We prove a lower bound
- Cited by 1 (0 self) – Add To MetaCart
-
Higher Lower Bounds On Monotone Size
- Higher Lower Bounds On Monotone Size Danny Harnik Ran Raz Abstract We prove a lower bound
- Cited by 4 (1 self) – Add To MetaCart
-
On everlasting security in the hybrid bounded storage model
- On Everlasting Security in the Hybrid Bounded Storage Model ‡ Danny Harnik ∗ Moni Naor † Abstract
- Cited by 2 (1 self) – Add To MetaCart
-
On the Power of the Randomized Iterate ∗ Draft
- On the Power of the Randomized Iterate ∗ Draft Iftach Haitner † Danny Harnik ‡ Omer Reingold
- Add To MetaCart
-
Efficient pseudorandom generators from exponentially hard one-way functions
- , Danny Harnik 2 , Omer Reingold 3 1 Dept. of Computer Science and Applied Math., Weizmann Institute
- Cited by 3 (3 self) – Add To MetaCart
-
Completeness in Two-Party Secure Computation -- A Computational View
- Completeness in Two-Party Secure Computation A Computational View Danny Harnik\Lambda Moni
- Cited by 1 (0 self) – Add To MetaCart
-
On the power of the randomized iterate
- On the Power of the Randomized Iterate Iftach Haitner 1 , Danny Harnik 2 , Omer Reingold 3 1 Dept
- Cited by 10 (5 self) – Add To MetaCart
-
On robust combiners for oblivious transfer and other primitives
- On Robust Combiners for Oblivious Transfer and Other Primitives Danny Harnik1?, Joe Kilian2
- Cited by 9 (1 self) – Add To MetaCart
-
Constant-Round Oblivious Transfer in the Bounded Storage Model
- Constant-Round Oblivious Transfer in the Bounded Storage Model Yan Zong Ding 1 , Danny Harnik 2
- Cited by 18 (3 self) – Add To MetaCart

