摘要
隐私保护的计算几何是安全多方计算的一个全新研究领域。针对已有的安全判定点与多边形位置关系协议的缺陷,在半诚实模型下,提出基于铅垂线算法和不经意传输协议的隐私保护的点与多边形位置关系判定协议,并对该协议的正确性、计算复杂性、通信复杂性和安全性进行了分析和证明。新的协议不仅可以在实数域中使用,不局限于凸多边形,而且能适用于多边形带孔的情况。
Privacy preserving computational geometry is a new research branch of secure multiparty computation. Because of the shortcomings and restraints in existing protocols, in semi-honest, a new protocol based on plumb line algorithm and oblivious transfer protocol for relative position determination of point and polygon was proposed in this paper. The correctness, computation efficient and security were analyzed and proved in this paper as well. The new protocol not only can be used in real number field, but also can be used in any polygon with great efficient.
出处
《计算机科学》
CSCD
北大核心
2012年第B06期38-40,43,共4页
Computer Science
基金
国家自然科学基金(60773175和60973134)
现代通信国家重点实验室基金(9140C1108020906)
广东省自然科学基金(10351806001000000
10151064201000028和9151064201000058)资助
关键词
安全多方计算
计算几何
多边形
铅垂线算法
不经意传输协议
Secure multiparty computation
Computational geometry
Polygon
Plumb line algorithm
Oblivious transfer
