Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Journal article
Title: Updating the parameters of a threshold scheme by minimal broadcast
Author: Barwick, S.
Jackson, W.
Martin, K.
Citation: IEEE Transactions on Information Theory, 2005; 51(2):620-633
Publisher: IEEE-Inst Electrical Electronics Engineers Inc
Issue Date: 2005
ISSN: 0018-9448
Statement of
S. G. Barwick, Wen-Ai Jackson and Keith M. Martin
Abstract: Threshold schemes allow secret data to be protected among a set of participants in such a way that only a prespecified threshold of participants can reconstruct the secret from private information (shares) distributed to them on a system setup using secure channels. We consider the general problem of designing unconditionally secure threshold schemes whose defining parameters (the threshold and the number of participants) can later be changed by using only public channel broadcast messages. In this paper, we are interested in the efficiency of such threshold schemes, and seek to minimize storage costs (size of shares) as well as optimize performance in low-bandwidth environments by minimizing the size of necessary broadcast messages. We prove a number of lower bounds on the smallest size of broadcast message necessary to make general changes to the parameters of a threshold scheme in which each participant already holds shares of minimal size. We establish the tightness of these bounds by demonstrating optimal schemes.
Keywords: Cryptology, secret-sharing schemes, threshold schemes
Rights: © 2005 IEEE
RMID: 0020050099
DOI: 10.1109/TIT.2004.840857
Appears in Collections:Pure Mathematics publications

Files in This Item:
File Description SizeFormat 
hdl17762.pdf431.51 kBPublisher's PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.