Summary
The 2018 International Symposium on Information Theory and Its Applications (ISITA2018)
2018
Session Number:We-AM-Poster
Session:
Number:We-AM-Poster.23
A Construction of Secret Sharing Schemes with Threshold 3 for Countably Infinite Participants
Taksahi Hisatome, Hiroki Koga,
pp.513-513
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.We-AM-Poster.23
PDF download
Summary:
Recently, Komargodski et al [2] give a construction of a secret sharing scheme called the evolving k-THR in which for a given secret S a dealer can generate countably infinite shares with the property similar to Shamir’s (k; n)-threshold scheme. In our poster, we propose a new simple construction of the evolving 3-THR and evaluate the sizes of the shares. In particular, we prove that the size of the share of the i-th participant can be reduced to 1/2 (log log i)^2 + O((log log i)^2).