Explore a conference talk on non-interactive secure two-party computation (NISC) in offline/online and batch settings. Delve into the paper presented by Payman Mohassel and Mike Rosulek at Eurocrypt 2017, covering key concepts such as Yao's Garbled Circuits, Cut-and-Choose 2PC, and Oblivious Switching Networks. Learn about the intricacies of secure computation, including single NISC, batch 2PC, and garbler input consistency. Gain insights into the latest advancements in cryptography and their applications in secure multi-party computation.
Non Interactive Secure 2PC in the Offline - Online and Batch Settings
Overview
Syllabus
Intro
Secure Two-Party Computation
Non-Interactive Secure Computation (NISC)
Batched Secure Computation
Yao's Garbled Circuits
Cut-and-Choose 2PC
Single NISC
Batch 2PC
Oblivious Switching Networks
Cut and Choose
Garbler Input Consistency
Summary
Taught by
TheIACR
Related Courses
-
Faster Secure Two Party Computation in the Single Execution Setting
-
Two-Round Multiparty Secure Computation from Minimal Assumptions
-
K-Round Multiparty Computation from K-Round Oblivious Transfer via Garbled Interactive Circuits
-
Optimizing Semi-Honest Secure Multiparty Computation for the Internet
-
Succinct Non-Interactive Secure Computation
-
Adaptively Secure Garbling with Near Optimal Online Complexity
