云計算中數(shù)據(jù)存儲的完整性校驗?zāi)Ｐ脱芯?/H1>
發(fā)布時間：2018-02-27 13:23
本文關(guān)鍵詞： 云存儲 數(shù)據(jù)完整性驗證 Counting Bloom Filter 出處：《東華大學(xué)》2013年碩士論文 論文類型：學(xué)位論文
【摘要】：隨著云計算的迅速發(fā)展,越來越多的數(shù)據(jù)被存放在云服務(wù)器中。云存儲作為一種新型的存儲服務(wù),所具有的高可擴展性、高可靠性、價格低廉和可隨時隨地接入訪問的特點,為海量數(shù)據(jù)的存儲管理提供了全新的模式。但是,由于用戶把數(shù)據(jù)都托管給了云服務(wù)商,失去了對數(shù)據(jù)的本地監(jiān)管控制權(quán),因此面臨著很多挑戰(zhàn)。其中一個重要的問題,就是用戶如何確定存放在云服務(wù)器中的數(shù)據(jù)是完整的。傳統(tǒng)的數(shù)據(jù)完整性校驗方法需要將數(shù)據(jù)下載到本地才能進行驗證。由于云存儲中數(shù)據(jù)量極大,下載數(shù)據(jù)塊將帶來很大的網(wǎng)絡(luò)負(fù)擔(dān),因此傳統(tǒng)的方法和技術(shù)并不適用于云存儲環(huán)境。目前,已有的針對云存儲中數(shù)據(jù)完整性校驗算法中以基于RSA公鑰技術(shù)的算法較為優(yōu)秀,它們以數(shù)據(jù)塊為基本校驗單元,具有無限次校驗、校驗時隱私保護、通信開銷低等特性。但由于算法中大量模指數(shù)運算,其計算開銷很大。且考慮到各方開銷,算法中數(shù)據(jù)分塊大小受到較為嚴(yán)格的限制。 考慮到云存儲中數(shù)據(jù)的動態(tài)性,即數(shù)據(jù)塊在存儲期間會多次發(fā)生修改、刪除等更新操作,使得原來計算的校驗元失效而頻繁更新,進一步加重計算開銷。本文在支持第三方驗證的基礎(chǔ)上,提出了一種基于Counting Bloom Filter(CBF)的數(shù)據(jù)完整性校驗算法,用于高效地校驗云存儲中動態(tài)數(shù)據(jù)的完整性。由于數(shù)據(jù)的動態(tài)性使得同一塊數(shù)據(jù)校驗無需進行無限次,算法通過使用速度很快的哈希技術(shù),避免使用基于RSA公鑰技術(shù)算法中大量模指數(shù)運算,有效降低了計算開銷。同時,本文利用CBF空間效率高的特點,提出了概率性的校驗元,以很小的概率損失實現(xiàn)了校驗值的壓縮,節(jié)約了存儲和通信開銷。另外,相對于基于RSA公鑰技術(shù)的算法,本算法中數(shù)據(jù)分塊大小對整體開銷的影響大大降低。最后通過理論分析和模擬實驗表明,算法在數(shù)據(jù)動態(tài)變化環(huán)境下,以較低的存儲空間代價實現(xiàn)了在文件生命周期內(nèi)輕量級的完整性校驗,尤其是在挑戰(zhàn)-應(yīng)答過程中,降低了云服務(wù)器和第三方驗證方在計算方面的開銷。
[Abstract]:With the rapid development of cloud computing, more and more data are stored in cloud servers. As a new storage service, cloud storage has the characteristics of high scalability, high reliability, low price and easy access. Provides a new model for the storage and management of massive data. However, because users host data to cloud service providers and lose local regulatory control over the data, they face many challenges. Is how the user determines that the data stored in the cloud server is complete. Traditional data integrity verification methods need to download the data to the local to verify. Downloading data blocks will bring great network burden, so traditional methods and techniques are not suitable for cloud storage environment. At present, the existing algorithms based on RSA public key technology for data integrity verification in cloud storage are excellent. They take the data block as the basic check unit, have the characteristics of infinite check, privacy protection during checking, low communication overhead, etc. However, due to a large number of modular exponent operations in the algorithm, the computation cost is very large. The size of the data block in the algorithm is strictly limited. Considering the dynamic nature of the data in cloud storage, that is, the updating operations such as data blocks will be modified and deleted many times during storage, which makes the original calculated checkpoints fail and update frequently. In this paper, a data integrity verification algorithm based on Counting Bloom filter is proposed based on the support of third party verification. It is used to verify the integrity of dynamic data in cloud storage efficiently. Because of the dynamic nature of data, the same block of data need not be checked infinitely. In order to avoid the use of a large number of modular exponent operations in the algorithm based on RSA public key technology, the computational overhead is effectively reduced. At the same time, a probabilistic check element is proposed in this paper, which makes use of the high efficiency of CBF space. In addition, compared with the algorithm based on RSA public key technology, the compression of check value is realized with very small probability loss, and the storage and communication overhead is saved. In this algorithm, the effect of data block size on the overall overhead is greatly reduced. Finally, theoretical analysis and simulation experiments show that the algorithm is in the dynamic environment of data change. Lightweight integrity verification is implemented in the file lifecycle at a lower storage cost, especially in the challenging response process, which reduces the computational overhead of cloud servers and third-party verifiers.
【學(xué)位授予單位】：東華大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2013
【分類號】：TP333
【參考文獻】
相關(guān)期刊論文 前5條
1 陳蘭香;;一種基于同態(tài)Hash的數(shù)據(jù)持有性證明方法[J];電子與信息學(xué)報;2011年09期
2 肖達(dá);舒繼武;陳康;鄭緯民;;一個網(wǎng)絡(luò)歸檔存儲中實用的數(shù)據(jù)持有性檢查方案[J];計算機研究與發(fā)展;2009年10期
3 謝鯤;文吉剛;張大方;謝高崗;;布魯姆過濾器查詢算法[J];軟件學(xué)報;2009年01期
4 陳龍;王國胤;;一種細(xì)粒度數(shù)據(jù)完整性檢驗方法[J];軟件學(xué)報;2009年04期
5 馮登國;張敏;張妍;徐震;;云計算安全研究[J];軟件學(xué)報;2011年01期
相關(guān)博士學(xué)位論文 前1條
1 陳龍;計算機取證的安全性及取證推理研究[D];西南交通大學(xué);2009年
相關(guān)碩士學(xué)位論文 前2條
1 婁曉會;細(xì)粒度數(shù)據(jù)完整性檢驗方法研究[D];重慶郵電大學(xué);2011年
2 胡欽超;外包存儲環(huán)境下完整性檢測方案的研究[D];電子科技大學(xué);2010年
，
本文編號：1542840
本文鏈接：http://sikaile.net/kejilunwen/jisuanjikexuelunwen/1542840.html
本文關(guān)鍵詞： 云存儲 數(shù)據(jù)完整性驗證 Counting Bloom Filter 出處：《東華大學(xué)》2013年碩士論文 論文類型：學(xué)位論文
【摘要】：隨著云計算的迅速發(fā)展,越來越多的數(shù)據(jù)被存放在云服務(wù)器中。云存儲作為一種新型的存儲服務(wù),所具有的高可擴展性、高可靠性、價格低廉和可隨時隨地接入訪問的特點,為海量數(shù)據(jù)的存儲管理提供了全新的模式。但是,由于用戶把數(shù)據(jù)都托管給了云服務(wù)商,失去了對數(shù)據(jù)的本地監(jiān)管控制權(quán),因此面臨著很多挑戰(zhàn)。其中一個重要的問題,就是用戶如何確定存放在云服務(wù)器中的數(shù)據(jù)是完整的。傳統(tǒng)的數(shù)據(jù)完整性校驗方法需要將數(shù)據(jù)下載到本地才能進行驗證。由于云存儲中數(shù)據(jù)量極大,下載數(shù)據(jù)塊將帶來很大的網(wǎng)絡(luò)負(fù)擔(dān),因此傳統(tǒng)的方法和技術(shù)并不適用于云存儲環(huán)境。目前,已有的針對云存儲中數(shù)據(jù)完整性校驗算法中以基于RSA公鑰技術(shù)的算法較為優(yōu)秀,它們以數(shù)據(jù)塊為基本校驗單元,具有無限次校驗、校驗時隱私保護、通信開銷低等特性。但由于算法中大量模指數(shù)運算,其計算開銷很大。且考慮到各方開銷,算法中數(shù)據(jù)分塊大小受到較為嚴(yán)格的限制。 考慮到云存儲中數(shù)據(jù)的動態(tài)性,即數(shù)據(jù)塊在存儲期間會多次發(fā)生修改、刪除等更新操作,使得原來計算的校驗元失效而頻繁更新,進一步加重計算開銷。本文在支持第三方驗證的基礎(chǔ)上,提出了一種基于Counting Bloom Filter(CBF)的數(shù)據(jù)完整性校驗算法,用于高效地校驗云存儲中動態(tài)數(shù)據(jù)的完整性。由于數(shù)據(jù)的動態(tài)性使得同一塊數(shù)據(jù)校驗無需進行無限次,算法通過使用速度很快的哈希技術(shù),避免使用基于RSA公鑰技術(shù)算法中大量模指數(shù)運算,有效降低了計算開銷。同時,本文利用CBF空間效率高的特點,提出了概率性的校驗元,以很小的概率損失實現(xiàn)了校驗值的壓縮,節(jié)約了存儲和通信開銷。另外,相對于基于RSA公鑰技術(shù)的算法,本算法中數(shù)據(jù)分塊大小對整體開銷的影響大大降低。最后通過理論分析和模擬實驗表明,算法在數(shù)據(jù)動態(tài)變化環(huán)境下,以較低的存儲空間代價實現(xiàn)了在文件生命周期內(nèi)輕量級的完整性校驗,尤其是在挑戰(zhàn)-應(yīng)答過程中,降低了云服務(wù)器和第三方驗證方在計算方面的開銷。
[Abstract]:With the rapid development of cloud computing, more and more data are stored in cloud servers. As a new storage service, cloud storage has the characteristics of high scalability, high reliability, low price and easy access. Provides a new model for the storage and management of massive data. However, because users host data to cloud service providers and lose local regulatory control over the data, they face many challenges. Is how the user determines that the data stored in the cloud server is complete. Traditional data integrity verification methods need to download the data to the local to verify. Downloading data blocks will bring great network burden, so traditional methods and techniques are not suitable for cloud storage environment. At present, the existing algorithms based on RSA public key technology for data integrity verification in cloud storage are excellent. They take the data block as the basic check unit, have the characteristics of infinite check, privacy protection during checking, low communication overhead, etc. However, due to a large number of modular exponent operations in the algorithm, the computation cost is very large. The size of the data block in the algorithm is strictly limited. Considering the dynamic nature of the data in cloud storage, that is, the updating operations such as data blocks will be modified and deleted many times during storage, which makes the original calculated checkpoints fail and update frequently. In this paper, a data integrity verification algorithm based on Counting Bloom filter is proposed based on the support of third party verification. It is used to verify the integrity of dynamic data in cloud storage efficiently. Because of the dynamic nature of data, the same block of data need not be checked infinitely. In order to avoid the use of a large number of modular exponent operations in the algorithm based on RSA public key technology, the computational overhead is effectively reduced. At the same time, a probabilistic check element is proposed in this paper, which makes use of the high efficiency of CBF space. In addition, compared with the algorithm based on RSA public key technology, the compression of check value is realized with very small probability loss, and the storage and communication overhead is saved. In this algorithm, the effect of data block size on the overall overhead is greatly reduced. Finally, theoretical analysis and simulation experiments show that the algorithm is in the dynamic environment of data change. Lightweight integrity verification is implemented in the file lifecycle at a lower storage cost, especially in the challenging response process, which reduces the computational overhead of cloud servers and third-party verifiers.
【學(xué)位授予單位】：東華大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2013
【分類號】：TP333
【參考文獻】
相關(guān)期刊論文 前5條
1 陳蘭香;;一種基于同態(tài)Hash的數(shù)據(jù)持有性證明方法[J];電子與信息學(xué)報;2011年09期
2 肖達(dá);舒繼武;陳康;鄭緯民;;一個網(wǎng)絡(luò)歸檔存儲中實用的數(shù)據(jù)持有性檢查方案[J];計算機研究與發(fā)展;2009年10期
3 謝鯤;文吉剛;張大方;謝高崗;;布魯姆過濾器查詢算法[J];軟件學(xué)報;2009年01期
4 陳龍;王國胤;;一種細(xì)粒度數(shù)據(jù)完整性檢驗方法[J];軟件學(xué)報;2009年04期
5 馮登國;張敏;張妍;徐震;;云計算安全研究[J];軟件學(xué)報;2011年01期
相關(guān)博士學(xué)位論文 前1條
1 陳龍;計算機取證的安全性及取證推理研究[D];西南交通大學(xué);2009年
相關(guān)碩士學(xué)位論文 前2條
1 婁曉會;細(xì)粒度數(shù)據(jù)完整性檢驗方法研究[D];重慶郵電大學(xué);2011年
2 胡欽超;外包存儲環(huán)境下完整性檢測方案的研究[D];電子科技大學(xué);2010年
，本文編號：1542840
本文鏈接：http://sikaile.net/kejilunwen/jisuanjikexuelunwen/1542840.html
最近更新
教材專著
