Explore a 22-minute conference talk from Crypto 2016 that delves into the communication requirements for unconditionally secure multiplication. Learn from experts Ivan Damgård, Jesper Buus Nielsen, Antigoni Polychroniadou, and Michael Raskin as they present their findings on this crucial topic in cryptography. Gain insights into the latest research and advancements in secure multiparty computation and communication complexity.
On the Communication Required for Unconditionally Secure Multiplication
Overview
Syllabus
On the Communication required for Unconditionally Secure Multiplication
Taught by
TheIACR
Related Courses
-
Unconditionally Secure Computation with Reduced Interaction
-
Limits of Practical Sublinear Secure Computation
-
Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead
-
The Exact Round Complexity of Secure Computation
-
Secure Two-Party Computation - Part II
-
The Price of Active Security in Cryptographic Protocols
