How to share a secret (infinitely)
- LecturerMr. Ilan Komargodski (Weizmann Institute of Science)
Host: Kai-Min Chung - Time2016-10-18 (Tue.) 10:00 ~ 12:00
- LocationAuditorium 101 at IIS new Building
Abstract
In this talk I will overview and introduce the problem of secret sharing. I will introduce the model and some of the basic results (both lower and upper bounds).
I will further introduce a model of *infinite* secret sharing which allows one to share a secret for an unbounded number of parties. I'll present both lower and upper bounds and the relation to prefix-free codes.
Talk will be based on:
* http://eccc.hpi-web.de/report/2016/131
* http://eccc.hpi-web.de/report/2016/023