Peer-to-Peer Secure Multi-Party Numerical Computation
Danny Bickson, Genia Bezman, Danny Dolev, Benny Pinkas

TL;DR
This paper introduces a scalable, secure peer-to-peer framework for multi-party numerical computations, enabling privacy-preserving collaborative filtering and other tasks in large networks with millions of nodes.
Contribution
It presents a novel scalable approach for secure multi-party computation in P2P networks and demonstrates its application to collaborative filtering without accuracy loss.
Findings
Scalable secure multi-party computation feasible in large P2P networks
Successful implementation of privacy-preserving collaborative filtering algorithm
Large-scale simulations with millions of nodes validate approach
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
