| 保护私有信息的最近点对协议 |
| |
| 引用本文： | 方兴,;仲红,;张守奇,;李江华.保护私有信息的最近点对协议[J].微机发展,2008(12):153-155. |
| |
| 作者姓名： | 方兴 ;仲红 ;张守奇 ;李江华 |
| |
| 作者单位： | 安徽大学计算机科学与技术学院 |
| |
| 基金项目： | 国家自然科学基金资助项目（60773114）;安徽省自然科学基金资助项目（070412051）;安徽高校省级重点自然科学研究项目（KJ2007A043） |
| |
| 摘 要： | 基于保护私有信息的计算几何问题是安全多方计算的研究热点之一，在军事、商业等领域具有重要的应用前景。研究了几何计算中的最近点对问题，提出保护私有信息的最近点对问题解决方案，在此基础上结合已有的基础协议，设计了一种基于保护私有信息的最近点对协议。对该协议的安全性和复杂度进行了分析。对该问题进行适当的推广，可使之具有更大的实用性。
|
| 关 键 词： | 最近点对 私有信息 点积协议 茫然第三方 |
A Protocol for Privacy-Preserving Closest-Pair of Points |
| |
| FANG Xing,ZHONG Hong,ZHANG Shou-qi,LI Jiang-hua.A Protocol for Privacy-Preserving Closest-Pair of Points[J].Microcomputer Development,2008(12):153-155. |
| |
| Authors: | FANG Xing ZHONG Hong ZHANG Shou-qi LI Jiang-hua |
| |
| Affiliation: | FANG Xing, ZHONG Hong, ZHANG Shou-qi, LI Jiang-hua (School of Computer Science and Technology, Anhui University, Hefei 230039, China) |
| |
| Abstract: | At present,research on privacy-preserving computational geometry is of great interest in the field of secure multi-party computation.It can be applied in many fields,such as military field and commerce field.Focuses on the closest-pair of points problem in the computational geometry and a privacy-preserving solution to this problem is proposed.Based on this solution and combined with the knowledge of a set of basal secure protocols,a protocol for privacy-preserving closest-pair of points is further proposed,analysed the security and computational complexity.Finally,extends this problem properly to make it more practical. |
| |
| Keywords: | closest-pair of points privacy information scalar product protocol oblivious third party |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
