Optimal Updating of Ideal Threshold Schemes

S. G. Barwick, W. -A. Jackson, 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.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
Keywords
Cryptologythreshold schemesdynamic secret sharingdistributed cryptosystems
Contact author(s)
sbarwick @ maths adelaide edu au
History
Short URL
https://ia.cr/2004/178

CC BY

BibTeX

@misc{cryptoeprint:2004/178,
author = {S.  G.  Barwick and W. -A.  Jackson and K.  M.  Martin and C.  M.  O'Keefe},
title = {Optimal Updating of Ideal Threshold Schemes},
howpublished = {Cryptology ePrint Archive, Paper 2004/178},
year = {2004},
note = {\url{https://eprint.iacr.org/2004/178}},
url = {https://eprint.iacr.org/2004/178}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.