Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication

Masahito Hayashi, Takeshi Koshiba

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

For conventional secret sharing, if cheaters can submit possibly forged shares after observing shares of the honest users in the reconstruction phase, they can disturb the protocol and only they can reconstruct the true secret. To overcome the problem, secret sharing scheme with properties of cheater-identification have been proposed. Existing protocols for cheater-identifiable secret sharing assumed non-rushing cheaters or honest majority. In this paper, using message authentication, we remove both conditions simultaneously, and give its universal construction from any secret sharing scheme. To resolve this end, we explicitly propose the concepts of 'individual identification' and 'agreed identification'. For both settings, we provide protocols for cheater-identifiable secret sharing. In our protocols, the security parameter can be set independently of the share size and the underlying finite field size.

本文言語English
ホスト出版物のタイトル2018 IEEE International Symposium on Information Theory, ISIT 2018
出版社Institute of Electrical and Electronics Engineers Inc.
ページ2614-2618
ページ数5
ISBN(印刷版)9781538647806
DOI
出版ステータスPublished - 2018 8 15
イベント2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States
継続期間: 2018 6 172018 6 22

出版物シリーズ

名前IEEE International Symposium on Information Theory - Proceedings
2018-June
ISSN(印刷版)2157-8095

Other

Other2018 IEEE International Symposium on Information Theory, ISIT 2018
CountryUnited States
CityVail
Period18/6/1718/6/22

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

フィンガープリント 「Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル