密码学报2016，Vol.3Issue(3)：238-248,11.DOI:10.13868/j.cnki.jcr.000124
三点共线的保密判断问题及应用*
Privately Determining Protocol on Three Points Are Collinear and Its Applications
摘要
Abstract
Secure Multi-party Computation was first proposed by A. C. Yao in 1980s. Now, it is a new and important area of cryptography. Privacy preserving computational geometry is a kind of secure multi-party computation problem. In this scenario, some users who do not trust each other want to cooperatively perform computing on their private geometrical data while keeping the privacy of the data. This problem has important application prospect in commerce and military. There is a new problem that three participants want to know whether their positions are collinear or not without disclosing their specific positions. This problem has not been solved. In this study, we propose a protocol for the problem based on Paillier’s homomorphic encryption scheme. We prove the validity of the protocol, we also prove that the protocol is secure in the semi-honest model using the simulation paradigm. We utilize this scheme to propose a solution to privately determining the relationship of points and line-segments. We prove that these protocols are secure using the simulation paradigm, and analyze their performance. At last, we show an application of these two protocols in chemical industry.关键词
多方保密计算/计算几何/同态加密/协议Key words
secure multi-party computation/computational geometry/homomorphic encryption/protocol分类
信息技术与安全科学引用本文复制引用
左祥建,杨晓莉,李顺东..三点共线的保密判断问题及应用*[J].密码学报,2016,3(3):238-248,11.基金项目
国家自然科学基金资助项目(61272435) （61272435）
研究生培养创新基金(2015CX029) （2015CX029）
