發(fā)布時(shí)間：2018-04-14 02:23

  本文選題：可搜索加密 + 索引結(jié)構(gòu)��； 參考：《電子科技大學(xué)》2016年碩士論文

【摘要】：云服務(wù)提供了便捷、高效的訪問與管理。隨著云計(jì)算的快速發(fā)展,越來越多的企業(yè)與用戶將他們的數(shù)據(jù)存儲(chǔ)到云中。安全與隱私問題是云存儲(chǔ)服務(wù)中一個(gè)重要的問題,阻礙了云計(jì)算的廣泛應(yīng)用。為了保護(hù)自己的數(shù)據(jù),數(shù)據(jù)擁有者選擇將重要數(shù)據(jù)傳輸?shù)皆品⻊?wù)器上之前進(jìn)行加密。但是如何使用加密的數(shù)據(jù)成為了一個(gè)挑戰(zhàn),為此出現(xiàn)了可搜索加密技術(shù)�？伤阉骷用苁侵冈诩用艿臄�(shù)據(jù)上進(jìn)行查找的一種技術(shù),只返回與查詢相關(guān)的一部分?jǐn)?shù)據(jù),而無需下載全部數(shù)據(jù),可以顯著的降低開銷。本文以可搜索加密中的數(shù)據(jù)庫(kù)模型為基礎(chǔ),以多維數(shù)據(jù)范圍查詢出發(fā)點(diǎn),提出了兩個(gè)方案來分別解決可搜索加密中的兩個(gè)問題:第一個(gè)問題是如何建立一個(gè)高效的索引來執(zhí)行可搜索加密,第二個(gè)問題是如何驗(yàn)證服務(wù)器是否返回了正確的結(jié)果。本文的主要貢獻(xiàn)和創(chuàng)新如下:(1)首先針對(duì)可搜索加密中多維數(shù)據(jù)的查詢問題,提出一種基于BSS樹的可搜索加密方案。該方案使用基于坐標(biāo)系的數(shù)據(jù)劃分方式,將包含所有數(shù)據(jù)的坐標(biāo)矩形區(qū)域劃分成多個(gè)小區(qū)域,并生成二進(jìn)制序列用來建立索引。在查詢時(shí),用戶依據(jù)劃分規(guī)則生成陷門,然后交給服務(wù)器進(jìn)行查詢。本方案中的索引是基于二叉樹的一種樹形結(jié)構(gòu),能夠顯著的提高查詢效率。同時(shí)本方案能夠有效的減少用戶的存儲(chǔ)開銷,這對(duì)于那些擁有較低計(jì)算性能和存儲(chǔ)空間的硬件設(shè)備非常適用。此外,本方案支持?jǐn)?shù)據(jù)的動(dòng)態(tài)更新并可以在并行算法模型下進(jìn)行操作。在服務(wù)器端,我們通過加密數(shù)據(jù)和加密索引來保證數(shù)據(jù)的安全。(2)在第一個(gè)方案的基礎(chǔ)上,提出可搜索加密中的可驗(yàn)證問題。可驗(yàn)證是近年來比較重要的研究課題。本文將采用一種叫做不可區(qū)分混淆的方法,構(gòu)建一個(gè)用于服務(wù)器查詢索引的算法,服務(wù)器無法獲知該算法的具體內(nèi)容,因此無法偽造該算法的輸出,因而保證了服務(wù)器只需執(zhí)行該算法,然后客戶端驗(yàn)證并判斷服務(wù)器的輸出,就可知道返回的結(jié)果是否正確。最后,我們證明了兩個(gè)方案的安全性,對(duì)系統(tǒng)的檢索、驗(yàn)證算法的性能進(jìn)行了分析。
[Abstract]:Cloud services provide convenient, efficient access and management.With the rapid development of cloud computing, more and more enterprises and users store their data in the cloud.Security and privacy is an important problem in cloud storage service, which hinders the wide application of cloud computing.To protect their data, the data owner chooses to encrypt important data before transferring it to the cloud server.But how to use encrypted data has become a challenge, for which a searchable encryption technology has emerged.Searchable encryption is a technique for searching encrypted data. It only returns part of the data related to the query without downloading all the data, which can significantly reduce the overhead.Based on the database model in searchable encryption, this paper starts from the multidimensional data range query.Two schemes are proposed to solve the two problems in searchable encryption: the first is how to build an efficient index to perform searchable encryption, and the second is how to verify that the server returns the correct result.The main contributions and innovations of this paper are as follows: (1) aiming at the query problem of multidimensional data in searchable encryption, a searchable encryption scheme based on BSS tree is proposed.In this scheme, the coordinate rectangular region containing all the data is divided into several small regions by using the method of data partitioning based on coordinate system, and binary sequences are generated to build the index.In the query, the user generates the trap door according to the partition rule, and then gives it to the server for query.The index in this scheme is a tree structure based on binary tree, which can improve query efficiency significantly.At the same time, this scheme can effectively reduce the storage cost of users, which is very suitable for those hardware devices with low computing performance and storage space.In addition, the scheme supports the dynamic updating of data and can be operated under the parallel algorithm model.On the server side, we guarantee the security of data by encrypting data and encrypting index.) on the basis of the first scheme, we propose the problem of verifiability in searchable encryption.Verifiability is an important research topic in recent years.In this paper, a method called indiscernibility confusion is used to construct an algorithm for querying the index of the server. The server can not know the exact contents of the algorithm, so it can not forge the output of the algorithm.Therefore, the server only needs to execute the algorithm, then the client verifies and judges the output of the server, and then can know whether the returned results are correct or not.Finally, we prove the security of the two schemes and analyze the performance of the retrieval and verification algorithms.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2016
【分類號(hào)】：TP333;TP309.7

