For full picture click here (recommended).

Danny Harnik

I am currently at IBM Research, Haifa.

Until recently I was a Post-Doc at the Department of Computer Science, Technion, Haifa, Israel, Hosted by Yuval Ishai and Eyal Kushilevitz.

I completed my Ph.D. under the supervision of Moni Naor at the Faculty of Mathematics and Computer Science,

Weizmann Institute of Science, Rehovot, Israel. My  CV (updated 12/12/06)  ps , pdf.

I'm on the program committees of RSA-CT 08' and CRYPTO 08'.   

Publications

·         Danny Harnik, Yuval Ishai , Eyal Kushilevitz and Jesper Buus Nielsen. OT-Combiners via Secure Computation. In TCC 2008.

·         Nenad Dedic, Danny Harnik and Leonid Reyzin. Saving Private Randomness in One-Way Functions and Pseudorandom Generators. In TCC 2008.   pdf

·         Danny Harnik, Yuval Ishai and Eyal Kushilevitz. How many Oblivious Transfers are Needed for Secure Multiparty Computation?  In CRYPTO 2007.   pdf

·          Iftach Haitner, Danny Harnik and Omer Reingold. On Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions.  In ICALP 2006. ps   pdf

Winner of the Best paper award, ICALP 2006, track C.

·         Danny Harnik and  Moni Naor. On Everlasting Security in the Hybrid Bounded Storage Model. In ICALP 2006.  ps   pdf

·         Danny Harnik and  Moni Naor. On the Compressibility of NP instances and Cryptographic Applications. To appear in FOCS 2006.  ps   pdf

·         Iftach Haitner, Danny Harnik and Omer Reingold. On the Power of the Randomized Iterate. In CRYPTO 2006.  ps   pdf

Winner of the Best paper award, CRYPTO 2006.

·         Danny Harnik, Joe Kilian,  Moni Naor, Omer Reingold and Alon Rosen. On Robust Combiners for Oblivious Transfer and other Primitives. In EUROCRYPT 2005. ps   pdf

·         Danny Harnik, Moni Naor, Omer Reingold and Alon Rosen. Completeness in Two-Party Secure Computation - A Computational View. In Journal of  Cryptology. Preliminary version in STOC 2004. ps

·         Yan Zong Ding, Danny Harnik, Alon Rosen and Ronen Shaltiel. Constant Round Oblivious Transfer in the Bounded Storage Model. . In Journal of  Cryptology. Preliminary version in TCC 2004. ps   pdf

·         Danny Harnik and Ran Raz.  Monotone Complexity by Switching Lemma. Preliminary version in STOC 2000. ps

Department of Computer Science

Technion Israel Institute of Technology,
Haifa 32000, Israel