@conference {19597,
	title = {Dynamic Provable Data Possession},
	booktitle = {CCS {\textquoteright}09 Proceedings of the 16th ACM Conference on Computer and Communications Security },
	series = {CCS {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {213 - 222},
	publisher = {ACM},
	organization = {ACM},
	abstract = {We consider the problem of efficiently proving the integrity of data stored at untrusted servers. 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(logn) (or O(nεlog n), for a file consisting of n blocks, while maintaining the same (or better, respectively) probability of misbehavior detection. Our experiments show that this slowdown is very low in practice (e.g. 415KB proof size and 30ms computational overhead for a 1GB file). We also show how to apply our DPDP scheme to outsourced file systems and version control systems (e.g. CVS).},
	keywords = {authenticated data structures, Authentication, integrity checking, outsourced storage, proof of retrievability, provable data possession, skip list},
	isbn = {978-1-60558-894-0},
	url = {http://doi.acm.org/10.1145/1653662.1653688},
	author = {Erway, Chris and K{\"u}p\cc{\"u}, Alptekin and Charalampos Papamanthou and Tamassia, Roberto}
}
@conference {19601,
	title = {Efficient Integrity Checking of Untrusted Network Storage},
	booktitle = {StorageSS {\textquoteright}08 Proceedings of the 4th ACM International Workshop on Storage Security and Survivability },
	series = {StorageSS {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {43 - 54},
	publisher = {ACM},
	organization = {ACM},
	abstract = {Outsourced storage has become more and more practical in recent years. Users can now store large amounts of data in multiple servers at a relatively low price. An important issue for outsourced storage systems is to design an efficient scheme to assure users that their data stored at remote servers has not been tampered with. This paper presents a general method and a practical prototype application for verifying the integrity of files in an untrusted network storage service. The verification process is managed by an application running in a trusted environment (typically on the client) that stores just one cryptographic hash value of constant size, corresponding to the "digest" of an authenticated data structure. The proposed integrity verification service can work with any storage service since it is transparent to the storage technology used. Experimental results show that our integrity verification method is efficient and practical for network storage systems.},
	keywords = {authenticated data structures, data integrity, Security, untrusted outsourced storage},
	isbn = {978-1-60558-299-3},
	url = {http://doi.acm.org/10.1145/1456469.1456479},
	author = {Heitzmann, Alexander and Palazzi, Bernardo and Charalampos Papamanthou and Tamassia, Roberto}
}
