Towards Building Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing
Vipul Goyal
·
2025-03-18
·
via Cryptology ePrint Archive
In this work, we study the communication complexity of constant-round secure multiparty computation (MPC) aga…
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。