journal article·2025-01-26Open access

Coupling Secret Sharing with Decentralized Server-Aided Encryption in Encrypted Deduplication

Chuang Gan, Weichun Wang, Yuchong Hu, Xin Zhao, Shi Dun, Qixiang Xiao, Wei Wang, Huadong Huang

Applied Sciences· Volume 15· Issue 3

Abstract

Outsourcing storage to the cloud can save storage costs and is commonly used in businesses. It should fulfill two major goals: storage efficiency and data confidentiality. Encrypted deduplication can achieve both goals via performing deduplication to eliminate the duplicate data within encrypted data. Traditional encrypted deduplication generates the encryption key on the client side, which poses a risk of offline brute-force cracking of the outsourced data. Server-aided encryption schemes have been proposed to strengthen the confidentiality of encrypted deduplication by distributing the encryption process to dedicated servers. Existing schemes rely on expensive cryptographic primitives to provide a decentralized setting on the dedicated servers for scalability. However, this incurs substantial performance slowdown and can not be applied in practical encrypted deduplication storage systems. In this paper, we propose a new decentralized server-aided encrypted deduplication approach for outsourced storage, called ECDedup, which leverages secret sharing to achieve secure and efficient key management. We are the first to use the coding matrix as the encryption key to couple the encryption and encoding processes in encrypted deduplication. We also propose a acceleration scheme to speed up the encryption process of our ECDedup. We prototype ECDedup in cloud environments, and our experimental results based on the real-world backup datasets show that ECDedup can improve the client throughput by up to 51.9% compared to the state-of-the-art encrypted deduplication schemes.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Cryptography and Data Security · Cloud Data Security Solutions · Blockchain Technology Applications and Security

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China

Hikvision Digital Technology Co., Ltd., Hangzhou 310052, China

Funding

Key Research and Development Program of Hubei Province

References (36)

