Title :
An improved dynamic provable data possession model
Author :
Liu, Feifei ; Gu, Dawu ; Lu, Haining
Author_Institution :
Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., Shanghai, China
Abstract :
Cloud computing is becoming increasingly popular. Many companies, organizations and individuals choose to outsource their computing demands and storage demands. In order to ensure the integrity of the data in the Cloud, especially the dynamic files which can be updated online, we propose an improved dynamic provable data possession model: It divides file into blocks, generates a tag for each block, computes a hash value for each tag, uses tags to ensure the integrity of the file blocks, and uses hash values to ensure the integrity of the tags. Compared with previous works, it reduces the computational and communication complexity from logn to constant. Although client needs to store some secret values which may create some additional storage expense, it only takes up about 0.02% of the original file size. Hence it is acceptable in most cases.
Keywords :
cloud computing; computational complexity; cryptography; data integrity; storage management; cloud computing; cloud storage; communication complexity; computational complexity; data integrity; dynamic file; dynamic provable data possession model; hash value; Arrays; Computational complexity; Computational modeling; Cryptography; Indexes; Servers; Cloud computing; Dynamic Provable Data Possession; cryptographic hash; proofs of storage;
Conference_Titel :
Cloud Computing and Intelligence Systems (CCIS), 2011 IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-61284-203-5
DOI :
10.1109/CCIS.2011.6045077