On the Round Complexity of Dishonest-Majority MPC
Ran Cohen
·
2026-06-18
·
via Cryptology ePrint Archive
What is the round complexity of MPC over point-to-point channels that is secure with unanimous/identifiable a…
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。