Multi-party Computation II - Session 12
Offered By: TheIACR via YouTube
Course Description
Overview
Dive into an advanced exploration of Multi-party Computation in this 56-minute lecture from TheIACR. Examine key concepts such as adaptive security of multiparty products, efficient transparent arguments, and bulletproofs. Learn about polynomial commitment, two-party PM, and previous works in the field. Discover new results and techniques for K parties, and understand hard terms related to the subject. The lecture concludes with a summary of CSAR, its participants, goals, main ideas, and primary results, followed by a Q&A session to clarify complex topics.
Syllabus
Introduction
Question
Adaptive Security of Multiparty Products
Efficient Transparent Arguments
bulletproofs
polynomial commitment
Twoparty PM
Previous works
New results
Technique
K Parties
Hard Terms
Summary
CSAR
Participants
Goals
Main Idea
Main Result
QA
Taught by
TheIACR
Related Courses
Applied CryptographyUniversity 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