【摘要】：多方保密計算是目前國際密碼學(xué)界的研究熱點,是網(wǎng)絡(luò)空間隱私保護與信息安全的關(guān)鍵技術(shù).密碼學(xué)者已經(jīng)研究了很多多方保密計算問題,但更多的多方保密計算問題還有待研究.文中研究一個重要的多方保密計算問題——有理數(shù)的區(qū)間的保密計算,即保密地計算一個保密的有理數(shù)在不在另一個保密的有理數(shù)區(qū)間內(nèi).該問題在密碼學(xué)中有重要的理論意義,在其他多方保密計算協(xié)議的構(gòu)造中有重要的實際意義,在隱私保護方面有廣泛的應(yīng)用.其中包括計算幾何上的點與圓環(huán)的包含問題,點與無限區(qū)域的包含問題,點與線段的包含問題等.甚至在現(xiàn)實的商品交易中,運用該問題的解決方案能夠減少交易成本.文中基于Paillier同態(tài)加密方案,以百萬富翁協(xié)議為基本思想,利用計算幾何理論,將有理數(shù)區(qū)間保密計算問題輸入的有理數(shù)看成過原點的直線的斜率,將區(qū)間保密計算問題歸約為直線之間的位置關(guān)系,根據(jù)平面直角坐標(biāo)系上三點定義的三角形面積計算公式,設(shè)計了一個高效的有理數(shù)區(qū)間保密計算協(xié)議;采用基本算術(shù)知識,將有理數(shù)的大小比較歸約到算術(shù)不等式的判定,調(diào)用對稱密碼整數(shù)集百萬富翁協(xié)議,設(shè)計了另一個高效的有理數(shù)區(qū)間保密計算協(xié)議;用模擬范例證明了兩個協(xié)議的安全性;通過理論和實際編程分析了協(xié)議的效率;分析表明兩個協(xié)議是正確高效的;最后給出了協(xié)議在解決其他多方保密計算問題中的應(yīng)用實例.
[Abstract]:Multi-party secure computing is a research hotspot in the field of cryptography and the key technology of privacy protection and information security in cyberspace. Cryptographers have studied many multi-party secure computing problems, but more multi-party secure computing problems need to be studied. In this paper, we study an important problem of multiparty secure computation, that is, the secure computation of the interval of rational numbers, that is, the secret calculation of a secure rational number in the interval of another secure rational number. This problem has important theoretical significance in cryptography, important practical significance in the construction of other multi-party secure computing protocols, and is widely used in privacy protection. It includes the inclusion problem of point and circle in computational geometry, the inclusion problem of point and infinite region, the inclusion problem of point and line segment and so on. Even in real commodity trading, the solution to this problem can reduce transaction costs. Based on the homomorphic encryption scheme of Paillier, taking the millionaire protocol as the basic idea and using the computational geometry theory, the rational number inputted in the rational number interval security calculation problem is regarded as the slope of the straight line passing through the origin. The problem of interval security calculation is reduced to the position relation between straight lines. According to the calculation formula of triangle area defined by three points in the plane rectangular coordinate system, an efficient interval security calculation protocol for rational numbers is designed. By using basic arithmetic knowledge, the size of rational number is reduced to the judgement of arithmetic inequality, and another efficient interval secure computing protocol of rational number is designed by calling the symmetric integer set millionaire protocol. The security of the two protocols is proved by a simulation example; the efficiency of the two protocols is analyzed by theoretical and practical programming; the analysis shows that the two protocols are correct and efficient; finally, an application example of the protocol in solving other multi-party security computing problems is given.
【作者單位】： 陜西師范大學(xué)計算機科學(xué)學(xué)院;中國科學(xué)院軟件研究所可信計算與信息保障實驗室;陜西師范大學(xué)數(shù)學(xué)與信息科學(xué)學(xué)院;清華大學(xué)計算機科學(xué)與技術(shù)系;
【基金】：國家自然科學(xué)基金(61272435,61373020,U1536102,U1536116) 中央高�；究蒲袠I(yè)務(wù)費專項資金(GK201504017)資助~~
【分類號】：TP309

【參考文獻】

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

1 ;Secure multi-party computation protocol for sequencing problem[J];Science China(Information Sciences);2011年08期

2 李順東,戴一奇,游啟友;姚氏百萬富翁問題的高效解決方案[J];電子學(xué)報;2005年05期

【共引文獻】

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

1 左祥建;李順東;楊曉莉;;同態(tài)加密的百萬富翁問題高效解決方案[J];小型微型計算機系統(tǒng);2017年03期

2 楊曉藝;劉新;亢佳;;點包含問題的安全多方計算[J];計算機技術(shù)與發(fā)展;2017年05期

3 王潔;;基于博弈論的公平安全兩方計算協(xié)議[J];西南交通大學(xué)學(xué)報;2016年05期

4 Mingxu Yi;Lifeng Wang;Yunpeng Ma;;Efficient Security Sequencing Problem over Insecure Channel Based on Homomorphic Encryption[J];中國通信;2016年09期

5 郭奕e，

本文編號：2305721