arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0810.1624cs.CRcs.DC
收藏

Peer-to-Peer安全多方数值计算

Peer-to-Peer Secure Multi-Party Numerical Computation

Danny Bickson, Genia Bezman, Danny Dolev, Benny Pinkas

摘要:

我们提出了一个有效的框架,使安全的多方数值计算在对等网络。这个问题出现在一系列的应用程序,如协同过滤,分布式计算的信任和信誉,监控和许多其他任务,其中的计算节点希望保持其输入的隐私,同时执行联合计算的某个功能。虽然在分布式系统安全领域有大量关于安全多方计算的文献,但在实际应用中,这些方法很难在大规模对等网络中部署。在这项工作中,我们研究了几种可能的方法,并讨论其可行性。在可能的方法中,我们确定了一个单一的方法,这是可扩展的,理论上是安全的。另一个新的贡献是,我们展示了如何计算基于邻域的协同过滤,一个国家的最先进的协同过滤算法,2007年Netflix进步奖的得主。我们的解决方案在对等网络中使用隐私保护计算来计算该算法,而不会损失准确性。使用广泛的大规模模拟上的真正的互联网拓扑结构,我们证明了我们的方法的适用性。据我们所知,我们是第一个实现这样一个大规模的安全多方模拟网络的数百万个节点和数亿条边。

英文摘要:

We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collaborative filtering, distributed computation of trust and reputation, monitoring and numerous other tasks, where the computing nodes would like to preserve the privacy of their inputs while performing a joint computation of a certain function. Although there is a rich literature in the field of distributed systems security concerning secure multi-party computation, in practice it is hard to deploy those methods in very large scale Peer-to-Peer networks. In this work, we examine several possible approaches and discuss their feasibility. Among the possible approaches, we identify a single approach which is both scalable and theoretically secure. An additional novel contribution is that we show how to compute the neighborhood based collaborative filtering, a state-of-the-art collaborative filtering algorithm, winner of the Netflix progress prize of the year 2007. Our solution computes this algorithm in a Peer-to-Peer network, using a privacy preserving computation, without loss of accuracy. Using extensive large scale simulations on top of real Internet topologies, we demonstrate the applicability of our approach. As far as we know, we are the first to implement such a large scale secure multi-party simulation of networks of millions of nodes and hundreds of millions of edges.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