Paper 2005/216 Original: eprint.iacr.org/2005/216 ↗
A Secret Sharing Scheme for Preventing the Cheaters from Acquiring the Secret
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
- Preprint.
- History
- 2005-07-06: last updated
- 2005-07-06: published
- Short URL
- https://ia.cr/2005/216
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2005/216}
}