3.8 Proceedings Paper

NANOPI: Extreme-Scale Actively-Secure Multi-Party Computation Resolving the Space-Round Dilemma using Lightweight Program Instrumentation

Publisher

ASSOC COMPUTING MACHINERY
DOI: 10.1145/3243734.3243850

Keywords

Large-scale actively-secure constant-round MPC

Funding

  1. NSF [1464113]
  2. NIH [1U01EB023685-01]
  3. Direct For Computer & Info Scie & Enginr
  4. Division Of Computer and Network Systems [1464113] Funding Source: National Science Foundation

Ask authors/readers for more resources

Existing actively-secure MPC protocols require either linear rounds or linear space. Due to this fundamental space-round dilemma, no existing MPC protocols is able to run large-scale computations without significantly sacrificing performance. To mitigate this issue, we developed nanoPI, which is practically efficient in terms of both time and space. Our protocol is based on WRK [44, 45] but introduces interesting and necessary modifications to address several important programmatic and cryptographic challenges. A technique that may be of independent interest (in transforming other computation-oriented cryptographic protocols) is a staged execution model, which we formally define and realize using a combination of lightweight static and dynamic program instrumentation. We demonstrate the unprecedented scalability and performance of nanoPI by building and running a suit of benchmark applications, including an actively-secure four-party logistical regression (involving 4.7 billion ANDs and 8.9 billion XORs) which finished in less than 28 hours on four small-memory machines. Our integrated framework nanoPI is open-sourced at https: // github. com/ nanoPIMPC/ nanoPI.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

3.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available