TWO PRIVACY-PRESERVING PROTOCOLS FOR POINT-CURVE RELATION

作     者：Liu Liang Wu Chunying Li Shundong 

作者机构：School of Computer Science Shaanxi Normal University Computer Department of Qinghai Normal University 

出 版 物：《Journal of Electronics(China)》 (电子科学学刊（英文版）)

年 卷 期：2012年第29卷第5期

页      面：422-430页

学科分类：0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0839[工学-网络空间安全] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Supported by the National Natural Science Foundation of China (No. 61070189, 60673065) the National High Technology Development Program (No. 2008AA01Z419) 

主　　题：Secure multiparty computation Privacy-preserving Point-curve relation Power series expansion 

摘      要：Numerous privacy-preserving issues have emerged along with the fast development of Internet, both in theory and in real-life applications. To settle the privacy-preserving problems, secure multi-party computation is essential and critical. In this paper, we have solved two problems regarding to how to determine the position relation between points and curves without revealing any private information. Two protocols have been proposed in order to solve the problems in different conditions. In addition, some building blocks have been developed, such as scalar product protocol, so that we can take advantage of them to settle the privacy-preserving computational geometry problems which are a kind of special secure multi-party computation problems. Moreover, oblivious transfer and power series expansion serve as significant parts in our protocols. Analyses and proofs have also been given to argue our conclusion.