保护私有信息的凸多边形相似判定  

Privacy protecting similitude determination for two convex polygons

作　　者：王锵[1] 张远平[1] 贵向泉[1] 

机构地区：[1]兰州理工大学计算机与通信学院,甘肃兰州730050

出　　处：《计算机工程与设计》2009年第9期2142-2144,共3页Computer Engineering and Design

基　　金：甘肃省自然科学基金项目(3ZS051-A25-037)

摘　　要：基于私有信息保护的几何对象间的计算是一个特殊的安全多方计算问题,在很多领域有着重要的应用前景。秘密判定两组数据是否相等、是否对应成比例是安全多方计算的基本问题,在保护私有信息的几何对象间的计算问题方面有着重要意义。通过利用比较相等协议和判断两组数据是否对应成比例的判定协议,解决了凸多边形的相似判定问题,也适用于更一般的多边形相似判定问题,在实际生活中有一定的实用性和可操作性。分析了安全性和复杂性,目前已取得了较好的结果。The privacy protecting computation of geometric objects is a special secure multi-party computation problem.This problem may be applied in a large number of research fields.How to determine two sets of data privately that whether they are equal or are proportional correspondingly or not is a basic problem of secure multi-party computation,and is of great significance to the privacy protecting computation of geometric objects.The problem of similitude determination for two convex polygons is solved by using equality-testing protocol and the protocol of proportional data correspondingly,and this method is suitable to ordinary polygons.There are certain practicality and operability in real life.The security and complexity are analyzed,and the result is preferable at present.

关 键 词：安全多方计算 计算几何 凸多边形 相似 点积 协议 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]