Paper 2005/216

A Secret Sharing Scheme for Preventing the Cheaters from Acquiring the Secret

Hassan Jameel and Sungyoung Lee

Abstract

In this paper, we propose a secret sharing scheme which prevents the cheaters from recovering the secret when the honest participants cannot, with high probability. The scheme is a (k, n) threshold scheme providing protection against less than k cheaters. It is efficient in terms of share sizes for the participants. Furthermore the total size of the individual shares per participant is less than twice the size of the secret itself. The cheaters can do successful cheating with a probability 1/t, which can be adjusted without significantly increasing the total size of the individual shares. Such a scheme can be deployed in thin client fat server systems where the server has reasonable computational power and there is a high level of mistrust among the users.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
secret sharing
Contact author(s)
hassan jameel @ gmail com
History
2005-07-06: received
Short URL
https://ia.cr/2005/216
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2005/216,
      author = {Hassan Jameel and Sungyoung Lee},
      title = {A Secret Sharing Scheme for Preventing the Cheaters from Acquiring the Secret},
      howpublished = {Cryptology ePrint Archive, Paper 2005/216},
      year = {2005},
      note = {\url{https://eprint.iacr.org/2005/216}},
      url = {https://eprint.iacr.org/2005/216}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.