隐私保护的费马问题极值计算协议  

Privacy-preserving computation protocol for fermat problem's extreme values

作　　者：吴芬[1] 仲红[1,2] 石润华[1,2] 

机构地区：[1]安徽大学计算机科学与技术学院,合肥230601 [2]安徽大学计算与信号处理教育部重点实验室,合肥230039

出　　处：《计算机工程与应用》2014年第4期77-80,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61173188;No.61173187);安徽省自然科学基金(No.11040606M141);安徽大学211工程资助项目

摘　　要：隐私保护的计算几何问题是目前安全多方计算领域的一个研究热点。提出了一个费马问题的极值计算问题,费马问题已被广泛地运用在许多领域,比如军事、商业等领域。因此,在保证隐私的前提下,设计了一个基于点积协议的费马问题极值计算协议。提出的协议仅调用了6次点积协议,不仅简化了协议,而且没有使用第三方,安全性更高。给出了协议的正确性,而且对安全性和有效性都进行了详细的理论分析。分析结果标明,所提出的协议是安全的,而且协议复杂度低,也可用于解决其他一些安全多方的计算几何问题。Privacy-Preserving Computational Geometry（PPCG）is a hot research in relation to the Secure Multi-party Computation. The problem of the fermat problem’s extreme values is studied, which is a special case of PPCG and can be applied in many fields such as military and commercial fields. A novel computation protocol for the fermat problem’s ex-treme values is presented by using the technologies of Scalar Product Protocol which is used 6 times in a privacy-preserving situation. The protocol is much more simple and has more security which the third party is not used. At last, its correct-ness, security and efficiency are analyzed. The analysis shows that the proposed protocol is secure and has low complexity, and can be used to solve some other secure multi-party computation in computational geometry.

关 键 词：安全多方计算 隐私保护 计算几何 费马问题 极值 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]