基于B+树的动态数据持有性证明方案

针对云存储环境下的数据持有性证明（PDP）方案效率较低、不能很好支持全动态更新的问题，设计了一种基于B⁺树的动态数据持有性证明方案。该方案引入双线性对技术和数据版本表，支持用户进行数据块级的细粒度动态操作并能保护用户的数据隐私。通过优化系统模型并设计节点索引值，使第三方检测机构能识别错误数据并进行精确定位。理论分析及实验结果表明，与基于Merkel哈希树（MHT）的方案相比，所提方案能够显著降低系统构造认证数据结构的时间开销，并且简化了动态更新过程，提高了第三方检测机构的验证效率。

Dynamic provable data possession scheme based on B+ tree

Concerning the problem that the existing schemes of provable data possession are inefficient and can not support full dynamic update, a novel dynamic provable data possession scheme based on B⁺ tree was proposed. Bilinear pairing techniques and data version table were 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 could identify the wrong data and locate it accurately by optimizing the system model and designing the retrieved value of data node. In comparison with the scheme based on the Merkel Hash Tree (MHT), theoretical analysis and experimental results show that the proposed scheme can significantly reduce the cost of constructing the authentication data structure, simplify the dynamic update process, and improve the verification efficiency of the third party auditor.