This course covers the learning outcomes and goals of understanding the round complexity of Perfect Multi-Party Computation (MPC) with active security and optimal resiliency. It teaches skills such as information-theoretic concepts, constant round complexity, recent developments in MPC, trading errors with erasures, protocol folding, reducing binary deg-2 to arithmetic, and analyzing properties of MPC. The teaching method involves theoretical lectures and analysis of protocols. The intended audience for this course is individuals interested in cryptography, secure multi-party computation, and information theory.
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency
Overview
Syllabus
Intro
Information-Theoretic (Perfect)
Constant Round Complex
Recent Developments
Our Results
Starting point: BGW for deg-2
Trading errors with erasures
Second-Level Multiplication
Protocol Folding
Are We Done?
Reducing Binary deg-2 to Arithmetic
Impossibility of 3-round T=n/4 pro
Verifiable Secret Sharing CGMA
Chopping a Protocol
Analysis: Properties of f + MPC gua
MPC and VSS
The Landscape of Perfect
Taught by
IEEE FOCS: Foundations of Computer Science
