Explore the concept of Non-Interactive Secure Multiparty Computation in this 20-minute conference talk presented at Crypto 2014. Delve into the basic setting, extensions, and abstract formulation of this cryptographic technique. Examine its motivation, relationship with multi-input functional encryption, and key results. Learn about specific examples, including SUM over Abelian groups and fully-robust NIMPC for all functions. Gain insights into symmetric functions and their role in this field. Presented by experts Eyal Kushilevitz, Yuval Ishai, Amos Beimel, Sigurd Meldgaard, Anat Paskin-Cherniavsky, and Ariel Gabizon, this talk offers a comprehensive overview of Non-Interactive Secure Multiparty Computation for cryptography enthusiasts and researchers.
Overview
Syllabus
Non-Interactive MPC - Basic Setting
Remarks and Extensions
An Abstract Formulation
Motivation
Relation with Multi-Input Functional Encryption
Our Results
Example: SUM (over Abelian group G)
Fully-robust NIMPC for all functions (Step 2)
Symmetric Functions
Summary
Taught by
TheIACR
Related Courses
-
Robust Non Interactive Multiparty Computation Against Constant Size Collusion
-
Non Interactive Multiparty Computation Without Correlated Randomness
-
Non-Interactive Secure Multi-Party Computation - Eurocrypt 2023 Session
-
Succinct Non-Interactive Secure Computation
-
A New Approach to Round Optimal Secure Multiparty Computation
-
Two Round Multiparty Computation via Multi-key FHE
