default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDanny Harnik
Person information
- affiliation: IBM Haifa Lab, Tel-Aviv site, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Moshik Hershcovitch, Leshem Choshen, Andrew Wood, Ilias Enmouri, Peter Chin, Swaminathan Sundararaman, Danny Harnik:
Lossless and Near-Lossless Compression for Foundation Models. CoRR abs/2404.15198 (2024)- 2023
- [c31]Or Ozeri
, Danny Harnik, Effi Ofer:
Benefits of Encryption at the Storage Client. SYSTOR 2023: 149 - 2022
- [c30]Danny Harnik, Effi Ofer, Oded Naor, Or Ozery:
Rethinking block storage encryption with virtual disks. HotStorage 2022: 9-14 - [i9]Danny Harnik, Oded Naor, Effi Ofer, Or Ozery:
Rethinking Block Storage Encryption with Virtual Disks. CoRR abs/2205.15545 (2022) - 2021
- [c29]Doron Chen, Michael Factor, Danny Harnik, Ronen I. Kat, Eliad Tsfadia:
Length preserving compression: marrying encryption with compression. SYSTOR 2021: 15:1-15:12 - 2020
- [j8]Danny Harnik, Moshik Hershcovitch, Yosef Shatsky, Amir Epstein, Ronen I. Kat:
Sketching Volume Capacities in Deduplicated Storage. ACM Trans. Storage 15(4): 24:1-24:23 (2020) - [c28]Ohad Eytan, Danny Harnik, Effi Ofer, Roy Friedman, Ronen I. Kat:
It's Time to Revisit LRU vs. FIFO. HotStorage 2020 - [e1]Bianca Schroeder, Danny Harnik:
SYSTOR 2020: The 13th ACM International Systems and Storage Conference, Haifa, Israel, October 13-15, 2020. ACM 2020, ISBN 978-1-4503-7588-7 [contents]
2010 – 2019
- 2019
- [c27]Danny Harnik, Moshik Hershcovitch, Yosef Shatsky, Amir Epstein, Ronen I. Kat:
Sketching Volume Capacities in Deduplicated Storage. FAST 2019: 107-119 - [c26]Tânia Esteves, Ricardo Macedo, Alberto Faria, Bernardo Portela, João Paulo, José Pereira, Danny Harnik:
TrustFS: An SGX-Enabled Stackable File System Framework. SRDS Workshops 2019: 25-30 - 2018
- [c25]Effi Ofer, Amir Epstein, Dafna Sadeh, Danny Harnik:
Applying Deep Learning to Object Store Caching. SYSTOR 2018: 126 - [i8]Danny Harnik, Eliad Tsfadia, Doron Chen, Ronen I. Kat:
Securing the Storage Data Path with SGX Enclaves. CoRR abs/1806.10883 (2018) - [i7]Danny Harnik, Paula Ta-Shma, Eliad Tsfadia:
It Takes Two to #MeToo - Using Enclaves to Build Autonomous Trusted Systems. CoRR abs/1808.02708 (2018) - 2016
- [j7]Lior Aronovich, Ron Asher, Danny Harnik, Michael Hirsch, Shmuel T. Klein, Yair Toaff:
Similarity based deduplication with small data chunks. Discret. Appl. Math. 212: 10-22 (2016) - [c24]Danny Harnik, Ety Khaitzin, Dmitry Sotnikov:
When Less is More - Using Restricted Repetition Search in Fast Compressors. DCC 2016: 601 - [c23]Danny Harnik, Ety Khaitzin, Dmitry Sotnikov:
Estimating Unseen Deduplication - from Theory to Practice. FAST 2016: 277-290 - 2015
- [c22]Raúl Gracia Tinedo, Danny Harnik, Dalit Naor, Dmitry Sotnikov, Sivan Toledo, Aviad Zuck:
SDGen: Mimicking Datasets for Content Generation in Storage Benchmarks. FAST 2015: 317-330 - 2014
- [c21]Danny Harnik, Ety Khaitzin, Dmitry Sotnikov, Shai Taharlev:
A Fast Implementation of Deflate. DCC 2014: 223-232 - [c20]George Goldberg, Danny Harnik, Dmitry Sotnikov:
The case for sampling on very large file systems. MSST 2014: 1-11 - [c19]Aviad Zuck, Sivan Toledo, Dmitry Sotnikov, Danny Harnik:
Compression and SSDs: Where and How? INFLOW 2014 - 2013
- [c18]Danny Harnik, Ronen I. Kat, Oded Margalit, Dmitry Sotnikov, Avishay Traeger:
To Zip or not to Zip: effective resource usage for real-time compression. FAST 2013: 229-242 - [p1]Miriam Allalouf, Ghislain Chevalier, Danny Harnik, Sivan Tal:
Key Distributed Components for a Large-Scale Object Storage. Data Intensive Storage Services for Cloud Environments 2013: 9-26 - 2012
- [c17]Danny Harnik, Oded Margalit, Dalit Naor, Dmitry Sotnikov, Gil Vernik:
Estimation of deduplication ratios in large data sets. MSST 2012: 1-11 - [c16]Lior Aronovich, Ron Asher, Danny Harnik, Michael Hirsch, Shmuel Tomi Klein, Yair Toaff:
Similarity Based Deduplication with Small Data Chunks. Stringology 2012: 3-17 - 2011
- [j6]Danny Harnik, Elliot K. Kolodner, Shahar Ronen, Julian Satran, Alexandra Shulman-Peleg, Sivan Tal:
Secure Access Mechanism for Cloud Storage. Scalable Comput. Pract. Exp. 12(3) (2011) - [j5]Iftach Haitner, Danny Harnik, Omer Reingold:
On the Power of the Randomized Iterate. SIAM J. Comput. 40(6): 1486-1528 (2011) - [c15]Shai Halevi, Danny Harnik, Benny Pinkas, Alexandra Shulman-Peleg:
Proofs of ownership in remote storage systems. CCS 2011: 491-500 - [c14]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 Hernández-Rodriguez, Michael C. Jaeger, Ewnetu Bayuh Lakew, José Manuel Lopez, Mirko Lorenz, Alberto Messina, Alexandra Shulman-Peleg, Roman Talyansky, Athanasios Voulodimos, Yaron Wolfsthal:
A Cloud Environment for Data-intensive Storage Services. CloudCom 2011: 357-366 - [c13]Benny Applebaum, Danny Harnik, Yuval Ishai:
Semantic Security under Related-Key Attacks and Applications. ICS 2011: 45-60 - [i6]Shai Halevi, Danny Harnik, Benny Pinkas, Alexandra Shulman-Peleg:
Proofs of Ownership in Remote Storage Systems. IACR Cryptol. ePrint Arch. 2011: 207 (2011) - 2010
- [j4]Danny Harnik, Benny Pinkas, Alexandra Shulman-Peleg:
Side Channels in Cloud Services: Deduplication in Cloud Storage. IEEE Secur. Priv. 8(6): 40-47 (2010) - [j3]Danny Harnik, Moni Naor:
On the Compressibility of NP Instances and Cryptographic Applications. SIAM J. Comput. 39(5): 1667-1713 (2010) - [i5]Benny Applebaum, Danny Harnik, Yuval Ishai:
Semantic Security Under Related-Key Attacks and Applications. IACR Cryptol. ePrint Arch. 2010: 544 (2010)
2000 – 2009
- 2009
- [c12]Danny Harnik, Dalit Naor, Itai Segall:
Low power mode in cloud storage systems. IPDPS 2009: 1-8 - 2008
- [c11]Danny Harnik, Yuval Ishai, Eyal Kushilevitz, Jesper Buus Nielsen:
OT-Combiners via Secure Computation. TCC 2008: 393-411 - [c10]Nenad Dedic, Danny Harnik, Leonid Reyzin:
Saving Private Randomness in One-Way Functions and Pseudorandom Generators. TCC 2008: 607-625 - 2007
- [j2]Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel:
Constant-Round Oblivious Transfer in the Bounded Storage Model. J. Cryptol. 20(2): 165-202 (2007) - [c9]Danny Harnik, Yuval Ishai, Eyal Kushilevitz:
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? CRYPTO 2007: 284-302 - [i4]Nenad Dedic, Danny Harnik, Leonid Reyzin:
Saving Private Randomness in One-Way Functions and Pseudorandom Generators. IACR Cryptol. ePrint Arch. 2007: 458 (2007) - 2006
- [j1]Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen:
Completeness in Two-Party Secure Computation: A Computational View. J. Cryptol. 19(4): 521-552 (2006) - [c8]Iftach Haitner, Danny Harnik, Omer Reingold:
On the Power of the Randomized Iterate. CRYPTO 2006: 22-40 - [c7]Danny Harnik, Moni Naor:
On the Compressibility of NP Instances and Cryptographic Applications. FOCS 2006: 719-728 - [c6]Danny Harnik, Moni Naor:
On Everlasting Security in the Hybrid Bounded Storage Model. ICALP (2) 2006: 192-203 - [c5]Iftach Haitner, Danny Harnik, Omer Reingold:
Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions. ICALP (2) 2006: 228-239 - [i3]Danny Harnik, Moni Naor:
On the Compressibility of NP Instances and Cryptographic Applications. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c4]Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen:
On Robust Combiners for Oblivious Transfer and Other Primitives. EUROCRYPT 2005: 96-113 - [i2]Iftach Haitner, Danny Harnik, Omer Reingold:
On the Power of the Randomized Iterate. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c3]Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen:
Completeness in two-party secure computation: a computational view. STOC 2004: 252-261 - [c2]Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel:
Constant-Round Oblivious Transfer in the Bounded Storage Model. TCC 2004: 446-472 - 2003
- [i1]Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen:
Completeness in Two-Party Secure Computation - A Computational View. Electron. Colloquium Comput. Complex. TR03 (2003) - 2000
- [c1]Danny Harnik, Ran Raz:
Higher lower bounds on monotone size. STOC 2000: 378-387
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-27 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
