Robust Non Interactive Multiparty Computation Against Constant Size Collusion

Robust Non Interactive Multiparty Computation Against Constant Size Collusion

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.