Secret sharing schemes for graph-based prohibited structures

被引：6
作者：
Sun, HM
Shieh, SP
机构：
[1] Chaoyang Inst Technol, Dept Informat Management, Taichung 413, Taiwan
[2] Natl Chiao Tung Univ, Dept Comp Sci & Informat Engn, Hsinchu 30050, Taiwan
来源：
COMPUTERS & MATHEMATICS WITH APPLICATIONS | 1998年 / 36卷 / 07期
关键词：
cryptography; data security; information theory; secret sharing scheme;
D O I：
10.1016/S0898-1221(98)00177-1
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A secret sharing scheme for the prohibited structure is a method of sharing a master key among a finite set of participants in such a way that only certain prespecified subsets of participants cannot recover the master key. A secret sharing scheme is called perfect, if any subset of participants who cannot recover the master key obtains no information regarding the master key. In this paper, we propose an efficient construction of perfect secret sharing schemes for graph-based prohibited structures where a vertex denotes a participant and an edge does a pair of participants who cannot recover the master key. The information rate of our scheme is 2/n, where n is the number of participants. (C) 1998 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码：131 / 140
页数：10
相关论文
共 17 条
  • [1] BENALOH J, 1990, LECT NOTES COMPUT SC, V403, P27
  • [2] Blakley G. R., 1979, AFIPS Conference Proceedings, vol.48. 1979 National Computer Conference, P313, DOI 10.1109/MARK.1979.8817296
  • [3] Brickell E. F., 1992, Journal of Cryptology, V5, P153, DOI 10.1007/BF02451112
  • [4] CAPOCELLI RM, 1992, LECT NOTES COMPUT SC, V576, P101
  • [5] Denning DER, 1983, CRYPTOGRAPHY DATA SE
  • [6] HAMMING RW, 1986, CODING INFORMATIN TH
  • [7] Ito M., 1993, Journal of Cryptology, V6, P15, DOI 10.1007/BF02620229
  • [8] Ito M., 1987, PROC IEEE GLOBAL TEL, P99
  • [9] Jackson W.-A., 1994, LECTURE NOTES COMPUT, V773, P126
  • [10] LAMPSON BW, 1971, P 5 PRINC S INF SCI, P437
12