Unconditionally-Secure Robust Secret Sharing with Compact Shares

Unconditionally-Secure Robust Secret Sharing with Compact Shares

TheIACR via YouTube Direct link

The (Simple) Case n = 31+1

8 of 13

8 of 13

The (Simple) Case n = 31+1

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Unconditionally-Secure Robust Secret Sharing with Compact Shares

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 (t-out-of-n) Secret Sharing
  3. 3 Shamir's Secret Sharing Scheme (Sha79)
  4. 4 Robust Secret Sharing
  5. 5 Application: Secure Data Storage
  6. 6 (Im)possibility
  7. 7 Further Outline
  8. 8 The (Simple) Case n = 31+1
  9. 9 The Rabin & Ben-Or Scheme (n = 21+1)
  10. 10 Our New Scheme
  11. 11 Our New Reconstruction Procedure
  12. 12 What Makes the Proof Tricky
  13. 13 Summary

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.