YoVDO

Robust Non Interactive Multiparty Computation Against Constant Size Collusion

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Cryptography Courses Secure Multiparty Computation Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

Robust Non Interactive Multiparty Computation Against Constant Size Collusion


Taught by

TheIACR

Related Courses

Applied Cryptography
University of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera