YoVDO

Fast Secure Computation for Small Population over the Internet

Offered By: Association for Computing Machinery (ACM) via YouTube

Tags

Secure Multiparty Computation Courses Cryptography Courses Network Security Courses Garbled Circuit Courses

Course Description

Overview

Explore efficient, constant-round 3-party and 4-party protocols for secure multiparty computation in this 21-minute conference talk. Delve into the honest-majority setting, focusing on strong security notions of fairness and guaranteed output delivery. Learn about garbled circuits, three-party protocols, and fairness mechanisms. Examine the challenges, efficiency considerations, and open questions in the field of secure computation for small populations over the internet. Gain insights into the latest advancements in cryptographic protocols presented at the Association for Computing Machinery (ACM) conference.

Syllabus

Introduction
Secure MultiParty Computation
Garbled Circuit
ThreeParty Protocol
ThreeParty Fairness
Summary
Challenges
Efficiency
Open Question


Taught by

Association for Computing Machinery (ACM)

Related Courses

Stacked Garbling for Disjunctive Zero-Knowledge Proofs
TheIACR via YouTube GAZELLE - A Low Latency Framework for Secure Neural Network Inference
USENIX via YouTube Laconic Conditional Disclosure of Secrets and Applications
IEEE via YouTube Garbling Gadgets for Boolean and Arithmetic Circuits
Association for Computing Machinery (ACM) via YouTube Optimizing Semi-Honest Secure Multiparty Computation for the Internet
Association for Computing Machinery (ACM) via YouTube