Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn about the challenges and solutions in broadcast optimal multi-party computation through this 31-minute conference talk that examines the practical costs of implementing broadcast communication in secure computation protocols. Explore how traditional round-optimal protocols assume broadcast communication comes "for free," while in reality, implementing broadcast through bulletin boards or point-to-point channel protocols incurs significant costs. Discover what security guarantees can still be achieved when broadcast rounds in round-optimal protocols are replaced with point-to-point communication. Survey the current state-of-the-art research in this area, including work in computational settings with dishonest majority cases (both with and without setup), honest majority settings with setup, and recent developments in round-optimal information-theoretic MPC. Examine key upper and lower bound techniques that have been developed to address these challenges, gaining insight into how the field is evolving to make secure multi-party computation more practical and efficient.
