On the Exact Round Complexity of Secure Three Party Computation
Offered By: TheIACR via YouTube
Course Description
Overview
Explore a 25-minute conference talk presented at Crypto 2018 that delves into the exact round complexity of secure three-party computation. Examine the research findings of Arpita Patra and Divya Ravi as they discuss their paper, which investigates the optimal number of communication rounds required for secure multi-party protocols involving three participants. Gain insights into the theoretical foundations and practical implications of this cryptographic research, which contributes to the field of secure distributed computing and privacy-preserving algorithms.
Syllabus
On the Exact Round Complexity of Secure Three Party Computation
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