發(fā)布時間：2018-06-10 05:51

  本文選題：云計算 + 外包計算�。� 參考：《湖北工業(yè)大學(xué)》2017年碩士論文

【摘要】：信息技術(shù)的高速發(fā)展和數(shù)據(jù)爆炸性增長,越來越多的互聯(lián)網(wǎng)用戶選擇使用云服務(wù),云計算技術(shù)的發(fā)展也達到了前所未有的新高度。由于資源有限,企業(yè)和個人已經(jīng)無法在本地對數(shù)據(jù)進行存儲和計算,外包云計算技術(shù)應(yīng)運而生。外包計算技術(shù)允許用戶外包海量數(shù)據(jù)存儲或耗時科學(xué)計算任務(wù)給存儲和計算能力強大的云服務(wù)器。但是,外包計算為人們提供方便的同時,也不可避免地帶來了一些新的安全挑戰(zhàn)和問題。模指數(shù)運算以及雙線性對運算在密碼學(xué)中是常見的復(fù)雜科學(xué)計算,尤其在公鑰密碼體制中應(yīng)用比較廣泛,通常用來構(gòu)造安全的密碼算法。為了安全考量,在設(shè)計密碼算法的時候我們常會選用較大的數(shù)來進行運算。雖然,模指數(shù)和雙線性對安全外包計算的研究已經(jīng)取得了一些成就,但是大多數(shù)安全外包方案需要使用兩個云服務(wù)器來進行操作,并且要求至少有一個云服務(wù)器表現(xiàn)是誠實的,這就使得外包方案在實際應(yīng)用中實現(xiàn)比較困難。本文圍繞安全模指數(shù)和雙線性對外包運算協(xié)議展開研究,主要研究內(nèi)容包括以下三個方面:1.首先,研究國內(nèi)外現(xiàn)有的安全模指數(shù)外包方案,對現(xiàn)有方案的局限性進行總結(jié),以可驗證計算為基礎(chǔ)提出改進方案。針對單個不可信服務(wù)器模型,提出了兩種安全高效的模指數(shù)外包計算方案:Exp方案和Sexp方案。為保證用戶輸入輸出數(shù)據(jù)的隱私性,在外包之前對數(shù)據(jù)進行拆分和盲化處理,服務(wù)器不能從中獲取任何有關(guān)輸入輸出的信息。隨后,對外包方案進行安全性分析與證明,證明方案達到安全高效的目標(biāo)。2.其次,將可驗證模指數(shù)外包計算方案進行延展,用于實際的密碼構(gòu)造算法中,提出OS-CSES方案和OS-SSS方案。運用本文所設(shè)計Exp方案,將Cramer-Shoup加密方案和Schnorr簽名方案進行安全外包,通過理論證明和分析,證明這兩種方案不僅保證了外包用戶的數(shù)據(jù)安全,同時降低了計算開銷。3.最后,本文提出了可驗證的雙線性對外包計算方案,方案基于單個不可信服務(wù)器。對于雙線性對這種復(fù)雜的科學(xué)運算,普通用戶在本地完成需要花費較大代價,采取外包方法可以有效完成計算�，F(xiàn)有的方案大多基于兩個云服務(wù)器這在現(xiàn)實生活中難實現(xiàn)。為解決這個問題,基于單個不可信云服務(wù)器,我們設(shè)計了一種可驗證的雙線性對外包計算方案NBP,該方案首先調(diào)用Rand子程序提高計算效率,生成隨機盲化元組,并運用邏輯拆分技術(shù)對雙線性對進行拆分,保證了外包數(shù)據(jù)的隱私性。通過證明與分析對比,證明本方案安全高效,具有較高的可行性。我們將NBP方案應(yīng)用于密碼學(xué)領(lǐng)域,設(shè)計BLS和BB04簽名的安全外包方案,外包方案可以大大提高計算效率,同時可以保證數(shù)據(jù)安全。
[Abstract]:With the rapid development of information technology and the explosive growth of data, more and more Internet users choose to use cloud services, and the development of cloud computing technology has reached an unprecedented new height. Because of the limited resources, enterprises and individuals can no longer store and compute the data locally, so outsourcing cloud computing technology emerges as the times require. Outsourcing computing technology allows users to outsource massive data storage or time-consuming scientific computing tasks to cloud servers with powerful storage and computing capabilities. However, outsourcing computing not only provides convenience for people, but also inevitably brings some new security challenges and problems. Modular exponent operations and bilinear pair operations are common complex scientific computations in cryptography, especially in public key cryptosystems, which are commonly used to construct secure cryptographic algorithms. For security reasons, we often use large numbers to calculate when we design cryptographic algorithms. Although some achievements have been made in the research of modular exponent and bilinear security outsourcing computing, most security outsourcing schemes require two cloud servers to operate and require at least one cloud server to perform honestly. This makes it more difficult to implement the outsourcing scheme in practical applications. This paper focuses on the research of security module exponent and bilinear outsourcing protocol. The main research contents include the following three aspects: 1. First of all, we study the existing security module index outsourcing scheme at home and abroad, summarize the limitations of the existing scheme, and propose an improved scheme based on verifiable calculation. For a single untrusted server model, two secure and efficient modular exponential outsourcing schemes: Exp and Sexp are proposed. In order to ensure the privacy of the user's input and output data, the data is split and blinded before outsourcing, from which the server can not obtain any information about the input and output. Then, the security of outsourcing scheme is analyzed and proved, which proves that the scheme achieves the goal of security and efficiency. 2. Secondly, the verifiable modular exponentially outsourced computing scheme is extended and used in the actual cryptographic construction algorithm. The OS-CSES scheme and OS-SSS scheme are proposed. The Cramer-Shoup encryption scheme and the Schnorr signature scheme are outsourced using the Exp scheme designed in this paper. Through theoretical proof and analysis, it is proved that these two schemes not only guarantee the data security of the outsourced users, but also reduce the computational overhead of .3. Finally, a verifiable bilinear pairwise outsourced computing scheme is proposed, which is based on a single untrusted server. For the bilinear pair of complex scientific operations, ordinary users need to complete the local cost, and outsourcing method can be used to complete the calculation effectively. Most of the existing schemes are based on two cloud servers which are difficult to implement in real life. To solve this problem, based on a single untrusted cloud server, we design a verifiable bilinear pairwise outsourced computing scheme NBP.The scheme first calls Rand subroutine to improve computing efficiency and generate random blind tuples. The bilinear pair is split by logical splitting technology, which ensures the privacy of outsourced data. It is proved that this scheme is safe and efficient and has high feasibility by comparing with the analysis. We apply the NBP scheme to cryptography and design a security outsourcing scheme for BLS and BB04 signatures. The outsourcing scheme can greatly improve the computing efficiency and ensure the data security at the same time.
【學(xué)位授予單位】：湖北工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP309

【參考文獻】

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

1 任艷麗;丁寧;王天銀;陸海寧;谷大武;;可完全驗證的雙線性對運算外包算法[J];中國科學(xué):信息科學(xué);2016年07期

2 蔣鐵金;任艷麗;;基于單個服務(wù)器的雙線性對運算外包算法[J];計算機應(yīng)用;2016年07期

3 任艷麗;谷大武;蔡建興;黃春水;;隱私保護的可驗證多元多項式外包計算方案[J];通信學(xué)報;2015年08期

4 張明武;楊波;王春枝;TAKAGI Tsuyoshi;;隱私保護的推理機策略加密及應(yīng)用[J];計算機學(xué)報;2015年04期

5 胡杏;裴定一;唐春明;Duncan S.WONG;;可驗證安全外包矩陣計算及其應(yīng)用[J];中國科學(xué):信息科學(xué);2013年07期

6 王保倉;韋永壯;胡予濮;;基于中國剩余定理的快速公鑰加密算法[J];西安電子科技大學(xué)學(xué)報;2008年03期

7 李子臣,楊義先;ElGamal多重數(shù)字簽名方案[J];北京郵電大學(xué)學(xué)報;1999年02期

，

本文編號：2002190