R-ASL算法的研究及其在动态数据持有证明中的应用

发布时间：2018-05-19 15:19

本文选题：云计算 + 云存储　；参考：《东北大学》2012年硕士论文

【摘要】：为用户提供海量的按需存储服务是云计算的重要应用之一。用户经常会将其大容量数据,例如档案文件、天文数据、气象数据等委托给云服务提供商(Cloud Service Provider,CSP)进行存储和管理,但由于客户数据是放置在CSP的控制域内,而不是客户控制域内,客户很难相信数据不会被CSP或系统管理员所获取和伪造,即客户无法确定其存储在CSP中的数据是否完整。而当前的网络安全机制已不能满足云存储下数据的完整性验证需求。针对云存储中数据的完整性验证问题,目前的解决方案主要有两类：1)将数据全部下载之后再进行完整性验证,但是数据的下载操作不仅需要向CSP支付费用,同时还会占用用户自身的网络带宽和存储空间；2)数据持有证明(Provable Data Possession,PDP)方法,该方法通过某种知识证明协议或概率分析手段,允许用户不用下载全部数据,仅需要下载较少数据就能以高置信概率判断整个外包存储数据的完整性。但是,该方法仅支持静态数据的完整性验证,对于动态数据的完整性验证支持不够。针对当前的数据完整性验证方案不支持动态更新的问题,本文提出一种支持数据动态更新的新型完整性验证方案——动态数据持有证明方案(Dynamic Provable Data Possession, DPDP)。DPDP方案在实现数据完整性验证功能的同时,支持数据的插入、修改和删除操作。为构建满足实际应用需求的DPDP方案,本文提出一种新型认证数据结构——基于查询级的认证跳表(Rank based Authenticated Skip List, R-ASL)。R-ASL引入了查询级的概念,并使用新的哈希方法,不仅能够完成数据的完整性验证,还支持数据的动态更新。论文首先给出了R-ASL的形式化定义以及哈希方法的实现方式,然后设计并实现了R-ASL的查询、验证以及更新算法,并将R-ASL应用到DPDP中,并对其相关性能进行了实验分析。实验分析证明,DPDP方案为实现动态更新而引起的通信代价和计算代价可以接受的。
[Abstract]:Providing users with massive on-demand storage services is one of the important applications of cloud computing. Users often delegate their bulk data, such as archival files, astronomical data, meteorological data, to cloud Service providers for storage and management, but because customer data is placed in the CSP control domain, It is difficult for customers to believe that data will not be obtained and falsified by CSP or system administrators, that is, customers cannot determine whether the data stored in CSP is complete or not. However, the current network security mechanism can not meet the needs of data integrity verification under cloud storage. In view of the problem of data integrity verification in cloud storage, there are mainly two kinds of solutions: 1: 1) download the data to verify the integrity of the data, but the downloading operation of the data not only needs to pay a fee to CSP. It also takes up the user's own network bandwidth and storage space) Provable Data possessionPs (PDPs) method, which allows users not to download all data through some kind of knowledge proof protocol or probabilistic analysis method. The integrity of the whole outsourced storage data can be judged by high confidence probability only by downloading less data. However, this method only supports static data integrity verification, but not dynamic data integrity verification. For the problem that the current data integrity verification scheme does not support dynamic updates, In this paper, a new integrity verification scheme, dynamic Provable Data Possession, DPDP).DPDP scheme, which supports data dynamic updating, is proposed. The dynamic Provable Data Possession, DPDP).DPDP scheme supports the insertion, modification and deletion of data at the same time as the function of data integrity verification. In order to construct a DPDP scheme to meet the requirements of practical applications, this paper proposes a new authentication data structure, which is based on query level, which introduces the concept of query level into the authentication hop table Rank based Authenticated Skip List, R-ASL).R-ASL, and uses a new hash method. Not only can complete the data integrity verification, but also support the dynamic update of data. This paper first gives the formal definition of R-ASL and the implementation of hash method, then designs and implements the query, verification and update algorithm of R-ASL, and applies R-ASL to DPDP, and analyzes its performance experimentally. The experimental results show that the communication cost and computational cost caused by the DDP scheme are acceptable.
【学位授予单位】：东北大学
【学位级别】：硕士
【学位授予年份】：2012
【分类号】：TP333

【参考文献】