Explore a presentation on secure multi-party computation focusing on the impact of low communication. Delve into the research paper by Juan A. Garay, Yuval Ishai, Rafail Ostrovsky, and Vassilis Zikas, presented at Crypto 2017. Examine key concepts such as static corruption, adaptive graphing, and adaptive corruption. Investigate the tightness of the adversary model and its implications. Learn about dictatorship, helpers, and oblivious transfer in the context of secure computation. Analyze the proof and negative results presented in this 25-minute talk, gaining insights into the challenges and limitations of low-communication protocols in multi-party computation.
The Price of Low Communication in Secure Multi-Party Computation
Overview
Syllabus
Intro
The adversary
Static corruption
Why is this tight
Adaptive Graphing
Adaptive Corruption
dictatorship
helpers
oblivious transfer
Proof
Negative Result
Taught by
TheIACR
Related Courses
-
Secure Computation: Part I
-
Adaptive Garbled RAM from Laconic Oblivious Transfer
-
Multi-Party Computation 3
-
Constant Round Asynchronous Multi Party Computation Based on One Way Functions
-
ITC Conference - Line Point Zero Knowledge and Its Applications
-
Two-Round Multiparty Secure Computation from Minimal Assumptions
