Secure Computation 2
Talkat Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025 · 2025-05-19..05-23·
summary
Describes a concrete workflow: generate input-independent correlated randomness for MPC so the online phase sends only masked wire values; shows many useful correlations (e.g. Beaver multiplication triples, OT/OLE, one‑time truth tables) all fit a common function secret sharing view that gives gate‑by‑gate offline specs for mixed-domain gates (bit‑decomposition, comparison, activations). Presents constructions to generate those correlations using a single‑multiplication homomorphic primitive and pseudorandom correlation generators, highlighting LPN‑based PCGs that cut communication dramatically and match or beat prior runtimes.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 1:22Secure computation protocols
- 7:25Cryptographic correlations
- 19:28Function secret sharing
- 31:31Correlation generation
- 48:21Pseudorandom correlation generators
- 53:25State of the art LPN
- 1:00:10Conclusion
related talks
01h 01mMPC with Silent Preprocessing via Pseuodorandom Correlation Generators
01h 10mSecure Multiparty Computation II
40mApplied MPC
58mSecure Multiparty Computation I
45mPrice of Active Security in Multiparty Computation
29mTowards Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing
01h 06mSecure Computation and Low-Complexity Cryptography
25mFaster Malicious 2-Party Secure Computation with Online/Offline Dual Execution