S. Cabello, C. Padró, G. Sáez

Secret sharing schemes with detection of cheaters for a general access structure

Designs, Codes and Cryptography 25 (2002) 175-188. A previous version of this paper appeared in Proceedings of the 12th International Symposium on Fundamentals of Computation Theory, FCT '99, Lecture Notes in Computer Science 1684 (1999) 185-193. Iasi, Romania, 1999.


Abstract

In a secret sharing scheme, some participants can lie about the value of their shares when reconstructing the secret in order to obtain some illicit benefits. We present in this paper two methods to modify any linear secret sharing scheme in order to obtain schemes that are unconditionally secure against that kind of attack. The schemes obtained by the first method are robust, that is, cheaters are detected with high probability even if they know the value of the secret. The second method provides secure schemes, in which cheaters that do not know the secret are detected with high probability. When applied to ideal linear secret sharing schemes, our methods provide robust and secure schemes whose relation between the probability of cheating and the information rate is almost optimal. Besides, those methods make it possible to construct robust and secure schemes for any access structure.