發(fā)布時(shí)間：2018-05-17 21:11

  本文選題：云存儲(chǔ) + 數(shù)據(jù)持有性證明�。� 參考：《鄭州大學(xué)》2013年碩士論文

【摘要】：云時(shí)代迅猛而來(lái),作為IT產(chǎn)業(yè)的下一代體系結(jié)構(gòu),云計(jì)算不僅僅是簡(jiǎn)單的將應(yīng)用軟件和數(shù)據(jù)庫(kù)放到中心化的大規(guī)模數(shù)據(jù)中心,而是具有更大的靈活性,允許任意端點(diǎn)參與云服務(wù)交互,這點(diǎn)體現(xiàn)在云存儲(chǔ)服務(wù)中就是：提供存儲(chǔ)服務(wù)的實(shí)體可能是多種性質(zhì)的提供商的整合。這種異構(gòu)的新特點(diǎn)和對(duì)存儲(chǔ)提供商的不完全可信使得對(duì)云環(huán)境下的數(shù)據(jù)持有性證明的研究愈顯重要。 數(shù)據(jù)持有性證明旨在幫助用戶在使用外包存儲(chǔ)數(shù)據(jù)前對(duì)數(shù)據(jù)完整性進(jìn)行驗(yàn)證,避免用戶因使用污染數(shù)據(jù)而造成經(jīng)濟(jì)社會(huì)損失。之前的相關(guān)研究工作要么缺乏對(duì)數(shù)據(jù)的可公開(kāi)驗(yàn)證或者說(shuō)數(shù)據(jù)可以由第三方進(jìn)行驗(yàn)證的研究,要么未全面考慮云存儲(chǔ)的新特性,而本文的方案對(duì)這兩方面都有探索。 本論文的主要工作有：在詳細(xì)分析闡述云環(huán)境較之傳統(tǒng)P2P環(huán)境出現(xiàn)的新特性的基礎(chǔ)上,構(gòu)建了一種適用于云存儲(chǔ)環(huán)境下的數(shù)據(jù)持有性證明模型CS-PDP。該模型主要采用抽樣檢測(cè)的概率型驗(yàn)證和同態(tài)標(biāo)簽驗(yàn)證方法,同時(shí)加入一個(gè)云存儲(chǔ)提供商代理CSPP,來(lái)協(xié)助用戶與各式各樣異構(gòu)的云存儲(chǔ)提供商進(jìn)行交互,完成數(shù)據(jù)存儲(chǔ)與數(shù)據(jù)完整性驗(yàn)證任務(wù)。而且中間代理CSPP采用可信計(jì)算技術(shù)進(jìn)行構(gòu)建,利用可信基和對(duì)安全審計(jì)日志的操作能在一定程度上保證中間代理的安全性和可信性。 本文針對(duì)提出的模型算法進(jìn)行了理論分析與實(shí)驗(yàn)。通過(guò)理論推導(dǎo)得出本文算法是正確的,只要存儲(chǔ)提供商存儲(chǔ)有用戶的原始數(shù)據(jù),便可以通過(guò)完整性驗(yàn)證。在安全性方面,算法還滿足完備性和隱私性的要求。若存儲(chǔ)服務(wù)商并沒(méi)有存儲(chǔ)原始數(shù)據(jù),且這些數(shù)據(jù)被驗(yàn)證者要求證明其持有性,則服務(wù)商偽造的持有性證明將以極低的概率通過(guò)驗(yàn)證方的驗(yàn)證。同時(shí),發(fā)起挑戰(zhàn)的用戶方或者任何第三方不能夠或從交互信息中提取挖掘出額外的文件信息。模型采用概率型驗(yàn)證使得產(chǎn)生證明的時(shí)間不隨文件大小而增長(zhǎng),一定程度的提升了性能。該模型具有減少計(jì)算、通信及存儲(chǔ)開(kāi)銷的效果。另外,CS-PDP模型支持公開(kāi)驗(yàn)證和允許進(jìn)行任意次持有性驗(yàn)證挑戰(zhàn)。
[Abstract]:As the next generation architecture of the IT industry, cloud computing is not just simply putting applications and databases in a centralized, large-scale data center, but more flexible. Allowing any endpoint to participate in cloud service interactions is reflected in the cloud storage service: the entity providing the storage service may be the integration of a variety of providers. The new characteristics of this heterogeneity and the incomplete trustworthiness of storage providers make it more important to study the proof of data holding in the cloud environment. The purpose of data holding certificate is to help users to verify the integrity of data before using the outsourced storage data and to avoid the economic and social loss caused by the use of contaminated data. Previous studies either lack of publicly verifiable data or data can be verified by a third party, or do not fully consider the new characteristics of cloud storage, and this scheme has explored both aspects. The main work of this thesis is as follows: based on the detailed analysis of the new features of cloud environment compared with the traditional P2P environment, a data holding proof model CS-PDPfor cloud storage environment is constructed. This model mainly uses probabilistic verification and homomorphic label verification method of sampling detection, and adds a cloud storage provider agent CSPPto to assist users to interact with a variety of heterogeneous cloud storage providers. Complete data storage and data integrity verification. Moreover, the intermediate agent CSPP is constructed with trusted computing technology, and the security and credibility of the intermediate agent can be guaranteed to a certain extent by using the trusted base and the operation of the security audit log. In this paper, the theoretical analysis and experiment of the proposed model algorithm are carried out. It is concluded that the algorithm is correct by theoretical derivation. As long as the storage provider stores the original data of the user, it can be verified by the integrity. In terms of security, the algorithm also meets the requirements of completeness and privacy. If the storage service provider does not store the original data and these data are required by the verifier to prove their possession, the false holding certificate of the service provider will be verified by the verifier at a very low probability. At the same time, the challenging user or any third party cannot extract or extract additional file information from the interactive information. Probabilistic verification of the model makes the time of producing proof does not increase with the file size, and improves the performance to a certain extent. The model has the effect of reducing computation, communication and storage overhead. In addition, the CS-PDP model supports open validation and allows for arbitrary holding verification challenges.
【學(xué)位授予單位】：鄭州大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：TP333

