Dynamic provable data possession

As storage-outsourcing services and resource-sharing networks have become popular, the problem of efficiently proving the integrity of data stored at untrusted servers has received increased attention. In the provable data possession (PDP) model, the client preprocesses the data and then sends it to an untrusted server for storage, while keeping a small amount of meta-data. The client later asks the server to prove that the stored data has not been tampered with or deleted (without downloading the actual data). However, the original PDP scheme applies only to static (or append-only) files. We present a definitional framework and efficient constructions for dynamic provable data possession (DPDP), which extends the PDP model to support provable updates to stored data. We use a new version of authenticated dictionaries based on rank information. The price of dynamic updates is a performance change from O(1) to O(log n) (or O(nǫ log n)), for a file consisting of n blocks, while mai...

• Type: Conference
• Year: 2009
• Where: CCS
• Authors: C. Christopher Erway, Alptekin Küpçü, Charalampos Papamanthou, Roberto Tamassia
• Keywords: CCS 2009, Dynamic Provable Data, Provable Data Possession, Security Privacy, Untrusted Server