Multiparty Computation

Explore cutting-edge research in multiparty computation through a series of presentations at this 57-minute conference session. Delve into topics such as homomorphic secret sharing, secure multiplication using regenerating codes, faster k-out-of-n garbled function evaluation, security-efficiency trade-offs in permutation-based two-party computation, two-round adaptively secure MPC, and reverse firewalls for adaptively secure MPC without setup. Learn from expert speakers as they discuss their findings, methodologies, and implications for the field of cryptography and secure computation.

Intro
Presentation
Introduction
Literature
Results
Question