• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Education Technology and Computer Science, 2009. ETCS '09 >Privacy-Preserving Approximate Convex Hulls Protocol
【24h】

Privacy-Preserving Approximate Convex Hulls Protocol

机译：隐私保护近似凸包协议

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Secure multi-party computation has been a research focus for more than two decades. The convex hulls problem is a special case of secure multi-party computation. However, the precise convex hulls will certainly expose every vertex and even bring about unfairness. As a result, the practical approximate convex hulls are in need. In this paper, we summarize and discuss the convex hulls problem, and then we present a new more effective protocol to privately find the approximate convex hulls. Furthermore, we analyze the correctness, security, efficiency and performance of the protocol, and compare the new scheme with other privacy-preserving convex hulls protocols. We show that the privacy-preserving approximate convex hulls protocol is more effective than the previous privacy-preserving convex hulls ones, and the new protocol is practical enough in many aspects. Perfectly keeping privacy preserving and eliminating unfairness are the great advantages of our scheme.
机译：二十多年来，安全的多方计算一直是研究的重点。凸包问题是安全的多方计算的一种特殊情况。但是，精确的凸包肯定会暴露每个顶点，甚至带来不公平。结果，需要实用的近似凸包。在本文中，我们总结并讨论了凸包问题，然后提出了一种新的更有效的协议来私下寻找近似的凸包。此外，我们分析了协议的正确性，安全性，效率和性能，并将新方案与其他保护隐私的凸包协议进行了比较。我们表明，隐私保护近似凸包协议比以前的隐私保护凸包协议更有效，并且新协议在许多方面都足够实用。完美地保护隐私并消除不公平现象是我们计划的最大优势。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号