CryptoDB
On Cheating Immune Secret Sharing
Authors: | |
---|---|
Download: | |
Abstract: | This work addresses the problem of cheating prevention in secret sharing. The scheme is said to be $k$-cheating immune if any group of $k$ cheaters has no advantage over honest participants. In this paper we study the constraints of cheating immune secret sharing schemes. We give a necessary and sufficient condition for SSSs to be cheating immune. Then, we improve the upper bound of D'Arco {\textit et.~al} on the number of cheaters tolerated in such scheme. Our proof is much simpler than the proof of D'Arco {\textit et.~al} and relies on certain properties of cryptographic Boolean functions. As a result of independent interest we provide a condition given function to be $t$-resilient and to satisfy the propagation criterion of degree $\ell$ over any finite field. |
BibTeX
@misc{eprint-2004-12172, title={On Cheating Immune Secret Sharing}, booktitle={IACR Eprint archive}, keywords={secret sharing schemes}, url={http://eprint.iacr.org/2004/200}, note={Published in the Proc. of the 25th Symposium on Information Theory in the Benelux svetla.nikova@esat.kuleuven.ac.be 12646 received 16 Aug 2004}, author={An Braeken and Svetla Nikova and Ventzislav Nikov}, year=2004 }