【相似文獻(xiàn)】

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

1 陳紅艷;;淺談索引的使用[J];科技資訊;2007年16期

2 馮亞麗;丁良奎;劉永江;王興兆;;多格式海量數(shù)據(jù)統(tǒng)一存取的索引結(jié)構(gòu)[J];計(jì)算機(jī)應(yīng)用研究;2013年06期

3 黃恩祝;;索引系統(tǒng)結(jié)構(gòu)的三個(gè)重要規(guī)律[J];圖書館學(xué)通訊;1988年01期

4 楊燁;;SQL Server索引性能分析[J];武漢船舶職業(yè)技術(shù)學(xué)院學(xué)報(bào);2008年02期

5 劉鳳晨;黃河;劉慶文;丁永生;;隨機(jī)跳躍索引:一種支持隨機(jī)插入的可信賴索引[J];計(jì)算機(jī)學(xué)報(bào);2009年05期

6 田宏武;王成;喬曉軍;;一種基于索引結(jié)構(gòu)的多語言界面實(shí)現(xiàn)方法[J];微計(jì)算機(jī)信息;2010年05期

7 羅彬;基于MS SQL Server的索引研究與應(yīng)用[J];大連民族學(xué)院學(xué)報(bào);2001年03期

8 祝曉坤,賈永紅;基于多層索引結(jié)構(gòu)的聯(lián)合熵算法研究[J];測(cè)繪信息與工程;2005年05期

9 章德斌;曹麗君;梁永欣;張忠平;;支持k近鄰查詢的X*樹索引結(jié)構(gòu)[J];計(jì)算機(jī)工程與應(yīng)用;2011年05期

10 陳瀟;;SQL Server中索引的建立與分析[J];科技信息;2012年36期

相關(guān)會(huì)議論文 前10條

1 汪衛(wèi);王勇;王宇君;施伯樂;;一維動(dòng)態(tài)區(qū)間索引結(jié)構(gòu)[A];數(shù)據(jù)庫(kù)研究進(jìn)展97——第十四屆全國(guó)數(shù)據(jù)庫(kù)學(xué)術(shù)會(huì)議論文集（上）[C];1997年

2 曹奎;馮玉才;袁芳;;一種支持基于內(nèi)容的圖像檢索的多維索引結(jié)構(gòu)[A];第十八屆全國(guó)數(shù)據(jù)庫(kù)學(xué)術(shù)會(huì)議論文集（研究報(bào)告篇）[C];2001年

3 劉顯敏;李建中;王宏志;劉雨洋;駱吉洲;;SAJ:以最小化空間代價(jià)為目標(biāo)的F&B索引構(gòu)建算法[A];第二十三屆中國(guó)數(shù)據(jù)庫(kù)學(xué)術(shù)會(huì)議論文集（研究報(bào)告篇）[C];2006年

4 肖偉器;馮玉才;;數(shù)據(jù)庫(kù)索引結(jié)構(gòu)的測(cè)試技術(shù)[A];第十一屆全國(guó)數(shù)據(jù)庫(kù)學(xué)術(shù)會(huì)議論文集[C];1993年

5 謝閩峰;汪衛(wèi);施伯樂;;集合索引結(jié)構(gòu)及其聯(lián)接操作[A];第二十屆全國(guó)數(shù)據(jù)庫(kù)學(xué)術(shù)會(huì)議論文集（技術(shù)報(bào)告篇）[C];2003年

6 張s，

本文編號(hào)：1747305