Ecole d'ingénieur et centre de recherche en Sciences du numérique

PerfectDedup: Secure data deduplication

Puzio, Pasquale ; Molva, Refik; Önen, Melek; Loureiro, Sergio

DPM 2015, 10th International Workshop on Data Privacy Management, September 21-22, 2015, Vienna, Austria

With the continuous increase of cloud storage adopters, data deduplication has become a necessity for cloud providers. By storing a unique copy of duplicate data, cloud providers greatly reduce their storage and data transfer costs. Unfortunately, deduplication introduces a number of new security challenges. We propose PerfectDedup, a novel scheme for secure data deduplication, which takes into account the popularity of the data segments and leverages the properties of Perfect Hashing in order to assure block-level deduplication and data con dentiality at the same time. We show that the client-side overhead is minimal and the main computational load is outsourced to the cloud storage provider.

Document Doi Bibtex

Titre:PerfectDedup: Secure data deduplication
Mots Clés:cloud,storage,deduplication,con dentiality,encryption,security, perfect hashing
Type:Conférence
Langue:English
Ville:Vienna
Pays:AUTRICHE
Date:
Département:Sécurité numérique
Eurecom ref:4683
Copyright: © Springer. Personal use of this material is permitted. The definitive version of this paper was published in DPM 2015, 10th International Workshop on Data Privacy Management, September 21-22, 2015, Vienna, Austria and is available at : http://dx.doi.org/10.1007/978-3-319-29883-2_10
Bibtex: @inproceedings{EURECOM+4683, doi = {http://dx.doi.org/10.1007/978-3-319-29883-2_10}, year = {2015}, title = {{P}erfect{D}edup: {S}ecure data deduplication}, author = {{P}uzio, {P}asquale and {M}olva, {R}efik and {\"{O}}nen, {M}elek and {L}oureiro, {S}ergio}, booktitle = {{DPM} 2015, 10th {I}nternational {W}orkshop on {D}ata {P}rivacy {M}anagement, {S}eptember 21-22, 2015, {V}ienna, {A}ustria}, address = {{V}ienna, {AUTRICHE}}, month = {09}, url = {http://www.eurecom.fr/publication/4683} }
Voir aussi: