指派问题的可验证多方计算解法及其在空中交通管理中的应用
A Verifiable Multiparty Computation Solver for the Assignment Problem and Applications to Air Traffic Management
摘要：
指派问题是许多应用领域中的基本问题，经常被用来优化资源的使用。这个问题是很好理解的，存在各种有效的算法来解决这个问题。然而，目前还不清楚什么样的实际性能可以实现基于多方计算（MPC）的隐私保护的实现，利用更有效的解决方案的策略比基于MPC的单纯形求解器的线性规划。我们通过实施和比较不同的优化MPC算法来解决这个问题，以解决合理的问题大小的分配问题。我们的经验方法揭示了对基于MPC的优化的各种见解，并且与已知的基于单纯形的方法相比，我们测量了显着的（50倍）加速。此外，我们还研究了通过非交互式的零知识证明的结果公开验证引入的开销。通过利用现代证明系统，我们还实现了显着的加速证明和验证时间相比，以前提出的方法，以及紧凑的证明大小。
英文摘要：
The assignment problem is an essential problem in many application fields and frequently used to optimize resource usage. The problem is well understood and various efficient algorithms exist to solve the problem. However, it was unclear what practical performance could be achieved for privacy preserving implementations based on multiparty computation (MPC) by leveraging more efficient solution strategies than MPC based simplex solvers for linear programs. We solve this question by implementing and comparing different optimized MPC algorithms to solve the assignment problem for reasonable problem sizes. Our empirical approach revealed various insights to MPC based optimization and we measured a significant (50x) speedup compared to the known simplex based approach. Furthermore, we also study the overhead introduced by making the results publicly verifiable by means of non-interactive zero-knowledge proofs. By leveraging modern proof systems we also achieve significant speedup for proof and verification times compared to the previously proposed approaches as well as compact proof sizes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
