發(fā)布時間：2018-06-27 06:32

  本文選題：云計算 + 數(shù)據(jù)安全��； 參考：《中北大學》2017年碩士論文

【摘要】：隨著一個大規(guī)模的生成、共享、利用數(shù)據(jù)的時代正在接近,數(shù)據(jù)安全中包括的隱私保護問題,已經(jīng)成為當前云計算所遇到的重大安全挑戰(zhàn)。通過合理有效的方法保護個人隱私與數(shù)據(jù)安全成為當今信息安全領(lǐng)域研究的重點,這涉及到數(shù)據(jù)的保密計算,是云環(huán)境中最關(guān)鍵的問題。在數(shù)據(jù)安全問題方面,近些年來,許多研究者均做了大量分析與探索。與以往普通的加密技術(shù)不同,在安全的云存儲和云計算中使用同態(tài)加密技術(shù),是解決其數(shù)據(jù)安全問題的一項重要技術(shù)。但是,目前基于公鑰密碼體制的同態(tài)加密方法計算效率低,普遍存在公鑰尺寸過大和計算復雜度較高的缺點,為解決這一問題,提出一種改進的同態(tài)加密方法。本文的主要工作如下:(1)基于橢圓曲線的相關(guān)理論研究。給出橢圓曲線加密相應理論基礎(chǔ),包括有限域、點加、倍點等相關(guān)知識。并對其安全性能進行分析。最后介紹的是其加密步驟,為基于ECC的同態(tài)加密算法實現(xiàn)提供依據(jù)。(2)標量乘運算基本算法。重點描述二進制法、NAF法、Comb法、窗口法等。對其各自的特點進行分析。通過傳統(tǒng)標量乘算法在存儲空間與計算性能方面的分析和比較,為基于ECC的同態(tài)加密算法實現(xiàn)提供依據(jù)。(3)提出一種基于ECC的同態(tài)加密改進算法。在本文中規(guī)定了k的生成方法。這樣可以有效提高其運算效率。同時結(jié)合二進制法與窗口法的優(yōu)勢,使得運算中平均點加數(shù)僅為傳統(tǒng)法14.69%。提出一種基于ECC的同態(tài)加密改進算法。在其算法基礎(chǔ)上,構(gòu)造出加法、乘法兩種同態(tài)加密方法。通過實驗結(jié)果分析可知本文算法在加法同態(tài)運算與乘法同態(tài)運算中的耗時明顯低于傳統(tǒng)二進制法,使得運算效率有顯著提高且降低存儲空間。(4)通過對基于ECC的同態(tài)加密算法進行實驗分析。通過對比試驗效果、從點加及點乘次數(shù)、分析實驗所用時間、數(shù)據(jù)結(jié)果圖表等。在保證安全性的同時,顯著提高了同態(tài)加密方法的計算效率,同時分析了方法中各項參數(shù)對加解密效率的影響。理論分析與實驗結(jié)果均證明,該方法具有較高的安全性,在計算性能上是一種高效的方法。
[Abstract]:With a large-scale generation, sharing, the use of data is approaching the era, data security, including privacy protection, has become a major security challenge to cloud computing. To protect personal privacy and data security through reasonable and effective methods has become the focus of research in the field of information security, which involves the confidential calculation of data, and is the most critical problem in the cloud environment. In data security, in recent years, many researchers have done a lot of analysis and exploration. Different from the common encryption technology in the past, the application of homomorphic encryption in secure cloud storage and cloud computing is an important technology to solve the problem of data security. However, the computation efficiency of homomorphic encryption based on public key cryptosystem is low, and the shortcomings of large size of public key and high computational complexity are common. In order to solve this problem, an improved homomorphic encryption method is proposed. The main work of this paper is as follows: (1) theoretical research based on elliptic curve. The theoretical basis of elliptic curve encryption is given, including the knowledge of finite field, point addition, point doubling and so on. And its security performance is analyzed. Finally, the encryption steps are introduced, which provide the basis for the realization of the homomorphic encryption algorithm based on ECC. (2) the basic algorithm of scalar multiplication. The binary method NAF method Comb method, window method and so on are described in detail. Their respective characteristics are analyzed. By analyzing and comparing the storage space and computing performance of the traditional scalar multiplication algorithm, this paper provides the basis for the implementation of the homomorphic encryption algorithm based on ECC. (3) an improved algorithm of homomorphic encryption based on ECC is proposed. The generation method of k is defined in this paper. In this way, the computational efficiency can be improved effectively. At the same time, combining the advantages of binary method and window method, the addition of average point in operation is only 14.69. An improved homomorphic encryption algorithm based on ECC is proposed. On the basis of its algorithm, two homomorphic encryption methods, addition and multiplication, are constructed. The experimental results show that the time consuming of this algorithm in addition homomorphism operation and multiplication homomorphism operation is obviously lower than that in traditional binary method. The computational efficiency is improved significantly and the storage space is reduced. (4) the experimental analysis of the homomorphic encryption algorithm based on ECC is carried out. By comparing the results of the experiment, the time used in the experiment and the chart of the data are analyzed from the point addition and the times of point multiplication. At the same time, the computation efficiency of homomorphic encryption method is improved significantly, and the influence of the parameters on the efficiency of encryption and decryption is analyzed. The theoretical analysis and experimental results show that this method has high security and is an efficient method in computing performance.
【學位授予單位】：中北大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TP309.7

【參考文獻】

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

1 李順東;竇家維;王道順;;同態(tài)加密算法及其在云安全中的應用[J];計算機研究與發(fā)展;2015年06期

2 楊玉龍;彭長根;周洲;;基于同態(tài)加密的防止SQL注入攻擊解決方案[J];信息網(wǎng)絡安全;2014年01期

3 彭長根;田有亮;張豹;徐志聘;;基于同態(tài)加密體制的通用可傳遞簽名方案[J];通信學報;2013年11期

4 王敏;吳震;;抗SPA攻擊的橢圓曲線NAF標量乘實現(xiàn)算法[J];通信學報;2012年S1期

5 李美云;李劍;黃超;;基于同態(tài)加密的可信云存儲平臺[J];信息網(wǎng)絡安全;2012年09期

6 邱梅;羅守山;劉文;陳萍;;利用RSA密碼體制解決安全多方多數(shù)據(jù)排序問題[J];電子學報;2009年05期

7 張寶華;殷新春;張海靈;;Edwards曲線安全快速標量乘法運算算法——EDSM[J];通信學報;2008年10期

8 陳輝;鮑皖蘇;;基于半點運算與多基表示的橢圓曲線標量乘法[J];計算機工程;2008年15期

9 肖倩;羅守山;陳萍;吳波;;半誠實模型下安全多方排序問題的研究[J];電子學報;2008年04期

10 向廣利,陳莘萌,馬捷,張俊紅;實數(shù)范圍上的同態(tài)加密機制[J];計算機工程與應用;2005年20期

，

本文編號：2073002