[Resource Topic] 2017/457: Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters without Honest Majority

Welcome to the resource topic for 2017/457

Title:
Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters without Honest Majority

Authors: Masahito Hayashi, Takeshi Koshiba

Abstract:

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 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, we remove both conditions simultaneously, and give its universal construction from any secret sharing scheme. To resolve this end, we propose the concepts of “individual identification” and “agreed identification”.

ePrint: https://eprint.iacr.org/2017/457

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .