A Construction of Secret Sharing Schemes with Threshold 3 for Countably Infinite Participants

• Taksahi Hisatome

  University of Tsukuba

• Hiroki Koga

  University of Tsukuba

抄録

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).

収録刊行物

• IEICE Proceeding Series

  IEICE Proceeding Series 55 513-513, 2018-10-18

  The Institute of Electronics, Information and Communication Engineers

詳細情報

• CRID: 1390564227332308736
• NII論文ID: 230000011235
• DOI: 10.34385/proc.55.we-am-poster.23
• ISSN: 21885079
• 本文言語コード: en
• データソース種別:
  • JaLC
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可