MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably
Bar Alon, Moni Naor, Eran Omri, Uri Stemmer

TL;DR
This paper introduces the GMPC model, enabling secure multi-party computation between a powerful server and many less powerful users with polylogarithmic complexity, and provides protocols for secure computation of various functions.
Contribution
The paper develops the GMPC model and presents a secure committee election protocol, enabling efficient secure computation of functions with polylogarithmic size and depth, including sorting, without relying on FHE.
Findings
Secure protocols for GMPC model with malicious adversaries.
Efficient secure computation of functions with polylogarithmic size and depth.
Sorting securely computed in GMPC, impacting differential privacy applications.
Abstract
In this work, we introduce the Gulliver multi-party computation model (GMPC). The GMPC model considers a single highly powerful party, called the server or Gulliver, that is connected to users over a star topology network (alternatively formulated as a full network, where the server can block any message). The users are significantly less powerful than the server, and, in particular, should have both computation and communication complexities that are polylogarithmic in . Protocols in the GMPC model should be secure against malicious adversaries that may corrupt a subset of the users and/or the server. Designing protocols in the GMPC model is a delicate task, since users can only hold information about polylog(n) other users (and, in particular, can only communicate with polylog(n) other users). In addition, the server can block any message between any pair of honest parties.…
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.
Taxonomy
TopicsCryptography and Data Security · Nanocluster Synthesis and Applications · Complexity and Algorithms in Graphs
