多方保密計(jì)算中基礎(chǔ)協(xié)議及其應(yīng)用研究
[Abstract]:The problem of information security is one of the greatest threats in the information society. As an important tool to solve the problem of information security, multi-party confidential computing has attracted great attention. Multi-party secure computing refers to two or more users who have secret input and hope to cooperate in carrying out a certain computing task without revealing their private information. It is widely used in scientific calculation geometric calculation and so on. In this paper, two basic problems in scientific computation and geometric computation are studied in depth, and some protocols applied in specific fields are designed. Firstly, the norm problem of vector difference is studied. Based on homomorphic encryption technique and secure two-party permutation technique, the norm protocol for secret computation of vector difference is designed, because this protocol is not suitable for two-dimensional vector. Therefore, based on the idea of inner product protocol constructed by Clifton, another norm protocol for secret computation of vector difference is designed. Secondly, the millionaire problem is studied, and the existing solutions to the problem are summarized and analyzed. Then, a new millionaire protocol based on data camouflage and homomorphic encryption algorithm is proposed. Compared with the previous schemes, the two schemes in this paper reduce the number of encryption and decryption and the total number of modular multiplication and modular power operations, and improve the efficiency of the scheme. Finally, based on the norm protocol of vector difference, two application problems are solved, namely, the problem of secure computation of parallelogram area in high-dimensional space and the problem of corresponding proportion of data, and the problem based on millionaire protocol. Three application problems are solved, namely, vector dominant statistics problem, two rectangular position relation decision problem and integral division problem. The corresponding protocol is designed, and the correctness analysis, security proof and efficiency analysis of the protocol are carried out. The comparison and analysis show that the protocol is more secure and efficient.
【學(xué)位授予單位】:西安科技大學(xué)
【學(xué)位級(jí)別】:碩士
【學(xué)位授予年份】:2017
【分類(lèi)號(hào)】:TP309
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 錢(qián)小強(qiáng);仲紅;石潤(rùn)華;;無(wú)茫然第三方的安全兩方向量?jī)?yōu)勢(shì)統(tǒng)計(jì)協(xié)議[J];計(jì)算機(jī)工程;2014年02期
2 李順東;王道順;;基于同態(tài)加密的高效多方保密計(jì)算[J];電子學(xué)報(bào);2013年04期
3 楊高明;楊靜;張健沛;;聚類(lèi)的(α,k)-匿名數(shù)據(jù)發(fā)布[J];電子學(xué)報(bào);2011年08期
4 趙玉;仲紅;易磊;;安全判定兩組數(shù)據(jù)對(duì)應(yīng)成比例的新方法[J];微型機(jī)與應(yīng)用;2011年13期
5 劉文;羅守山;王永濱;;安全兩方向量?jī)?yōu)勢(shì)統(tǒng)計(jì)協(xié)議及其應(yīng)用[J];電子學(xué)報(bào);2010年11期
6 查俊;蘇錦海;閆少閣;閆曉芳;;姚氏百萬(wàn)富翁問(wèn)題的高效解決方案[J];計(jì)算機(jī)工程;2010年14期
7 魯磊紀(jì);黃宏升;方治;;隱私保護(hù)的計(jì)算三角形面積協(xié)議[J];電腦知識(shí)與技術(shù);2009年33期
8 羅永龍;黃劉生;徐維江;荊巍巍;;一個(gè)保護(hù)私有信息的多邊形相交判定協(xié)議[J];電子學(xué)報(bào);2007年04期
9 劉木蘭;;密鑰共享體制與安全多方計(jì)算[J];北京電子科技學(xué)院學(xué)報(bào);2006年04期
10 羅永龍;黃劉生;荊巍巍;徐維江;;空間幾何對(duì)象相對(duì)位置判定中的私有信息保護(hù)[J];計(jì)算機(jī)研究與發(fā)展;2006年03期
相關(guān)博士學(xué)位論文 前3條
1 孫茂華;安全多方計(jì)算及其應(yīng)用研究[D];北京郵電大學(xué);2013年
2 劉文;幾類(lèi)特殊的安全多方計(jì)算問(wèn)題的研究[D];北京郵電大學(xué);2009年
3 荊巍巍;安全多方計(jì)算中若干基礎(chǔ)協(xié)議及應(yīng)用的研究[D];中國(guó)科學(xué)技術(shù)大學(xué);2008年
相關(guān)碩士學(xué)位論文 前3條
1 謝娟;不經(jīng)意傳輸協(xié)議的研究與應(yīng)用[D];蘇州大學(xué);2010年
2 邱梅;安全多方排序協(xié)議的研究[D];北京郵電大學(xué);2009年
3 陳杰;安全多方計(jì)算問(wèn)題的研究[D];貴州大學(xué);2006年
,本文編號(hào):2289239
本文鏈接:http://sikaile.net/kejilunwen/ruanjiangongchenglunwen/2289239.html