本文關鍵詞：廣義保序加密研究　出處：《中國科學技術大學》2017年博士論文　論文類型：學位論文

  更多相關文章： 可搜索加密 保序加密 揭示序關系的加密 廣義保序加密 安全性分析

【摘要】：近年來,隨著云計算和云存儲技術的高速發(fā)展與廣泛運用,云計算和云存儲中的安全問題越來越引起用戶的重視。為了保護數據的隱私性,有必要對數據進行加密,但傳統(tǒng)加密會阻礙數據的有效使用,因此在云存儲的場景下,需要使用可搜索加密�？伤阉骷用苁遣恍枰饷芫涂梢栽诿芪纳纤阉鞯募用芊椒�,而保序加密是其中的關鍵技術之一,可以解決在密文上進行區(qū)間查詢的問題。保序加密的密文保留了與明文相同的序關系,因而在密文上執(zhí)行區(qū)間查詢有與明文相同的查詢速度。但同時,保序加密也存在缺陷與不足。一對一保序加密的密文會泄露明文的序關系,因而安全性不足,容易遭受攻擊。一對多保序加密將同一個明文映射到不同的密文,為了保證安全性,每一個明文對應的密文區(qū)間需要足夠大,會造成嚴重的密文擴張。同時,保序加密用于多維數據時,除了序關系之外,還會額外泄露不同維度數據之間的相關性。針對以上問題,本文提出并研究了廣義保序加密算法。廣義保序加密算法在保持保序加密高查詢速度的同時,對保序加密進行了改進,以提高其他方面的性能。本文的主要工作和創(chuàng)新成果如下:1.針對一對一保序加密的安全性問題,提出了一種一對一廣義保序加密算法——p概率保序加密。p概率保序加密是一對一保序加密的一種擴展算法,其密文以概率p保持序關系,以提高安全性。通過對保序概率p與安全性、精度之間的關系進行理論分析,得到了安全性與精度間的制約關系。模擬實驗驗證了理論分析的結果以及該算法的性能。理論分析和實驗結果表明,當增大保序概率p時,查詢精度提升,但安全性會下降;當減小保序概率p時,安全性增加,但精度會降低。通過動態(tài)調節(jié)p,該算法可以在安全性和精度之間達到一個折中。2.針對一對多保序加密的密文擴張問題,提出了一種一對多廣義保序加密算法——半保序加密。半保序加密將不同的明文映射到重疊的密文區(qū)間來抑制密文擴張。對于半保序加密的性能,可以采用安全性、精度、密文擴張這三個指標來刻畫。通過對半保序度與安全性、精度、密文擴張之間的關系進行理論分析,得到了安全性、精度、密文擴張這三者間的制約關系。模擬實驗驗證了理論分析的結果以及該算法的性能。理論分析和實驗結果表明,當增大半保序度時,密文擴張會得到抑制,同時安全性提高,查詢精度下降;當減小半保序度時,查詢精度提高,但同時密文擴張增加,安全性降低。通過動態(tài)調節(jié)半保序度,該算法可以在安全性、精度、密文擴張之間達到一個折中。3.針對保序加密應用于多維數據時泄露不同維數據之間相關性的問題,提出了一種用于多維數據的廣義保序加密算法。首先對保序加密應用于多維數據時的場景進行了分析,定義了分位數指示量來描述信息泄露的情況。分位數指示量是與分布有關的統(tǒng)計量。提出了分位數攻擊,這一攻擊算法利用分位數指示量的泄露來區(qū)分不同的分布。然后提出了一種安全性指標來衡量分位數指示量的泄露情況,并提出了一種基于啞元填充的改進算法。在真實數據上通過實驗對分位數攻擊和啞元填充的性能進行了驗證。實驗結果表明,基于啞元填充的改進算法能有效地降低分位數攻擊的精度,從而提高系統(tǒng)的安全性。
[Abstract]:In recent years, with the rapid development and widely application of cloud computing and cloud storage technology, the security problem of cloud computing and cloud storage in more and more users attention. In order to protect the privacy of data, it is necessary to encrypt the data, but the traditional encryption will hinder the effective use of data, so the cloud storage scenarios that requires the use of searchable encryption. Searchable encryption encryption decryption method does not need to search for in the ciphertext, and order preserving encryption is one of the key technologies that can solve the problem of range query in the ciphertext. Order preserving encryption cipher preserves the order relations and express the same, so the query execution interval with the same query speed in plaintext ciphertext. But at the same time, order preserving encryption also has defects and shortcomings. The order of one to one relationship order preserving encryption ciphertext plaintext will leak, and the lack of security, vulnerable to Attack. To order preserving encryption with a plaintext mapped to different ciphertext, in order to ensure the safety of each plaintext corresponding to the ciphertext interval is large enough, can cause serious ciphertext expansion. At the same time, order preserving encryption for multidimensional data, in addition to ordering, the correlation between the additional disclosure the different dimensions of data. To solve the above problems, this paper proposes and studies the generalized order preserving encryption algorithm. The generalized order preserving encryption algorithm maintains the order preserving encryption high query speed at the same time, the order preserving encryption has been improved, in order to improve the performance of other aspects. The main work and innovation are as follows: 1. for safety the problem of order preserving encryption, proposes a generalized one order preserving encryption algorithm P probability order preserving encryption.P probability order preserving encryption is an extension of an order preserving encryption algorithm, the ciphertext with probability p. To order, in order to improve the safety and security of P. By preserving probability, theoretical analysis of relationship between the control precision, safety and accuracy. Simulation results verify the theoretical analysis results and the performance of the algorithm. Theoretical analysis and experimental results show that with the increase of order preserving probability p, the query precision upgrade, but the security will decline; with the decrease of order preserving probability p, and increase the security, but the accuracy will be reduced. Through the dynamic regulation of P, the algorithm can reach a compromise for the.2. problem of a ciphertext expansion order preserving encryption between safety and accuracy, put forward a a kind of generalized order preserving encryption algorithm - order preserving encryption. Semi order preserving encryption will clear the mapping to different overlapping interval to suppress the ciphertext ciphertext expansion. The performance of semi order preserving encryption, can be used in security, accuracy, secret Wen Kuozhang three Indicators to describe. Through the semi order preserving reliability and security, accuracy, theoretical analysis of the relationship between the safety of ciphertext expansion, and get the accuracy of ciphertext expansion restricts the relationship between these three. Simulation results verify the theoretical analysis results and the performance of the algorithm. Theoretical analysis and experimental results show that when the increasing the half order preserving degree, ciphertext expansion will be curbed, and improve the security, the query accuracy decreased; with the decrease of half order preserving degree, improve the query precision, but also increase the safety of the ciphertext expansion, reduced. By dynamically adjusting the half order preserving degree, the algorithm accuracy in safety, the ciphertext expansion between reach a compromise for.3. order preserving encryption applied to multidimensional data reveal the correlations between different dimensions of data, proposes an encryption algorithm for multidimensional data generalized isotonic. First order preserving encryption for multidimensional number According to the scene were analyzed, the definition of quantile indicating quantity to describe information leaks. Quantile indicates the amount and distribution of the relevant statistic is proposed. Quantile attacks, this attack algorithm using quantile indicates the amount of leakage to distinguish different distribution. Then put forward a security index to measure the amount of quantile indicating leaks, and proposed an improved algorithm of dummy fill based on real data. Through the experiment of quantile attack and the performance of dummy fill is verified. The experimental results show that the dummy fill improved algorithm can effectively reduce the attack precision based on quantile, and to improve the security of the system.

