Welcome to the resource topic for 2004/178
Title:
Optimal Updating of Ideal Threshold Schemes
Authors: S. G. Barwick, W. -A. Jackson, K. M. Martin, C. M. O'Keefe
Abstract:We consider the problem of changing the parameters of an established ideal (k,n)-threshold scheme without the use of secure channels. We identify the parameters (k',n') to which such a scheme can be updated by means of a broadcast message and then prove a lower bound on the size of the relevant broadcast. The tightness of this bound is demonstrated by describing an optimal procedure for updating the parameters of an ideal scheme.
ePrint: https://eprint.iacr.org/2004/178
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 .