Unconditionally-Secure Robust Secret Sharing with Compact Shares

Unconditionally-Secure Robust Secret Sharing with Compact Shares

Explore a conference talk from Eurocrypt 2012 on unconditionally-secure robust secret sharing with compact shares. Delve into the work of Alfonso Cevallos, Serge Fehr, Rafail Ostrovsky, and Yuval Rabani as they present their findings on (t-out-of-n) secret sharing, Shamir's Secret Sharing Scheme, and robust secret sharing applications in secure data storage. Learn about the impossibility results, the simple case of n = 31+1, the Rabin & Ben-Or Scheme for n = 21+1, and discover the speakers' new scheme and reconstruction procedure. Gain insights into the intricacies of the proof and understand the key takeaways from this 22-minute presentation on advanced cryptographic techniques.