CryptoDB
Optimal Updating of Ideal Threshold Schemes
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2004-12150, title={Optimal Updating of Ideal Threshold Schemes}, booktitle={IACR Eprint archive}, keywords={Cryptology, threshold schemes, dynamic secret sharing, distributed cryptosystems}, url={http://eprint.iacr.org/2004/178}, note={ sbarwick@maths.adelaide.edu.au 12622 received 22 Jul 2004}, author={S. G. Barwick and W.-A. Jackson and K. M. Martin and C. M. O'Keefe}, year=2004 }