Show source-provided references
1. Bellare, M., Keelveedhi, S., and Ristenpart, T. (2013, January 14–16). DupLESS: Server-Aided Encryption for Deduplicated Storage. Proceedings of the USENIX Security, Washington, DC, USA.
2. The design and implementation of a rekeying-aware encrypted deduplication storage system10.1145/3032966 ↗
3. Li, J., Lee, P.P., Ren, Y., and Zhang, X. (2019, January 20–24). Metadedup: Deduplicating metadata in encrypted deduplication via indirection. Proceedings of the IEEE MSST, Santa Clara, CA, USA.10.1109/MSST.2019.00007 ↗
4. Li, J., Yang, Z., Ren, Y., Lee, P.P., and Zhang, X. (2020, January 27–30). Balancing storage efficiency and data confidentiality with tunable encrypted deduplication. Proceedings of the EuroSys, Heraklion Greece.10.1145/3342195.3387531 ↗
5. Ren, Y., Li, J., Yang, Z., Lee, P.P., and Zhang, X. (2021, January 14–16). Accelerating Encrypted Deduplication via SGX. Proceedings of the USENIX ATC, Online.
6. Yang, Z., Li, J., and Lee, P.P. (2022, January 11–13). Secure and lightweight deduplicated storage via shielded {deduplication-before-encryption}. Proceedings of the USENIX ATC, Carlsbad, CA, USA.
7. Secure multi-server-aided data deduplication in cloud computing10.1016/j.pmcj.2015.03.002 ↗
8. Decentralized server-aided encryption for secure deduplication in cloud storage
9. A comprehensive study of the past, present, and future of data deduplication10.1109/JPROC.2016.2571298 ↗
10. Zhu, B., Li, K., and Patterson, R.H. (2008, January 26–29). Avoiding the disk bottleneck in the data domain deduplication file system. Proceedings of the USENIX FAST, San Jose, CA, USA.
11. Wallace, G., Douglis, F., Qian, H., Shilane, P., Smaldone, S., Chamness, M., and Hsu, W. (2012, January 14–17). Characteristics of backup workloads in production systems. Proceedings of the USENIX FAST, San Jose, CA, USA.
12. Rabin, M.O. (1981). Fingerprinting by Random Polynomials, Technical Report; Scientific Research Publishing.
13. Douceur, J.R., Adya, A., Bolosky, W.J., Simon, P., and Theimer, M. (2002, January 2–5). Reclaiming space from duplicate files in a serverless distributed file system. Proceedings of the IEEE ICDCS, Vienna, Austria.
14. Li, M., Qin, C., and Lee, P.P. (2015, January 8–10). CDStore: Toward Reliable, Secure, and Cost-Efficient Cloud Storage via Convergent Dispersal. Proceedings of the USENIX ATC, San Jose, CA, USA.
15. Resch, J.K., and Plank, J.S. (2011, January 15–17). AONT-RS: Blending Security and Performance in Dispersed Storage Systems. Proceedings of the USENIX FAST, San Jose, CA, USA.
16. Rivest, R.L. (1997, January 20–22). All-or-nothing encryption and the package transform. Proceedings of the Springer FSE, Haifa, Israel.10.1007/BFb0052348 ↗
17. Polynomial Codes over Certain Finite Fields10.1137/0108018 ↗
18. A Survey on Network Codes for Distributed Storage10.1109/JPROC.2010.2096170 ↗
19. Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., and Song, D. (2007, January 28–31). Provable data possession at untrusted stores. Proceedings of the ACM CCS, Alexandria, VA, USA.10.1145/1315245.1315318 ↗
20. Plank, J.S., Luo, J., Schuman, C.D., Xu, L., and OHearn, Z. (2009, January 24–27). A Performance Evaluation and Examination of Open-Source Erasure Coding Libraries for Storage. Proceedings of the USENIX FAST, San Jose, CA, USA.
21. Plank, J.S., Greenan, K.M., and Miller, E.L. (2013, January 12–15). Screaming fast Galois field arithmetic using intel SIMD instructions. Proceedings of the USENIX FAST, San Jose, CA, USA.
22. Hu, Y., Cheng, L., Yao, Q., Lee, P.P.C., Wang, W., and Chen, W. (2021, January 23–25). Exploiting combined locality for Wide-Stripe erasure coding in distributed storage. Proceedings of the USENIX FAST, San Jose, CA, USA.
23. Li, M. (2012). On the confidentiality of information dispersal algorithms and their erasure codes. arXiv.
24. On MDS codes via Cauchy matrices10.1109/18.45291 ↗
25. Blomer, J. (1995). An XOR-Based Erasure-Resilient Coding Scheme, International Computer Science Institute (ICSI). Technical Report at ICSI.
26. OpenSSL (2024, November 01). Cryptography and SSL/TLS Toolkit. Available online: https://www.openssl.org/.
27. (2024, November 01). Reed-Solomon Erasure Coding in Go. Available online: https://github.com/klauspost/reedsolomon.
28. (2024, November 01). LevelDB. Available online: https://github.com/google/leveldb.
29. Fiege, U., Fiat, A., and Shamir, A. (1987, January 25–27). Zero knowledge proofs of identity. Proceedings of the STOC, New York, NY, USA.10.1145/28395.28419 ↗
30. Zhang, Y., Xia, W., Feng, D., Jiang, H., Hua, Y., and Wang, Q. (2019, January 25–28). Finesse:Fine-Grained Feature Locality based Fast Resemblance Detection for Post-Deduplication Delta Compression. Proceedings of the USENIX FAST, Boston, MA, USA.
31. (2024, November 01). Linux Archives. Available online: https://www.kernel.org.
32. (2024, November 01). Redis. Available online: http://redis.io/.
33. Duan, Y. (2014, January 3–7). Distributed key generation for encrypted deduplication: Achieving the strongest privacy. Proceedings of the ACM CCSW, Scottsdale, AZ, USA.10.1145/2664168.2664169 ↗
34. How to share a secret10.1145/359168.359176 ↗
35. Blakley, G.R., and Meadows, C. (1985, January 18–22). Security of ramp schemes. Proceedings of the CRYPTO, Santa Barbara, CA, USA.
36. Secure deduplication with efficient and reliable convergent key management10.1109/TPDS.2013.284 ↗