Constant Round MPC with Fairness and Guarantee of Output Delivery
Offered By: TheIACR via YouTube
Course Description
Overview
Explore a cutting-edge lecture on Constant Round Multi-Party Computation (MPC) that delves into fairness and guarantee of output delivery. Discover the intricacies of run complexity, previous work in the field, and the Common Reference String (CRS) model. Learn about obfuscation techniques and a three-run fair protocol. Examine the challenges of guaranteeing output delivery and compare previous approaches with innovative new methods. Gain insights into new thresholds, transformations, and the underlying intuition behind these advanced concepts in cryptography and secure computation.
Syllabus
Introduction
Run Complexity
Previous work
CRS model
Obfuscation
Threerun fair protocol
Guarantee of output delivery
Previous approach
New approach
New threshold
Transformation
Intuition
Taught by
TheIACR
Related Courses
Secure Multiparty ComputationSimons Institute via YouTube Cryptography for Quantum Computers
Simons Institute via YouTube Fast Secure Computation for Small Population over the Internet
Association for Computing Machinery (ACM) via YouTube Broadcast-Optimal Two-Round MPC
TheIACR via YouTube The Price of Active Security in Cryptographic Protocols
TheIACR via YouTube