Explore a cutting-edge presentation on secure multiparty computation (MPC) from PKC 2020. Delve into advanced techniques for active secure two-party computation with minimal leakage, focusing on efficiently verifiable functions. Learn about applications to perfect matching, state-of-the-art Yao-style protocols, and innovative approaches that go beyond dual execution. Gain insights into the latest developments in MPC for functions with efficient verification, presented by leading researchers in the field of cryptography.
Going Beyond Dual Execution - MPC for Functions with Efficient Verification
Overview
Syllabus
Going Beyond Dual Execution: MPC for Functions with Efficient Verification
Secure Multiparty Computation (MPC)
Applications to MPC
Protocol Blueprint
Yao's 2PC
State-of-the-art Yao-style Active 2PC
Why concede to leakage?
Dual Execution [MF06]
Our Results - Active secure 2PC with 1-bit leakage
Efficiently Verifiable Functions
Theorem 1: Boolean f
Theorem 2: Arbitrary f
Application: Perfect Matching
Taught by
TheIACR
Related Courses
-
The Price of Active Security in Cryptographic Protocols
-
Sabre- Sender-Anonymous Messaging with Fast Audits
-
Broadcast-Optimal Two-Round MPC
-
Computer Aided Verification and Software Synthesis for Secure Multi Party Computation Protocols
-
Secure Multiparty Computation
-
Correlated Pseudorandom Functions from Variable-Density LPN
