On cheating immune secret sharing

A. Braeken, S.I. Nikova, V.S. Nikov

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Samenvatting

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 et. al on the number of cheaters tolerated in such scheme. Our proof is much simpler than the proof of D’Arco 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 l over any finite field.
Originele taal-2Engels
TitelProceedings of the 25th Symposium on Information Theory in the Benelux (Kerkrade, The Netherlands, June 2-4, 2004)
RedacteurenG.R. Pellikaan
Plaats van productieEnschede
UitgeverijWerkgemeenschap voor Informatie- en Communicatietheorie (WIC)
Pagina's113-120
ISBN van geprinte versie90-71048-20-9
StatusGepubliceerd - 2004

Vingerafdruk

Duik in de onderzoeksthema's van 'On cheating immune secret sharing'. Samen vormen ze een unieke vingerafdruk.

Citeer dit