Scalable and efficient provable data possession

Giuseppe Ateniese, Roberto Di Pietro, Luigi V. Mancini, Gene Tsudik

Research output: Chapter in Book/Report/Conference proceedingConference contribution

840 Scopus citations

Abstract

Storage outsourcing is a rising trend which prompts a number of interesting security issues, many of which have been extensively investigated in the past. However, Provable Data Possession (PDP) is a topic that has only recently appeared in the research literature. The main issue is how to frequently, efficiently and securely verify that a storage server is faithfully storing its client's (potentially very large) outsourced data. The storage server is assumed to be untrusted in terms of both security and reliability. (In other words, it might maliciously or accidentally erase hosted data; it might also relegate it to slow or off-line storage.) The problem is exacerbated by the client being a small computing device with limited resources. Prior work has addressed this problem using either public key cryptography or requiring the client to outsource its data in encrypted form. In this paper, we construct a highly efficient and provably secure PDP technique based entirely on symmetric key cryptography, while not requiring any bulk encryption. Also, in contrast with its predecessors, our PDP technique allows outsourcing of dynamic data, i.e, it efficiently supports operations, such as block modification, deletion and append. Copyright 2008 ACM.
Original languageEnglish (US)
Title of host publicationProceedings of the 4th International Conference on Security and Privacy in Communication Networks, SecureComm'08
DOIs
StatePublished - Dec 1 2008
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2023-09-20

Fingerprint

Dive into the research topics of 'Scalable and efficient provable data possession'. Together they form a unique fingerprint.

Cite this