基于Hash聚合动态数据持有性方案安全性分析  

Security analysis of dynamic provable data possession based on Hash aggregation

作　　者：邹静 李斌[2] 张利[2] 骆扬[2] 孙运传 李世贤 

机构地区：[1]国网北京经济技术研究院,北京102209 [2]中国信息安全测评中心,北京100085

出　　处：《清华大学学报（自然科学版）》2017年第11期1145-1149,1158,共6页Journal of Tsinghua University(Science and Technology)

基　　金：国网北京经济技术研究院项目(ZZKJ-2017-10)

摘　　要：为了防止数据丢失、修改或破坏等,需要对存储在云端的远程数据进行持有性验证。云端动态数据可持有性是当前云数据安全领域的研究热点之一。该文针对已有典型基于Hash聚合动态数据持有性证明方案,分析其验证过程存在的安全问题及其产生原因。结果表明:Hash聚合方法能有效减少由于数据动态操作而增加的数据存储量、计算量、传输量等验证成本,但是如果忽略对于数据块位置与数据块值对应关系的验证则会面临替换攻击,导致严重的安全问题。Dynamic provable data possession （DPDP） schemes are important in cloud data security to prevent the data from being lost, modified or corrupted. This paper presents security analyse of some existing schemes based on Hash security problems in the known aggregation and points out some methods and their fundamental reasons. The analyse show that Hash aggregation can effectively reduce storage, computation and transmission costs of verification due for data dynamic operations. One scheme had security vulnerabilities when verifying the relation between the position and the value of a data block that can allow a substitution attack.

关 键 词：动态数据持有性证明 MERKLE树 Hash聚合 跳表 

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]