Optimal Updating of Ideal Threshold Schemes

S.  G.  Barwick; W. -A.  Jackson; K.  M.  Martin; C.  M.  O'Keefe

Paper 2004/178 Original: eprint.iacr.org/2004/178 ↗

Optimal Updating of Ideal Threshold Schemes

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.

Metadata

Available format(s): PDF
Publication info: Preprint.
History: 2004-07-26: last updated; 2004-07-26: published
Short URL: https://ia.cr/2004/178
License: https://creativecommons.org/licenses/by/4.0/

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},
      url = {https://eprint.iacr.org/2004/178}
}