2008 |
16 | EE | Danny Harnik,
Yuval Ishai,
Eyal Kushilevitz,
Jesper Buus Nielsen:
OT-Combiners via Secure Computation.
TCC 2008: 393-411 |
15 | EE | Nenad Dedic,
Danny Harnik,
Leonid Reyzin:
Saving Private Randomness in One-Way Functions and Pseudorandom Generators.
TCC 2008: 607-625 |
2007 |
14 | EE | Danny Harnik,
Yuval Ishai,
Eyal Kushilevitz:
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
CRYPTO 2007: 284-302 |
13 | EE | Yan Zong Ding,
Danny Harnik,
Alon Rosen,
Ronen Shaltiel:
Constant-Round Oblivious Transfer in the Bounded Storage Model.
J. Cryptology 20(2): 165-202 (2007) |
2006 |
12 | EE | Iftach Haitner,
Danny Harnik,
Omer Reingold:
On the Power of the Randomized Iterate.
CRYPTO 2006: 22-40 |
11 | EE | Danny Harnik,
Moni Naor:
On the Compressibility of NP Instances and Cryptographic Applications.
FOCS 2006: 719-728 |
10 | EE | Danny Harnik,
Moni Naor:
On Everlasting Security in the Hybrid Bounded Storage Model.
ICALP (2) 2006: 192-203 |
9 | EE | Iftach Haitner,
Danny Harnik,
Omer Reingold:
Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions.
ICALP (2) 2006: 228-239 |
8 | EE | Danny Harnik,
Moni Naor:
On the Compressibility of NP Instances and Cryptographic Applications.
Electronic Colloquium on Computational Complexity (ECCC) 13(022): (2006) |
7 | EE | Danny Harnik,
Moni Naor,
Omer Reingold,
Alon Rosen:
Completeness in Two-Party Secure Computation: A Computational View.
J. Cryptology 19(4): 521-552 (2006) |
2005 |
6 | EE | Danny Harnik,
Joe Kilian,
Moni Naor,
Omer Reingold,
Alon Rosen:
On Robust Combiners for Oblivious Transfer and Other Primitives.
EUROCRYPT 2005: 96-113 |
5 | EE | Iftach Haitner,
Danny Harnik,
Omer Reingold:
On the Power of the Randomized Iterate
Electronic Colloquium on Computational Complexity (ECCC)(135): (2005) |
2004 |
4 | EE | Danny Harnik,
Moni Naor,
Omer Reingold,
Alon Rosen:
Completeness in two-party secure computation: a computational view.
STOC 2004: 252-261 |
3 | EE | Yan Zong Ding,
Danny Harnik,
Alon Rosen,
Ronen Shaltiel:
Constant-Round Oblivious Transfer in the Bounded Storage Model.
TCC 2004: 446-472 |
2003 |
2 | EE | Danny Harnik,
Moni Naor,
Omer Reingold,
Alon Rosen:
Completeness in Two-Party Secure Computation - A Computational View
Electronic Colloquium on Computational Complexity (ECCC)(060): (2003) |
2000 |
1 | EE | Danny Harnik,
Ran Raz:
Higher lower bounds on monotone size.
STOC 2000: 378-387 |