跳到主要导航 跳到搜索 跳到主要内容

A practical solution for privacy-preserving approximate convex hulls problem

  • Li Dong*
  • , Huang Liusheng
  • , Yang Wei
  • , Zhu Youwen
  • , Luo Yonglong
  • , Li Lingjun
  • , Chen Zhili
  • *此作品的通讯作者

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

Convex Hulls Problem is a special case of Privacy-preserving Geometry problems in the inquiry of Secure Multi-Party Computation (SMC). It can be applied in military, commercial and many other fields. However, because of the definition's inherent defect, current schemes will inevitably disclose the points on the vertices. In this paper, we proposed the concept of privacy-preserving approximate convex hulls problem and provide a practical protocol which is more secure and efficient than previous convex hulls protocols. We also show that it can be applied to finding the approximate intersection area of two private convex hulls.

源语言英语
主期刊名Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009
539-544
页数6
DOI
出版状态已出版 - 2009
已对外发布
活动2009 WRI International Conference on Communications and Mobile Computing, CMC 2009 - Kunming, Yunnan, 中国
期限: 6 1月 20098 1月 2009

出版系列

姓名Proceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009
3

会议

会议2009 WRI International Conference on Communications and Mobile Computing, CMC 2009
国家/地区中国
Kunming, Yunnan
时期6/01/098/01/09

指纹

探究 'A practical solution for privacy-preserving approximate convex hulls problem' 的科研主题。它们共同构成独一无二的指纹。

引用此