Cryptology ePrint Archive: Report 2004/178

Optimal Updating of Ideal Threshold Schemes

S. G. Barwick and W.-A. Jackson and K. M. Martin and 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.

Category / Keywords: Cryptology, threshold schemes, dynamic secret sharing, distributed cryptosystems

Date: received 22 Jul 2004

Contact author: sbarwick at maths adelaide edu au

Available format(s): PDF | BibTeX Citation

Version: 20040726:190325 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]