Scholarlink

Consider the task of secure multiparty computation (MPC) among n parties with perfect security and guaranteed output delivery, supporting $$t

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Perfectly-Secure Multiparty Computation with Linear Communication Complexity over Any Modulus

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Daniel Escudero,
  • Yifan Song,
  • Wenhao Wang

摘要

Consider the task of secure multiparty computation (MPC) among n parties with perfect security and guaranteed output delivery, supporting $$t