Publicly Auditable MPC-as-a-Service with succinct verification and universal setup

by   Sanket Kanjalkar, et al.

In recent years, multiparty computation as a service (MPCaaS) has gained popularity as a way to build distributed privacy-preserving systems. We argue that for many such applications, we should also require that the MPC protocol is publicly auditable, meaning that anyone can check the given computation is carried out correctly – even if the server nodes carrying out the computation are all corrupt. In a nutshell, the way to make an MPC protocol auditable is to combine an underlying MPC protocol with verifiable computing proof (in particular, a SNARK). Building a general-purpose MPCaaS from existing constructions would require us to perform a costly "trusted setup" every time we wish to run a new or modified application. To address this, we provide the first efficient construction for auditable MPC that has a one-time universal setup. Despite improving the trusted setup, we match the state-of-the-art in asymptotic performance: the server nodes incur a linear computation overhead and constant round communication overhead compared to the underlying MPC, and the audit size and verification are logarithmic in the application circuit size. We also provide an implementation and benchmarks that support our asymptotic analysis in example applications. Furthermore, compared with existing auditable MPC protocols, besides offering a universal setup our construction also has a 3x smaller proof, 3x faster verification time and comparable prover time.


page 1

page 2

page 3

page 4


Performance Evaluation of Secure Multi-party Computation on Heterogeneous Nodes

Secure multi-party computation (MPC) is a broad cryptographic concept th...

A Verifiable Multiparty Computation Solver for the Assignment Problem and Applications to Air Traffic Management

The assignment problem is an essential problem in many application field...

Efficient Coded Multi-Party Computation at Edge Networks

Multi-party computation (MPC) is promising for designing privacy-preserv...

STAMP: Lightweight TEE-Assisted MPC for Efficient Privacy-Preserving Machine Learning

In this paper, we propose STAMP, an end-to-end 3-party MPC protocol for ...

Adaptive Gap Entangled Polynomial Coding for Multi-Party Computation at the Edge

Multi-party computation (MPC) is promising for designing privacy-preserv...

Analog Multi-Party Computing: Locally Differential Private Protocols for Collaborative Computations

We consider a fully decentralized scenario in which no central trusted e...

NFGen: Automatic Non-linear Function Evaluation Code Generator for General-purpose MPC Platforms

Due to the absence of a library for non-linear function evaluation, so-c...

Please sign up or login with your details

Forgot password? Click here to reset