Danny Harnik
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
24
Venues
13
Active years
2000–2023
Best venue rank
A*
Where they publish
Papers
24 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2023 | SYSTOR | Benefits of Encryption at the Storage Client. | Or Ozeri, Danny Harnik, Effi Ofer |
| 2021 | SYSTOR | Length preserving compression: marrying encryption with compression. | Doron Chen, Michael Factor, Danny Harnik, Ronen I. Kat, Eliad Tsfadia |
| 2019 | FAST | Sketching Volume Capacities in Deduplicated Storage. | Danny Harnik, Moshik Hershcovitch, Yosef Shatsky, Amir Epstein, Ronen I. Kat |
| 2019 | SRDS | TrustFS: An SGX-Enabled Stackable File System Framework. | Tnia Esteves, Ricardo Macedo, Alberto Faria, Bernardo Portela, Joo Paulo, Jos Pereira, Danny Harnik |
| 2018 | SYSTOR | Applying Deep Learning to Object Store Caching. | Effi Ofer, Amir Epstein, Dafna Sadeh, Danny Harnik |
| 2016 | DCC | When Less is More - Using Restricted Repetition Search in Fast Compressors. | Danny Harnik, Ety Khaitzin, Dmitry Sotnikov |
| 2016 | FAST | Estimating Unseen Deduplication - from Theory to Practice. | Danny Harnik, Ety Khaitzin, Dmitry Sotnikov |
| 2015 | FAST | SDGen: Mimicking Datasets for Content Generation in Storage Benchmarks. | Ral Gracia Tinedo, Danny Harnik, Dalit Naor, Dmitry Sotnikov, Sivan Toledo, Aviad Zuck |
| 2014 | DCC | A Fast Implementation of Deflate. | Danny Harnik, Ety Khaitzin, Dmitry Sotnikov, Shai Taharlev |
| 2014 | OSDI | Compression and SSDs: Where and How? | Aviad Zuck, Sivan Toledo, Dmitry Sotnikov, Danny Harnik |
| 2013 | FAST | To Zip or not to Zip: effective resource usage for real-time compression. | Danny Harnik, Ronen I. Kat, Oded Margalit, Dmitry Sotnikov, Avishay Traeger |
| 2011 | CCS | Proofs of ownership in remote storage systems. | Shai Halevi, Danny Harnik, Benny Pinkas, Alexandra Shulman-Peleg |
| 2011 | CloudCom | A Cloud Environment for Data-intensive Storage Services. | Elliot K. Kolodner, Sivan Tal, Dimosthenis Kyriazis, Dalit Naor, Miriam Allalouf, Lucia Bonelli, Per Brand, Albert Eckert, Erik Elmroth, Spyridon V. Gogouvitis, Danny Harnik, Francisco Hernndez-Rodriguez, Michael C. Jaeger, Ewnetu Bayuh Lakew, Jos Manuel Lopez, Mirko Lorenz, Alberto Messina, Alexandra Shulman-Peleg, Roman Talyansky, Athanasios Voulodimos, Yaron Wolfsthal |
| 2008 | TCC | Saving Private Randomness in One-Way Functions and Pseudorandom Generators. | Nenad Dedic, Danny Harnik, Leonid Reyzin |
| 2008 | TCC | OT-Combiners via Secure Computation. | Danny Harnik, Yuval Ishai, Eyal Kushilevitz, Jesper Buus Nielsen |
| 2007 | CRYPTO | How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? | Danny Harnik, Yuval Ishai, Eyal Kushilevitz |
| 2006 | CRYPTO | On the Power of the Randomized Iterate. | Iftach Haitner, Danny Harnik, Omer Reingold |
| 2006 | FOCS | On the Compressibility of NP Instances and Cryptographic Applications. | Danny Harnik, Moni Naor |
| 2006 | ICALP | Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions. | Iftach Haitner, Danny Harnik, Omer Reingold |
| 2006 | ICALP | On Everlasting Security in the | Danny Harnik, Moni Naor |
| 2005 | EuroCrypt | On Robust Combiners for Oblivious Transfer and Other Primitives. | Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen |
| 2004 | STOC | Completeness in two-party secure computation: a computational view. | Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen |
| 2004 | TCC | Constant-Round Oblivious Transfer in the Bounded Storage Model. | Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel |
| 2000 | STOC | Higher lower bounds on monotone size. | Danny Harnik, Ran Raz |