Essentially Optimal Robust Secret Sharing with Maximal Corruptions

Essentially Optimal Robust Secret Sharing with Maximal Corruptions

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.