Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols / secret sharing

Date: received 5 Jul 2005

Contact author: hassan jameel at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20050706:063531 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]