Limits of Practical Sublinear Secure Computation
Offered By: TheIACR via YouTube
Course Description
Overview
Explore the boundaries of practical sublinear secure computation in this 25-minute conference talk presented at Crypto 2018. Delve into the research findings of Elette Boyle, Yuval Ishai, and Antigoni Polychroniadou as they discuss their paper on the limitations and possibilities of efficient secure multiparty computation protocols. Gain insights into the challenges and potential solutions for achieving sublinear communication complexity in secure computation, and understand the implications for privacy-preserving distributed computations.
Syllabus
Limits of Practical Sublinear Secure 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