Secure Computation II
Offered By: TheIACR via YouTube
Course Description
Overview
Dive into an advanced exploration of secure computation in this 1-hour 17-minute lecture. Examine key concepts including information theory, MPC, ground complexity, and fairness in cryptographic protocols. Analyze impossible results and breakthrough findings in the field, while gaining insights into previous work and current research directions. Engage with thought-provoking questions and participate in a Q&A session to deepen your understanding of secure computation techniques and their applications.
Syllabus
Introduction
Questions
Information Theory
MPR
Incursible MPC
Ground Complexity
Air Questions
Fairness
Impossible Results
Breakthrough Results
Previous Work
Results
QA
Barelon
Taught by
TheIACR
Related Courses
Applied CryptographyUniversity of Virginia via Udacity FHE and Private Set Intersection
Simons Institute via YouTube Homomorphic Encryption in the SPDZ Protocol for MPC
Simons Institute via YouTube Compressing Vector OLE
Association for Computing Machinery (ACM) via YouTube Secure Outsourced Matrix Computation and Application to Neural Networks
Association for Computing Machinery (ACM) via YouTube