Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Essentially Optimal Robust Secret Sharing with Maximal Corruptions

TheIACR via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Reviews

Start your review of Essentially Optimal Robust Secret Sharing with Maximal Corruptions

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.