Essentially Optimal Robust Secret Sharing with Maximal Corruptions
Offered By: TheIACR via YouTube
Course Description
Overview
Explore a 25-minute conference talk presented at Eurocrypt 2016 by Allison Bishop, Valerio Pastro, Rajmohan Rajaraman, and Daniel Wichs, delving into the topic of essentially optimal robust secret sharing with maximal corruptions. Gain insights into advanced cryptographic concepts and their applications in secure information sharing systems. Learn about the researchers' findings and their contributions to the field of cryptography, as they discuss innovative approaches to enhancing the robustness and efficiency of secret sharing protocols in the presence of maximum possible adversarial corruptions.
Syllabus
Essentially Optimal Robust Secret Sharing with Maximal Corruptions
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