Secure Secret Sharing by Michael Zuo '18

Secure Secret Sharing for Strangers

Mathematics Colloquium

Abstract: 

Secret sharing splits a piece of information among multiple parties so that it can later be recovered by cooperating participants.  In a t-out-of-n threshold scheme, the secret is recoverable if a predetermined number of participants cooperate to reveal it.  We will discuss Shamir's secret sharing and prove conditions under which it is information-theoretically "perfect", leaking no information about the secret when threshold condition is not satisfied.  We then explore an extension to the scheme to reduce required trust in a central authority.

 

Wednesday, February 14 at 1:00pm to 1:45pm

Stetson Court classroom, 101
Stetson Court, Williamstown, MA, 01267

Event Type

lecture/seminar/presentation

Departments

Mathematics & Statistics

Subscribe
Google Calendar iCal Outlook

Recent Activity