计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (36): 130-133.DOI: 10.3778/j.issn.1002-8331.2008.36.036

• 网络、通信、安全 • 上一篇    下一篇

Graham算法求解凸包问题中的隐私保护

逯绍锋1,2,罗永龙1,2   

  1. 1.安徽师范大学 GIS重点实验室,安徽 芜湖 241003
    2.安徽师范大学 计算机科学技术系,安徽 芜湖 241003
  • 收稿日期:2008-06-03 修回日期:2008-08-21 出版日期:2008-12-21 发布日期:2008-12-21
  • 通讯作者: 逯绍锋

Privacy-preserving in Graham algorithm for finding convex hulls

LU Shao-feng1,2,LUO Yong-long1,2   

  1. 1.Key Laboratory of Geography Information System,Anhui Normal University,Wuhu,Anhui 241003,China
    2.Department of Computer Science,Anhui Normal University,Wuhu,Anhui 241003,China
  • Received:2008-06-03 Revised:2008-08-21 Online:2008-12-21 Published:2008-12-21
  • Contact: LU Shao-feng

摘要: 凸包问题是构造其他几何形体的有效工具。保护私有信息的凸包求解问题是一个特殊的安全多方计算问题。基于安全多方计算的基础协议,设计了一个保护私有信息的凸包求解协议,解决了基于隐私保护的凸包求解问题,并讨论和分析了其安全性和正确性。

Abstract: Convex hull is an effective tool to construct other geometric shapes.Privacy-preserving protocol for finding the convex hulls is a special case of secure multi-party computation problem.Based on some basic protocols of security multi-party computation,the paper designed a privacy-preserving protocol for finding the convex hulls to resolve the convex hull problem,it also discussed and analyzed the security and correctness of the protocol.