摘要
Data deduplication, aiming to eliminate duplicate data, has been widely used in cloud storage to reduce the amount of storage space and save bandwidth. Unfortunately, as an increasing number of sensitive data are stored remotely, the encryption, the simplest way for data privacy, is not compatible with data deduplication. Though many research efforts have been devoted to securing deduplication, they all are subject to performance, security, and applicability limitations. Here, we propose two encrypted deduplication schemes, SDedup and XDedup, both based on Merkle puzzle. To the best of our knowledge, XDedup is the first brute-force resilient encrypted deduplication with only symmetrically cryptographic two-party interactions. The analysis and numerical simulations are conducted to demonstrate the performance and practicality of SDedup and XDedup.
原文 | American English |
---|---|
頁數 | 13 |
出版狀態 | Published - 24 10月 2016 |
事件 | 23rd ACM Conference on Computer and Communications Security, CCS 2016 - Vienna, 奧地利 持續時間: 24 10月 2016 → 28 10月 2016 |
Conference
Conference | 23rd ACM Conference on Computer and Communications Security, CCS 2016 |
---|---|
國家/地區 | 奧地利 |
城市 | Vienna |
期間 | 24/10/16 → 28/10/16 |