Explore secure multi-party computation in this comprehensive conference talk from ACCU 2023. Learn how to jointly compute on private data without revealing inputs while still obtaining outputs. Discover protocols and techniques for scenarios where a mutually trusted party is unavailable. Delve into concepts like homomorphic encryption, garbage circuits, and secret sharing using high-school level algebra. Gain insights into the history, security properties, and practical applications of secure multi-party computation. Understand additive secret sharing, equal sharing, and resharing techniques to enhance data privacy and collaboration in computational tasks.
Introduction to Secure Multi-Party Computation
Overview
Syllabus
Introduction
About Ahto
What is Secure MultiParty Computation
History of Secure MultiParty Computation
How can we do it
Homomorphic Encryption
Fully Homomorphic Encryption
Garbage Circuits
Secret Sharing
Security Properties
Information Theory Security
Additive Secret Sharing
Additive Equal Sharing
Resharing
Taught by
ACCU Conference
Related Courses
-
Secure Computation: Part I
-
Secure Computation: Part II
-
Breaking the Circuit Size Barrier for Secure Computation Under DDH
-
Homomorphic Encryption in the SPDZ Protocol for MPC
-
Group Based Secure Computation - Optimizing Rounds, Communication, and Computation
-
JIMU Faster LEGO Based Secure Computation Using Additive Homomorphic Hashes
