Secure Multiparty Computation I
summary
Covers when MPC is possible and how: information-theoretic security needs an honest majority (<k/2 corrupted) while computational security (via OT hybrid model) can handle any T; a simple Chaum-style masking sum protocol uses one random mask and is secure against a single corruptor but leaks if two collude, while the tournament-graph variant sends O(n choose 2) random edge-masks that cancel and achieves security against any non-disconnecting collusion; highlights UC vs stand-alone, simulators, and recent exact fairness/feasibility characterizations for small deterministic two-party functions.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 3:00Generalization
- 12:21Generalizing
- 16:07Efficiency
- 22:19Ideal Paradigm
- 30:07Concrete MPC
- 31:02Functionality
- 34:50Network Model
- 36:24Adversary
- 38:10Security Type
- 39:29Output Delivery
- 45:02Motivation
- 52:03Possible Security
related talks
01h 08mSecure Computation 1
30mOn the Optimal Round Complexity of Multi-Party Computation in the Plain Model
01h 03mSecure Computation 2
29mTowards Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing
20mWhat Can Cryptography Do For Decentralized Mechanism Design?
26mEfficient Multiparty Protocols via Log-Depth Threshold Formulae
40mApplied MPC
01h 03mClosing Keynote Day 2