Explore a conference talk from Eurocrypt 2016 on unconditionally secure computation with reduced interaction. Delve into the concepts presented by Ivan Damgård, Jesper Buus Nielsen, Rafail Ostrovsky, and Adi Rosén as they discuss computation efficiency, unconditional security, and security models. Examine difficult and very difficult functions, and gain insights into the results and intuition behind reduced interaction in secure computation. Learn about the latest advancements in cryptography and their implications for secure multiparty computation in this 21-minute presentation.
Unconditionally Secure Computation with Reduced Interaction
Overview
Syllabus
Introduction
Unconditionally Secure Computation
Computation Efficiency
Unconditional Security
Security Model
Difficult Functions
Very Difficult Functions
Results
Intuition
Reduced Interaction
Summary
Taught by
TheIACR
Related Courses
-
On the Communication Required for Unconditionally Secure Multiplication
-
Unconditional UC Secure Computation with Stronger Malicious PUFs
-
Unconditionally Secure Multiparty Computation for Symmetric Functions with Low Bottleneck Complexity
-
Secure Computation with Minimal Interaction, Revisited
-
Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead
-
Two-Round Multiparty Secure Computation from Minimal Assumptions
