YoVDO

The Exact Round Complexity of Secure Computation

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Cryptography Courses Secure Computation Courses Theoretical Computer Science Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the intricacies of secure computation in this 24-minute Eurocrypt 2016 conference talk presented by Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, and Antigoni Polychroniadou. Delve into the research findings that address the exact round complexity of secure computation, a crucial aspect of cryptographic protocols. Gain insights into the latest advancements in the field and understand the implications for designing efficient and secure multi-party computation systems.

Syllabus

The Exact Round Complexity of Secure Computation


Taught by

TheIACR

Related Courses

Applied Cryptography
University 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