关键词: 数据持有性证明, 双线性对, B+树, 云存储, 数据版本表

Abstract: Abstract: Concerning the existing schemes of provable data possession is inefficient and can not support the problem of full dynamic update, a novel dynamic provable data possession scheme based on B+ tree was proposed. Bilinear pairing techniques and data version are introduced to support fine-grained dynamic operations at the block level and to protect user’s data privacy in the proposed scheme. The third party auditor can identify the wrong data and locate it accurately by optimized the system model and designed the retrieved value of the data node. Comparison with the scheme based on the Merkel Hash tree (MHT), Theoretical analysis and the experimental results show that the proposed scheme can reduce the cost of constructing the authentication data structure，improve the verification efficiency of the third party auditor.

Key words: provable data possession, bilinear pairings, B+ tree, cloud storage, data version table