【摘要】：安全雙方計算是指兩個互相不信任的參與方之間在保護(hù)各自隱私的前提下協(xié)同參與計算,計算結(jié)果使得每一個參與方都能得到正確的輸出,同時每一方只能得到自己的輸入和輸出,而不了解其他方的輸入和輸出。安全雙方計算實(shí)際上是網(wǎng)絡(luò)用戶之間的一種分布式協(xié)議,它能夠使用戶在不泄漏各自的私人輸入的同時完成合作計算的任務(wù)。經(jīng)典的安全雙方問題一直專注于零信息泄露的模式,雖然這是理想的安全雙方模型,但在實(shí)際的安全雙方計算中需要花費(fèi)較大且效率不高。本文在傳統(tǒng)安全雙方的問題上利用卷積隱藏技術(shù)構(gòu)建了卷積安全雙方計算問題并基于此問題建立了第三方參與的卷積安全雙方計算模型和需要部分信息公開情況下的安全雙方計算模型,并對該模型進(jìn)行安全性與復(fù)雜性的評估,提供了一種可以根據(jù)參與者對安全的容忍程度來調(diào)節(jié)安全和效率的方法。主要內(nèi)容如下:1.研究了幾個基本的安全雙方求和與乘積問題,提出了相應(yīng)的協(xié)議并對協(xié)議安全性與復(fù)雜性進(jìn)行了分析。然后在傳統(tǒng)安全雙方計算問題的基礎(chǔ)上,考慮參與者數(shù)據(jù)是一組n維數(shù)列的情況,提出了卷積安全雙方計算問題。2.基于卷積安全雙方計算問題建立了第三方參與的安全雙方計算模型,并構(gòu)造了兩種不同安全需求情況下的實(shí)現(xiàn)協(xié)議,對協(xié)議的安全性與復(fù)雜性進(jìn)行了分析,討論了犧牲安全性提高參與者之間計算效率的可行性。3.提出了一種簡單的復(fù)雜性量化標(biāo)準(zhǔn),對卷積問題的不同協(xié)議的復(fù)雜性進(jìn)行了分析與量化,提供了一種可以根據(jù)參與者對安全性需求來選擇合理協(xié)議的方法。
[Abstract]:The calculation of security parties means that two parties who have no confidence in each other are involved in the calculation under the premise of protecting their privacy. The result of the calculation enables each participant to get the correct output. At the same time, each party can only get their own input and output, and do not understand the other side of the input and output. Secure two-party computing is actually a distributed protocol between network users, which enables users to complete the task of cooperative computing without revealing their personal input. The classical security side problem has been focused on the zero information leakage model. Although it is an ideal security two sides model, it needs to be expensive and inefficient in the actual computation of security parties. In this paper, we use convolutional hiding technology to construct the computing problem of convolutional security parties on the traditional security sides. Based on this problem, we establish the computing model of convolutional security parties with the participation of third parties and the disclosure of some information needed. The two sides of the security calculation model, The security and complexity of the model are evaluated to provide a method to adjust the safety and efficiency according to the tolerance of the participants to security. The main contents are as follows: 1. In this paper, several basic security summation and product problems are studied, and the corresponding protocols are proposed, and the security and complexity of the protocols are analyzed. Then, on the basis of the traditional security two-party calculation problem, considering that the participant data is a set of n-dimensional series, the convolution security two-party computation problem is proposed. 2. Based on the computation problem of convolutional security parties, the security parties' computing model with the participation of third parties is established, and two kinds of implementation protocols under different security requirements are constructed, and the security and complexity of the protocols are analyzed. The feasibility of sacrificing security to improve computational efficiency between participants is discussed. This paper presents a simple complexity quantization standard, analyzes and quantifies the complexity of different protocols for convolution problems, and provides a method for selecting reasonable protocols according to the security requirements of participants.
【學(xué)位授予單位】：貴州大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2016
【分類號】：TP309
，

本文編號：2313474