【摘要】：隨著相關(guān)領(lǐng)域技術(shù)與產(chǎn)業(yè)的發(fā)展,我們迎來了大數(shù)據(jù)時(shí)代。大數(shù)據(jù)技術(shù)的戰(zhàn)略意義在于,通過專業(yè)化處理可以從海量數(shù)據(jù)中發(fā)掘出潛在的價(jià)值,從而為分析、預(yù)測(cè)及決策提供可靠的依據(jù)。因此,大數(shù)據(jù)相關(guān)產(chǎn)業(yè)的發(fā)展受到各國政府的極大重視。然而數(shù)據(jù)采集、清洗、存儲(chǔ)和分析依賴于昂貴的專業(yè)設(shè)施,對(duì)個(gè)人與中小企業(yè)來說難以負(fù)擔(dān)設(shè)備購買與維護(hù)的開銷。云計(jì)算作為新興的服務(wù)計(jì)算模式,為用戶提供便捷的數(shù)據(jù)存儲(chǔ)、數(shù)據(jù)處理、信息共享和虛擬化服務(wù),目前已成為大數(shù)據(jù)工程的理想解決方案。用戶可以將自己的數(shù)據(jù)外包給云服務(wù)提供商,隨后根據(jù)自己的需求來獲取相應(yīng)的數(shù)據(jù),或者獲取基于數(shù)據(jù)的服務(wù),這一模式一般成為外包計(jì)算。然而制約外包數(shù)據(jù)服務(wù)推廣的一個(gè)重要因素在于對(duì)數(shù)據(jù)安全和隱私的擔(dān)憂,特別是金融、醫(yī)療等敏感領(lǐng)域,如果數(shù)據(jù)遭到云服務(wù)提供商的濫用或泄漏,將會(huì)給用戶造成重大的損失。密碼學(xué)是保證數(shù)據(jù)隱私的基礎(chǔ)工具,然而傳統(tǒng)的加密方案雖可以確保數(shù)據(jù)的隱私性,但是加密會(huì)限制數(shù)據(jù)的可用性,使得云失去了對(duì)數(shù)據(jù)處理、分析和挖掘的能力。因此在云環(huán)境下需要設(shè)計(jì)新的密碼學(xué)原語,使之既能保證數(shù)據(jù)隱私性,又能允許云服務(wù)提供商能夠?qū)?shù)據(jù)做特定的操作�？伤阉骷用苁窃朴�(jì)算環(huán)境中確保存儲(chǔ)安全與數(shù)據(jù)隱私的重要密碼學(xué)原語,當(dāng)用戶將文檔加密上傳云端后,它可以按照用戶的查找條件進(jìn)行搜索并獲取所需要的密文文檔,同時(shí)保證云服務(wù)器僅能獲得極少的信息。早期可搜索加密方案的研究集中在安全性、搜索效率和更廣泛的搜索表意等方面,近年來的研究開始關(guān)注數(shù)據(jù)集可動(dòng)態(tài)更新的對(duì)稱可搜索加密方案。本文提出了一個(gè)新的動(dòng)態(tài)對(duì)稱可搜索加密方案,在運(yùn)行效率方面,該方案搜索算法的時(shí)間復(fù)雜度為O(1),而文檔增加和刪除操作的時(shí)間復(fù)雜度為O(m"n)和0(N)(其中m"表示新增文檔的關(guān)鍵詞個(gè)數(shù),N表示文檔-關(guān)鍵字配對(duì)數(shù),n表示字典大小),整體效率優(yōu)于現(xiàn)有方案;在安全性方面,該方案可以抵抗選擇關(guān)鍵詞攻擊,且與之前方案相比本文方案做到了更少的信息泄漏。目前可搜索加密的一個(gè)顯著缺陷在于,通常方案都是以單詞為單位作為查詢條件,這對(duì)于黏著語語料庫并不適用,其原因在于這類語言是由語素組成長字符串來表示語義。因此搜索此類語言需要以字符為單位進(jìn)行處理。我們選取最長公共子序列作為評(píng)定字符串相似度的依據(jù),利用部分同態(tài)加密為基本密碼學(xué)原語,構(gòu)造了在密文下求解最長公共字串的方案。該方案具有顯著的高效性和可拓展性,實(shí)現(xiàn)該方案僅需對(duì)數(shù)級(jí)深度的同態(tài)電路,需要的乘同態(tài)運(yùn)算次數(shù)為O(μ-1)log(μ-1))(μ為編碼單字節(jié)所需比特?cái)?shù))。作為隱私防護(hù)的外包計(jì)算中的基本組件,該方案在諸多具體問題中都有重要應(yīng)用。
[Abstract]:With the development of technology and industry in related fields, we ushered in the era of big data. The strategic significance of big data's technology lies in that it can discover the potential value from massive data through specialized processing, thus providing reliable basis for analysis, prediction and decision making. Therefore, the development of big data related industries has been attached great importance by the governments of various countries. However, data collection, cleaning, storage, and analysis depend on expensive professional facilities, and it is difficult for individuals and small and medium-sized enterprises to afford the cost of equipment purchase and maintenance. As a new service computing model, cloud computing provides users with convenient data storage, data processing, information sharing and virtualization services, which has become an ideal solution for big data project. Users can outsource their data to cloud service providers, and then obtain the corresponding data according to their own requirements, or obtain data-based services. This model is generally called outsourcing computing. However, an important constraint to the promotion of outsourced data services is concerns about data security and privacy, especially in sensitive areas such as finance and healthcare, if data is abused or leaked by cloud service providers. Will cause heavy loss to the user. Cryptography is the basic tool to ensure the privacy of data. However, the traditional encryption scheme can ensure the privacy of data, but encryption will limit the availability of data and make the cloud lose the ability of data processing, analysis and mining. Therefore, it is necessary to design new cryptographic primitives in the cloud environment, which can not only guarantee the privacy of data, but also allow cloud service providers to perform specific operations on data. Searchable encryption is an important cryptographic primitive to ensure storage security and data privacy in cloud computing environment. At the same time, make sure that the cloud server can only get very little information. Early searchable encryption schemes focus on security, search efficiency and broader search ideas. In recent years, researches have focused on symmetric searchable encryption schemes in which data sets can be dynamically updated. In this paper, a new dynamic symmetric searchable encryption scheme is proposed. The time complexity of the algorithm is O (1), while the time complexity of adding and deleting documents is O (m "n) and 0 (N) (, in which the number of keywords in m" denotes the number of new documents N means the document-keyword pairing number n means dictionary size). The overall efficiency is better than the existing scheme; In the aspect of security, the scheme can resist the attack of selecting keywords, and the scheme achieves less information leakage than the previous scheme. A significant drawback of searchable encryption at present is that the schemes usually use words as the query condition, which is not suitable for the cohesive corpus. The reason is that these languages are represented by morpheme growth strings. Therefore, searching for such a language needs to be handled by characters. We select the longest common subsequences as the basis for assessing the similarity of strings, and use partial homomorphism encryption as the basic cryptographic primitive to construct a scheme to solve the longest common string under ciphertext. The scheme is highly efficient and scalable. It requires only logarithmic depth homomorphism circuit, and the number of times of multiplying homomorphism is O (渭 -1) log (渭 -1) (渭 is the number of bits required for encoding single byte). As a basic component of outsourced computing for privacy protection, this scheme has important applications in many specific problems.
【學(xué)位授予單位】：山東大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TP309

【相似文獻(xiàn)】

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

1 劉艮;蔣天發(fā);;同態(tài)加密技術(shù)及其在物聯(lián)網(wǎng)中的應(yīng)用研究[J];信息網(wǎng)絡(luò)安全;2011年05期

2 閆世斗;劉念;李子臣;;公鑰密碼體制的同態(tài)性分析[J];北京電子科技學(xué)院學(xué)報(bào);2012年02期

3 楊耀增;;用同態(tài)，

本文編號(hào)：2219239