计算机技术与发展2017，Vol.27Issue(5)：120-122,127,4.DOI:10.3969/j.issn.1673-629X.2017.05.025
点包含问题的安全多方计算
Secure Multi-party Computation for Point Inclusion Problems
摘要
Abstract
Secure multi-party computation is one of the hot spots in international cryptography research community in recent years,and more and more attention has been paid to the secure computational geometry.As an important problem of secure computational geometry,more interests have been paid on point-inclusion problem.A secure protocol for determining whether two segments are intersecting with several basic protocols,Scalar Product Protocol and Yao's Millionaire's Protocol,has been developed.Thus based on core of the protocol designed and related geometric knowledge,a secure protocol to solve the point-inclusion problem has been developed.Theoretical analysis results show that these two protocols are correct and secure under semi honest model.As a part of important secure multi-party computational protocols,they both imply important practical value in solving the problem of secure multi-party computational geometry and can be used to solve the problems,whether two or more graphics are intersected and whether multiple points are contained in a graphic etc..关键词
安全多方计算/保密计算几何/点包含问题/线段相交问题Key words
secure multi-party computation/computational geometry/point-inclusion problem/segment-intersection problem分类
信息技术与安全科学引用本文复制引用
杨晓艺,刘新,亢佳..点包含问题的安全多方计算[J].计算机技术与发展,2017,27(5):120-122,127,4.基金项目
中央高校基本科研业务费专项(GK20150417) （GK20150417）
内蒙古自治区包头市科技计划项目(2014S2004-2-1-15) （2014S2004-2-1-15）
