Enhanced Secure Thresholded Data Deduplication Scheme for Cloud Storage
| Autor: | Lukas Kencl, Jan Stanek |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
020203 distributed computing
Convergent encryption Database Computer science business.industry Client-side encryption 02 engineering and technology computer.software_genre Encryption Computer security Filesystem-level encryption Ciphertext 0202 electrical engineering electronic engineering information engineering Data deduplication 020201 artificial intelligence & image processing Electrical and Electronic Engineering business Semantic security computer Cloud storage |
| Zdroj: | IEEE Transactions on Dependable and Secure Computing. 15:694-707 |
| ISSN: | 2160-9209 1545-5971 |
| DOI: | 10.1109/tdsc.2016.2603501 |
| Popis: | As more corporate and private users outsource their data to cloud storage, recent data breach incidents make end-to-end encryption increasingly desirable. Unfortunately, semantically secure encryption renders various cost-effective storage optimization techniques, such as data deduplication, ineffective. On this ground Stanek et al. [1] introduced the concept of “data popularity” arguing that data known/owned by many users do not require as strong protection as unpopular data; based on this, Stanek et al. presented an encryption scheme, where the initially semantically secure ciphertext of a file is transparently downgraded to a convergent ciphertext that allows for deduplication as soon as the file becomes popular. In this paper we propose an enhanced version of the original scheme. Focusing on practicality, we modify the original scheme to improve its efficiency and emphasize clear functionality. We analyze the efficiency based on popularity properties of real datasets and provide a detailed performance evaluation, including comparison to alternative schemes in real-like settings. Importantly, the new scheme moves the handling of sensitive decryption shares and popularity state information out of the cloud storage, allowing for improved security notion, simpler security proofs and easier adoption. We show that the new scheme is secure under the Symmetric External Diffie-Hellman assumption in the random oracle model. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|