云計(jì)算中外包數(shù)據(jù)可驗(yàn)證刪除關(guān)鍵技術(shù)研究
發(fā)布時(shí)間:2023-04-01 13:04
云計(jì)算通過外包技術(shù)將計(jì)算、存儲、網(wǎng)絡(luò)等虛擬資源以按需付費(fèi)的方式提供給用戶,降低用戶資源的使用和管理成本。云存儲是云計(jì)算提供的最具吸引力的服務(wù)之一,它允許資源受限的用戶將本地?zé)o法儲存的數(shù)據(jù)外包到云服務(wù)器,從而大大減輕本地的存儲負(fù)擔(dān)。然而,云存儲中外包數(shù)據(jù)所有權(quán)和管理權(quán)的分離,使得用戶失去了對外包數(shù)據(jù)的物理管控,因而引發(fā)了一系列亟需解決的數(shù)據(jù)安全問題,特別是外包數(shù)據(jù)確定性刪除,已經(jīng)引起了國內(nèi)外學(xué)者的高度關(guān)注。外包數(shù)據(jù)的確定性刪除是外包數(shù)據(jù)生命周期的最后階段,直接決定著外包數(shù)據(jù)生命周期能否可靠終結(jié),對于外包數(shù)據(jù)安全和用戶隱私保護(hù)具有重要的影響和意義。然而,傳統(tǒng)針對本地?cái)?shù)據(jù)的刪除方法不能直接應(yīng)用于云環(huán)境下外包數(shù)據(jù)的刪除。因此,如何實(shí)現(xiàn)云計(jì)算環(huán)境下外包數(shù)據(jù)的可驗(yàn)證刪除成為學(xué)術(shù)界和產(chǎn)業(yè)界面臨的一個(gè)嚴(yán)峻的技術(shù)挑戰(zhàn)。近年來,圍繞外包數(shù)據(jù)刪除結(jié)果的公開可驗(yàn)證性、大規(guī)模外包數(shù)據(jù)刪除的高效性、遷移數(shù)據(jù)刪除的可靠性等方面的需求,許多學(xué)者對外包數(shù)據(jù)可驗(yàn)證刪除技術(shù)進(jìn)行了廣泛的研究。然而,現(xiàn)有的外包數(shù)據(jù)刪除方案仍存在以下幾個(gè)方面的問題和挑戰(zhàn)。首先,在靜態(tài)外包數(shù)據(jù)刪除場景中,現(xiàn)有方案依賴可信第三方進(jìn)行密鑰管理和數(shù)據(jù)刪...
【文章頁數(shù)】:117 頁
【學(xué)位級別】:博士
【文章目錄】:
摘要
ABSTRACT
List of Abbreviations
Chapter 1 Introduction
1.1 Background
1.2 Related Work
1.3 Our Contributions
1.4 Organization
Chapter 2 Preliminaries
2.1 Bilinear Pairings
2.2 Merkle Sum Hash Tree
2.3 Blockchain Technology
2.4 Vector Commitment
2.5 Counting Bloom Filter
2.6 Invertible Bloom Filter
2.7 Summary
Chapter 3 Publicly Verifiable Data Deletion Scheme based on Blockchain
3.1 Overview
3.2 Our Proposed Scheme
3.2.1 System Model
3.2.2 Main Idea
3.2.3 The Concrete Construction
3.3 Analysis of Our Scheme
3.3.1 Security Analysis
3.3.2 Efficiency Analysis and Comparison
3.4 Performance Evaluation
3.5 Summary
Chapter 4 Verifiable Data Deletion Scheme with Insertion Operation from MerkleSum Hash Tree
4.1 Overview
4.2 Our Proposed Scheme
4.2.1 Main Idea
4.2.2 The Concrete Construction
4.3 Analysis of Our Scheme
4.3.1 Security Analysis
4.3.2 Efficiency Analysis and Comparison
4.4 Performance Evaluation
4.5 Summary
Chapter 5 Verifiable Data Deletion Supporting Secure Data Transfer from VectorCommitment
5.1 Overview
5.2 Our Proposed Scheme
5.2.1 System Model
5.2.2 Main Idea
5.2.3 The Concrete Construction
5.3 Analysis of Our Scheme
5.3.1 Security Analysis
5.3.2 Efficiency Analysis and Comparison
5.4 Performance Evaluation
5.5 Summary
Chapter 6 Verifiable Data Deletion Scheme with Efficient Data Transfer from Count-ing Bloom Filter
6.1 Overview
6.2 The Basic Scheme
6.2.1 Main Idea
6.2.2 The Concrete Construction
6.2.3 Security Analysis
6.3 The Enhanced Scheme
6.3.1 The Concrete Construction
6.3.2 Efficiency Analysis and Comparison
6.4 Performance Evaluation
6.5 Summary
Chapter 7 Conclusion and Future Work
7.1 Conclusion
7.2 Future Work
Bibliography
Acknowledgement
作者簡介
本文編號:3777195
【文章頁數(shù)】:117 頁
【學(xué)位級別】:博士
【文章目錄】:
摘要
ABSTRACT
List of Abbreviations
Chapter 1 Introduction
1.1 Background
1.2 Related Work
1.3 Our Contributions
1.4 Organization
Chapter 2 Preliminaries
2.1 Bilinear Pairings
2.2 Merkle Sum Hash Tree
2.3 Blockchain Technology
2.4 Vector Commitment
2.5 Counting Bloom Filter
2.6 Invertible Bloom Filter
2.7 Summary
Chapter 3 Publicly Verifiable Data Deletion Scheme based on Blockchain
3.1 Overview
3.2 Our Proposed Scheme
3.2.1 System Model
3.2.2 Main Idea
3.2.3 The Concrete Construction
3.3 Analysis of Our Scheme
3.3.1 Security Analysis
3.3.2 Efficiency Analysis and Comparison
3.4 Performance Evaluation
3.5 Summary
Chapter 4 Verifiable Data Deletion Scheme with Insertion Operation from MerkleSum Hash Tree
4.1 Overview
4.2 Our Proposed Scheme
4.2.1 Main Idea
4.2.2 The Concrete Construction
4.3 Analysis of Our Scheme
4.3.1 Security Analysis
4.3.2 Efficiency Analysis and Comparison
4.4 Performance Evaluation
4.5 Summary
Chapter 5 Verifiable Data Deletion Supporting Secure Data Transfer from VectorCommitment
5.1 Overview
5.2 Our Proposed Scheme
5.2.1 System Model
5.2.2 Main Idea
5.2.3 The Concrete Construction
5.3 Analysis of Our Scheme
5.3.1 Security Analysis
5.3.2 Efficiency Analysis and Comparison
5.4 Performance Evaluation
5.5 Summary
Chapter 6 Verifiable Data Deletion Scheme with Efficient Data Transfer from Count-ing Bloom Filter
6.1 Overview
6.2 The Basic Scheme
6.2.1 Main Idea
6.2.2 The Concrete Construction
6.2.3 Security Analysis
6.3 The Enhanced Scheme
6.3.1 The Concrete Construction
6.3.2 Efficiency Analysis and Comparison
6.4 Performance Evaluation
6.5 Summary
Chapter 7 Conclusion and Future Work
7.1 Conclusion
7.2 Future Work
Bibliography
Acknowledgement
作者簡介
本文編號:3777195
本文鏈接:http://sikaile.net/kejilunwen/ruanjiangongchenglunwen/3777195.html
最近更新
教材專著