一种高效的多副本数据持有性证明方案  

An efficient multiple-replica data possession checking scheme

作　　者：刘文卓[1] 曹天杰[1] 黄石[1] 

机构地区：[1]中国矿业大学计算机科学与技术学院,江苏徐州221116

出　　处：《山东大学学报（理学版）》2014年第9期160-165,共6页Journal of Shandong University(Natural Science)

摘　　要：为了验证云存储中服务提供商是否完整地存储了用户的数据副本,在分析支持动态数据的持有性证明方案(RDPC)的安全缺陷(无法抵抗替换和重放攻击)的基础上,对其进行了改进和扩展,提出一种基于同态哈希技术的多副本持有性证明方案。该方案能够同时对多个副本的持有性进行验证,具有抵抗替换攻击、重放攻击和伪造攻击的能力。通过对Merkel哈希树进行改进,使方案更好地支持动态数据操作,同时利用γ编码技术,使得对数据块的验证和更新等操作过程中通信的数据量更小。In order to verify whether the users’file replicas were stored by the cloud storage service provider （CSP）,a RDPC that supports dynamic data was improved and expanded by analyzing its weakness,and then an efficient multiple-replica data possession scheme based on the homomorphic hash was proposed.Multiple-replica data possession can be verified simultaneously in the scheme,which can resist the replace attack,replay attack and forgery attack.To support data dynamic better,the Merkle hash tree was improved in the scheme,and the γcode was used to decrease the com-munication bandwith in the process of data blocks checking and update operations.

关 键 词：云存储 多副本持有性验证 同态hash Merkel哈希树 动态数据 

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