Watch a remote presentation from Asiacrypt 2023 exploring unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity. Delve into the research findings presented by Reo Eriguchi as he discusses innovative approaches to enhancing security in multiparty computation systems while minimizing computational bottlenecks.
Unconditionally Secure Multiparty Computation for Symmetric Functions with Low Bottleneck Complexity
Overview
Syllabus
AC 2023: Unconditionally Secure Multiparty Computation for Symmetric Functions with Low ...
Taught by
TheIACR
Related Courses
-
Secure Multiparty Computation - Session III
-
Secure Multiparty Computation - Session II
-
Secure Multiparty Computation - Session I
-
Optimizing Semi-Honest Secure Multiparty Computation for the Internet
-
Unconditionally Secure Computation with Reduced Interaction
-
Multiparty Computation Advances - Asiacrypt 2022 Session 2
