Enhanced Secure Thresholded Data Deduplication Scheme for Cloud Storage

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00318915" target="_blank" >RIV/68407700:21230/18:00318915 - isvavai.cz</a>

Result on the web

<a href="http://ieeexplore.ieee.org/abstract/document/7553458/" target="_blank" >http://ieeexplore.ieee.org/abstract/document/7553458/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/TDSC.2016.2603501" target="_blank" >10.1109/TDSC.2016.2603501</a>

Result language

angličtina

Original language name

Enhanced Secure Thresholded Data Deduplication Scheme for Cloud Storage

Original language description

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.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2018

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

IEEE Transactions on Dependable and Secure Computing

ISSN

1545-5971

e-ISSN

1941-0018

Volume of the periodical

—

Issue of the periodical within the volume

99

Country of publishing house

US - UNITED STATES

Number of pages

14

Pages from-to

694-707

UT code for WoS article

000438090700012

EID of the result in the Scopus database

2-s2.0-85049780971