Danny Harnik

Orcid: 0009-0000-0614-6543

Affiliations:
  • IBM Haifa Lab, Tel-Aviv site, Israel


According to our database1, Danny Harnik authored at least 38 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Lossless and Near-Lossless Compression for Foundation Models.
CoRR, 2024

2023
Benefits of Encryption at the Storage Client.
Proceedings of the 16th ACM International Conference on Systems and Storage, 2023

2022
Rethinking block storage encryption with virtual disks.
Proceedings of the HotStorage '22: 14th ACM Workshop on Hot Topics in Storage and File Systems, Virtual Event, June 27, 2022

2021
Length preserving compression: marrying encryption with compression.
Proceedings of the SYSTOR '21: The 14th ACM International Systems and Storage Conference, 2021

2020
Sketching Volume Capacities in Deduplicated Storage.
ACM Trans. Storage, 2020

It's Time to Revisit LRU vs. FIFO.
Proceedings of the 12th USENIX Workshop on Hot Topics in Storage and File Systems, 2020

2019
TrustFS: An SGX-Enabled Stackable File System Framework.
Proceedings of the 38th International Symposium on Reliable Distributed Systems Workshops, 2019

2018
It Takes Two to #MeToo - Using Enclaves to Build Autonomous Trusted Systems.
CoRR, 2018

Securing the Storage Data Path with SGX Enclaves.
CoRR, 2018

Applying Deep Learning to Object Store Caching.
Proceedings of the 11th ACM International Systems and Storage Conference, 2018

2016
Similarity based deduplication with small data chunks.
Discret. Appl. Math., 2016

Estimating Unseen Deduplication - from Theory to Practice.
Proceedings of the 14th USENIX Conference on File and Storage Technologies, 2016

When Less is More - Using Restricted Repetition Search in Fast Compressors.
Proceedings of the 2016 Data Compression Conference, 2016

2015
SDGen: Mimicking Datasets for Content Generation in Storage Benchmarks.
Proceedings of the 13th USENIX Conference on File and Storage Technologies, 2015

2014
Compression and SSDs: Where and How?
Proceedings of the 2nd Workshop on Interactions of NVM/Flash with Operating Systems and Workloads, 2014

The case for sampling on very large file systems.
Proceedings of the IEEE 30th Symposium on Mass Storage Systems and Technologies, 2014

A Fast Implementation of Deflate.
Proceedings of the Data Compression Conference, 2014

2013
To Zip or not to Zip: effective resource usage for real-time compression.
Proceedings of the 11th USENIX conference on File and Storage Technologies, 2013

Key Distributed Components for a Large-Scale Object Storage.
Proceedings of the Data Intensive Storage Services for Cloud Environments., 2013

2012
Estimation of deduplication ratios in large data sets.
Proceedings of the IEEE 28th Symposium on Mass Storage Systems and Technologies, 2012

2011
On the Power of the Randomized Iterate.
SIAM J. Comput., 2011

Secure Access Mechanism for Cloud Storage.
Scalable Comput. Pract. Exp., 2011

Proofs of Ownership in Remote Storage Systems.
IACR Cryptol. ePrint Arch., 2011


2010
On the Compressibility of <i>NP</i> Instances and Cryptographic Applications.
SIAM J. Comput., 2010

Side Channels in Cloud Services: Deduplication in Cloud Storage.
IEEE Secur. Priv., 2010

Semantic Security Under Related-Key Attacks and Applications.
IACR Cryptol. ePrint Arch., 2010

2009
Low power mode in cloud storage systems.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008
OT-Combiners via Secure Computation.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

2007
Constant-Round Oblivious Transfer in the Bounded Storage Model.
J. Cryptol., 2007

Saving Private Randomness in One-Way Functions and Pseudorandom Generators.
IACR Cryptol. ePrint Arch., 2007

How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
Proceedings of the Advances in Cryptology, 2007

2006
On the Compressibility of NP Instances and Cryptographic Applications.
Electron. Colloquium Comput. Complex., 2006

On Everlasting Security in the <i>Hybrid</i> Bounded Storage Model.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
On Robust Combiners for Oblivious Transfer and Other Primitives.
Proceedings of the Advances in Cryptology, 2005

2003
Completeness in Two-Party Secure Computation - A Computational View
Electron. Colloquium Comput. Complex., 2003

2000
Higher lower bounds on monotone size.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000


  Loading...