Updating the parameters of a threshold scheme by minimal broadcast

被引:28
作者
Barwick, SG [1 ]
Jackson, WA
Martin, KM
机构
[1] Univ Adelaide, Dept Pure Math, Adelaide, SA 5005, Australia
[2] Univ London Royal Holloway & Bedford New Coll, Informat Secur Grp, Egham TW20 0EX, Surrey, England
基金
澳大利亚研究理事会;
关键词
cryptology; secret-sharing schemes; threshold schemes;
D O I
10.1109/TIT.2004.840857
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:620 / 633
页数:14
相关论文
共 20 条
  • [1] [Anonymous], 1979, P AFIPS NAT COMP C N
  • [2] [Anonymous], 1997, ISSETR9701 G MAS U
  • [3] [Anonymous], CONT CRYPTOLOGY SCI
  • [4] Barwick SG, 2002, LECT NOTES COMPUT SC, V2384, P71
  • [5] BARWICK SG, OPTIMAL UPDATING IDE
  • [6] BLAKLEY B, 1993, LECT NOTES COMPUTER, V740, P540
  • [7] BLUNDO C, 1994, LECT NOTES COMPUTER, V773, P110
  • [8] Blundo C., 1994, LECT NOTES COMPUTER, V839, P150
  • [9] CHEN L, 1997, LECT NOTES COMPUTER, V1189, P139
  • [10] Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X