可公开审核的MPC即服务，具有简洁的验证和通用设置
Publicly Auditable MPC-as-a-Service with succinct verification and universal setup
摘要：
近年来，多方计算即服务（MPCaaS）作为构建分布式隐私保护系统的一种方式越来越受欢迎。我们认为，对于许多这样的应用程序，我们还应该要求MPC协议是可公开审计的，这意味着任何人都可以检查给定的计算是否正确执行-即使执行计算的服务器节点都已损坏。简而言之，使MPC协议可审计的方法是将底层MPC协议与可验证的计算证明（特别是SNARK）相结合。从现有结构构建通用MPCaaS需要我们在每次运行新的或修改的应用程序时执行昂贵的“可信设置”。为了解决这个问题，我们提供了第一个高效的可审计MPC结构，它具有一次性的通用设置。尽管提高了可信设置，我们匹配的最先进的渐近性能：服务器节点产生的线性计算开销和恒定的轮通信开销相比，底层MPC，审计大小和验证是对数的应用程序电路大小。我们还提供了一个实现和基准，支持我们的渐近分析的例子应用程序。此外，与现有的可审计MPC协议相比，除了提供通用设置外，我们的构造还具有3倍的小证明，3倍的验证时间和可比的证明时间。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
