Paper 2017/457

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

Masahito Hayashi and 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".

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
secret sharinguniversal constructionrushing cheatercheater- identificationwithout honest majority
Contact author(s)
tkoshiba @ waseda jp
History
2017-05-25: received
Short URL
https://ia.cr/2017/457
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2017/457,
      author = {Masahito Hayashi and Takeshi Koshiba},
      title = {Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters without Honest Majority},
      howpublished = {Cryptology ePrint Archive, Paper 2017/457},
      year = {2017},
      note = {\url{https://eprint.iacr.org/2017/457}},
      url = {https://eprint.iacr.org/2017/457}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.