Scholarlink

In this chapter, we show a 4-round construction for secure two-party computation (2PC) protocol for any functionality in the simultaneous message exchange model, assuming (standard) trapdoor permutations. Moreover, the construction only requires black-box simulation and is therefore round optimal given the lower bound shown in [84].

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

Round Optimal Two-Party Computation

  • 章节

  • 发表日期：

    2026年

查看全文
  • Michele Ciampi,
  • Luisa Siniscalchi

摘要

In this chapter, we show a 4-round construction for secure two-party computation (2PC) protocol for any functionality in the simultaneous message exchange model, assuming (standard) trapdoor permutations. Moreover, the construction only requires black-box simulation and is therefore round optimal given the lower bound shown in [84].