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
Building Geospatial Apps on Postgres, PostGIS, & Citus at Large ScaleMicrosoft via YouTube Unlocking the Power of ML for Your JavaScript Applications with TensorFlow.js
TensorFlow via YouTube Managing the Reactive World with RxJava - Jake Wharton
ChariotSolutions via YouTube What's New in Grails 2.0
ChariotSolutions via YouTube Performance Analysis of Apache Spark and Presto in Cloud Environments
Databricks via YouTube