Two Round Multiparty Secure Computation Minimizing Public Key Operations
Offered By: TheIACR via YouTube
Course Description
Overview
Explore a groundbreaking paper on two-round multiparty secure computation that minimizes public key operations, presented at Crypto 2018 by Sanjam Garg, Peihan Miao, and Akshayaram Srinivasan. Delve into innovative techniques for enhancing the efficiency of secure multiparty computation protocols while reducing the computational overhead associated with public key operations. Gain insights into the authors' novel approach to achieving secure communication among multiple parties in just two rounds, potentially revolutionizing the field of cryptography and secure distributed computing.
Syllabus
Two Round Multiparty Secure Computation Minimizing Public Key Operations
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