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

@article{Kanjalkar2021PubliclyAM,
  title={Publicly Auditable MPC-as-a-Service with succinct verification and universal setup},
  author={Sanket Kanjalkar and Ye Zhang and Shreyas Gandlur and Andrew K. Miller},
  journal={2021 IEEE European Symposium on Security and Privacy Workshops (EuroS\&PW)},
  year={2021},
  pages={386-411}
}
In recent years, multiparty computation as a service (MPCaaS) has gained popularity as a way to build distributed privacy-preserving systems like blockchain trusted parameter setup ceremonies, and digital asset auctions. 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… 
2 Citations

Figures and Tables from this paper

Experimenting with Collaborative zk-SNARKs: Zero-Knowledge Proofs for Distributed Secrets
TLDR
The proof generation algorithm in pairing-based zkSNarks is optimized so that algebraic techniques for multiparty computation (MPC) yield efficient proof generation protocols, which suggests MPC “friendliness” as an additional criterion for evaluating zk-SNARKs.
Publicly Accountable Robust Multi-Party Computation
TLDR
This work presents the first publicly verifiable and accountable, and (up to a threshold) robust SPDZ-like MPC protocol without restart, and proposes protocols for accountable and robust online, offline, and setup computations.