Explore a conference talk presented at Crypto 2017 that delves into the paper "Robust Non-Interactive Multiparty Computation Against Constant Size Collusion" by Fabrice Benhamouda, Hugo Krawczyk, and Tal Rabin. Gain insights into advanced cryptographic concepts and learn about the authors' approach to securing multiparty computation against collusion attempts. Discover how this research contributes to the field of cryptography and its potential applications in secure distributed systems.
Robust Non Interactive Multiparty Computation Against Constant Size Collusion
Overview
Syllabus
Robust Non Interactive Multiparty Computation Against Constant Size Collusion
Taught by
TheIACR
Related Courses
-
K-Round Multiparty Computation from K-Round Oblivious Transfer via Garbled Interactive Circuits
-
Secure Multiparty Computation - Session I
-
Non-Interactive Secure Multiparty Computation
-
Secure Multiparty Computation - Session III
-
Secret Sharing and Secure Multiparty Computation
-
Two Round Multiparty Secure Computation Minimizing Public Key Operations
