[Resource Topic] 2004/177: Updating the Parameters of a Threshold Scheme by Minimal Broadcast

Welcome to the resource topic for 2004/177

Updating the Parameters of a Threshold Scheme by Minimal Broadcast

Authors: S. G. Barwick, W. -A. Jackson, K. M. Martin


Threshold schemes allow secret data to be protected amongst a set
of participants in such a way that only a pre-specified threshold
of participants can reconstruct the secret from private
information (shares) distributed to them on system setup using
secure channels. We consider the general problem of designing
unconditionally secure
threshold schemes whose defining parameters (the threshold and the
number of participants) can later be changed by using only public
channel broadcast messages. In this paper we are interested in the
efficiency of such threshold schemes, and seek to minimise storage
costs (size of shares) as well as optimise performance in low
bandwidth environments by minimising the size of necessary
broadcast messages. We prove a number of lower bounds on the
smallest size of broadcast message necessary to make general
changes to the parameters of a threshold scheme in which each
participant already holds shares of minimal size. We establish the
tightness of these bounds by demonstrating optimal schemes.

ePrint: https://eprint.iacr.org/2004/177

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .