Danny Harnik

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

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

Coauthor Index

1Nenad Dedic [14]
2Yan Zong Ding [3] [12]
3Iftach Haitner [5] [8] [11]
4Yuval Ishai [13] [15]
5Joe Kilian [6]
6Eyal Kushilevitz [13] [15]
7Moni Naor [2] [4] [6] [7] [9] [10]
8Jesper Buus Nielsen [15]
9Ran Raz [1]
10Omer Reingold [2] [4] [5] [6] [7] [8] [11]
11Leonid Reyzin [14]
12Alon Rosen [2] [3] [4] [6] [7] [12]
13Ronen Shaltiel [3] [12]

Colors in the list of coauthors

Copyright © Fri May 16 13:44:56 2008 by Michael Ley (ley@uni-trier.de)