| 几何相交问题的多方保密计算 |
| |
| 引用本文： | 李顺东,戴一奇,王道顺,罗平. 几何相交问题的多方保密计算[J]. 清华大学学报(自然科学版), 2007, 47(10): 1692-1695 |
| |
| 作者姓名： | 李顺东 戴一奇 王道顺 罗平 |
| |
| 作者单位： | 北京师范大学,计算机科学与技术系,北京,100875;清华大学,计算机科学与技术系,北京,100084 |
| |
| 摘 要： | 研究几何图形相交问题解决方案在计算几何的多方保密计算中有重要的意义。用不经意传输研究计算几何问题多方保密计算。首先针对已有的两线段相交问题解决方案计算复杂性高的缺点,提出了新的解决方案,降低了该问题的计算复杂性。接着研究2个新的多方保密计算问题:两任意多边形相交与2个任意几何图形相交问题的多方保密计算,提出了相应的解决方案。还利用模拟范例证明了该文提出的3个问题的多方保密计算解决方案是安全的。
|
| 关 键 词： | 密码学 多方保密计算 计算几何 不经意传输 几何相交 安全性 |
| 文章编号： | 1000-0054(2007)10-1692-04 |
| 修稿时间： | 2006-06-20 |
Secure multi-party computations of geometric intersections |
| |
| LI Shundong,DAI Yiqi,WANG Daoshun,LUO Ping. Secure multi-party computations of geometric intersections[J]. Journal of Tsinghua University(Science and Technology), 2007, 47(10): 1692-1695 |
| |
| Authors: | LI Shundong DAI Yiqi WANG Daoshun LUO Ping |
| |
| Abstract: | Secure multi-party solutions of geometric designs which preclude conflicts between various shapes require analysis of geometric intersection problems.This paper describes a solution method for secure multi-party computations of intersections between two segments.This method greatly reduces the computational complexity of existing algorithms.Solutions are given for secure multi-party computations of intersections between two arbitrary polygons and between two arbitrary geometric figures.The simulations show that these multi-party solutions are secure. |
| |
| Keywords: | cryptography secure multi-party computations computational geometry oblivious transfer geometrical intersection security |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
