How to share a secret (infinitely)
- 講者Ilan Komargodski 先生 (Weizmann Institute of Science)
邀請人：鐘楷閔 - 時間2016-10-18 (Tue.) 10:00 ~ 12:00
- 地點資訊所新館101演講廳
摘要
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