【學位授予單位】：中國科學技術大學
【學位級別】：博士
【學位授予年份】：2017
【分類號】：TP309.7

【相似文獻】

相關期刊論文 前4條

1 廖家龍;朱軍;高威;;點嚴格保序線性算子對應矩陣的雙隨機性[J];杭州電子科技大學學報;2014年05期

2 樓榮生;關于保序散列的一些問題[J];計算機應用與軟件;1987年02期

3 陳韜略,韓亮,陶先平,呂建;移動Agent系統(tǒng)的一個因果保序通信協議[J];計算機工程;2005年07期

4 扈紅超;郭云飛;龐琳;卜佑軍;;動態(tài)均衡的LB-BvN分組保序調度機制[J];通信學報;2011年04期

相關會議論文 前2條

1 劉奇志;;層次分析積因子方法的特性及其理論基礎[A];決策科學理論與方法——中國系統(tǒng)工程學會決策科學專業(yè)委員會第四屆學術年會論文集[C];2001年

2 陳水利;董長清;;L-fuzzy保序算子空間[A];中國系統(tǒng)工程學會模糊數學與模糊系統(tǒng)委員會第十一屆年會論文選集[C];2002年

相關博士學位論文 前1條

1 楊策;廣義保序加密研究[D];中國科學技術大學;2017年

相關碩士學位論文 前9條

1 薛佳;保序與反保序變換半群的反保序平方冪等元[D];貴州師范大學;2016年

2 黃新旭;半群POD_n的反保序平方冪等元[D];貴州師范大學;2016年

3 袁杭江;基于輸出端包保序的交換網絡架構研究[D];電子科技大學;2016年

4 邢務強;保序回歸的研究及應用[D];西北工業(yè)大學;2002年

5 朱瑩瑩;保序回歸的算法及應用[D];江西師范大學;2011年

6 王繼霞;保序回歸與金融中的共積[D];華中科技大學;2004年

7 廖家龍;一類保序的線性映射[D];杭州電子科技大學;2014年

8 翟莉;識別藥物最大耐受劑量的推廣EWOC方法和二維保序設計[D];東北師范大學;2005年

9 陳建翔;保序加密在海洋環(huán)境信息云存儲密文檢索系統(tǒng)中的應用研究[D];中國海洋大學;2014年

，

本文編號：1366934