YoVDO

Going Beyond Dual Execution - MPC for Functions with Efficient Verification

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Cryptography Courses Theoretical Computer Science Courses Protocol Design Courses Secure Multiparty Computation Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

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

Automata Theory
Stanford University via edX
Intro to Theoretical Computer Science
Udacity
Computing: Art, Magic, Science
ETH Zurich via edX
理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera