期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Reducing Computational and Communication Complexity for Dynamic Provable Data Possession
1
作者 刘妃妃 谷大武 +2 位作者 陆海宁 龙斌 李晓晖 《China Communications》 SCIE CSCD 2011年第6期67-75,共9页
Nowadays, an increasing number of persons choose to outsource their computing demands and storage demands to the Cloud. In order to ensure the integrity of the data in the untrusted Cloud, especially the dynamic files... Nowadays, an increasing number of persons choose to outsource their computing demands and storage demands to the Cloud. In order to ensure the integrity of the data in the untrusted Cloud, especially the dynamic files which can be updated online, we propose an improved dynamic provable data possession model. We use some homomorphic tags to verify the integrity of the file and use some hash values generated by some secret values and tags to prevent replay attack and forgery attack. Compared with previous works, our proposal reduces the computational and communication complexity from O(logn) to O(1). We did some experiments to ensure this improvement and extended the model to file sharing situation. 展开更多
关键词 cloud computing proofs of storage dynamic provable data possession file sharing
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部