#### Filter Results:

- Full text PDF available (23)

#### Publication Year

2000

2018

- This year (3)
- Last 5 years (12)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Shai Halevi, Danny Harnik, Benny Pinkas, Alexandra Shulman-Peleg
- IACR Cryptology ePrint Archive
- 2011

Cloud storage systems are becoming increasingly popular. A promising technology that keeps their cost down is deduplication, which stores only a single copy of repeating data. Client-sideâ€¦ (More)

- Danny Harnik, Benny Pinkas, Alexandra Shulman-Peleg
- IEEE Security & Privacy
- 2010

As the volume of data increases, so does the demand for online storage services, from simple backup services to cloud storage infrastructures. Although deduplication is most effective when appliedâ€¦ (More)

- Danny Harnik, Moni Naor
- 2006 47th Annual IEEE Symposium on Foundations ofâ€¦
- 2006

We initiate the study of compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problems.â€¦ (More)

- Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel
- Journal of Cryptology
- 2004

We present the first constant-round protocol for Oblivious Transfer in Maurer's bounded storage model. In this model, a long random string R is initially transmitted and each of the parties storesâ€¦ (More)

- Iftach Haitner, Danny Harnik, Omer Reingold
- Electronic Colloquium on Computational Complexity
- 2005

We consider two of the most fundamental theorems in Cryptography. The first, due to HÌŠastad et al. [HILL99], is that pseudorandom generators can be constructed from any one-way function. The secondâ€¦ (More)

- Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen
- EUROCRYPT
- 2005

A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even if one of theâ€¦ (More)

- Benny Applebaum, Danny Harnik, Yuval Ishai
- IACR Cryptology ePrint Archive
- 2010

In a related-key attack (RKA) an adversary attempts to break a cryptographic primitive by invoking the primitive with several secret keys which satisfy some known, or even chosen, relation. Weâ€¦ (More)

- Danny Harnik, Dalit Naor, Itai Segall
- 2009 IEEE International Symposium on Parallelâ€¦
- 2009

We consider large scale, distributed storage systems with a redundancy mechanism; cloud storage being a prime example. We investigate how such systems can reduce their power consumption duringâ€¦ (More)

- Danny Harnik, Oded Margalit, Dalit Naor, Dmitry Sotnikov, Gil Vernik
- 012 IEEE 28th Symposium on Mass Storage Systemsâ€¦
- 2012

We study the problem of accurately estimating the data reduction ratio achieved by deduplication and compression on a specific data set. This turns out to be a challenging task - It has been shownâ€¦ (More)

- Danny Harnik, Yuval Ishai, Eyal Kushilevitz
- CRYPTO
- 2007

Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n â‰¥ 3 parties requireeach pair ofâ€¦ (More)