【參考文獻(xiàn)】

相關(guān)期刊論文 前6條

1 陳蘭香;;一種基于同態(tài)Hash的數(shù)據(jù)持有性證明方法[J];電子與信息學(xué)報(bào);2011年09期

2 肖達(dá);舒繼武;陳康;鄭緯民;;一個(gè)網(wǎng)絡(luò)歸檔存儲(chǔ)中實(shí)用的數(shù)據(jù)持有性檢查方案[J];計(jì)算機(jī)研究與發(fā)展;2009年10期

3 安寶宇;宮哲;肖達(dá);谷利澤;楊義先;;具有隱式可信第三方的云存儲(chǔ)數(shù)據(jù)持有性審計(jì)[J];哈爾濱工程大學(xué)學(xué)報(bào);2012年08期

4 劉華楠;王世卿;;云存儲(chǔ)中數(shù)據(jù)持有性證明模型的設(shè)計(jì)與分析[J];計(jì)算機(jī)應(yīng)用與軟件;2012年10期

5 譚智勇;司天歌;劉鐸;戴一奇;;基于服務(wù)端存儲(chǔ)的可信計(jì)算模型[J];清華大學(xué)學(xué)報(bào)(自然科學(xué)版)網(wǎng)絡(luò).預(yù)覽;2009年07期

6 馮登國(guó);張敏;張妍;徐震;;云計(jì)算安全研究[J];軟件學(xué)報(bào);2011年01期

相關(guān)碩士學(xué)位論文 前1條

1 柳妃妃;云計(jì)算環(huán)境下可證明數(shù)據(jù)持有技術(shù)研究[D];上海交通大學(xué);2011年

，

本文編號(hào)：1902878