Probability of shares in secret sharing schemes

被引：3
作者：
Blundo, C [1 ]
De Santis, A [1 ]
Gaggia, AG [1 ]
机构：
[1] Univ Salerno, Dipartimento Informat & Applicaz, I-84081 Baronissi, SA, Italy
来源：
INFORMATION PROCESSING LETTERS | 1999年 / 72卷 / 5-6期
关键词：
safety/security in digital systems; cryptography; probability;
D O I：
10.1016/S0020-0190(99)00153-2
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A secret sharing scheme is a protocol to share a secret s among a set P of participants in such a way that only qualified subsets, pooling together their information, can reconstruct the secret s, but subsets of participants that are not enabled to recover the secret have no information on it. In this paper we analyze the sample space of shares for any set of participants. In particular, we prove tight bounds on the probability of shares and on the size of the space of shares in terms of the size of the secret set. (C) 1999 Published by Elsevier Science B.V. All rights reserved.
引用
收藏
页码：169 / 175
页数：7
相关论文
共 14 条
[1]  
BENALOH J, 1990, LECT NOTES COMPUT SC, V403, P27
[2]  
BLAKLEY GR, 1979, P AM FED INF PROC 19, P313
[3]   Randomness in distribution protocols [J].
Blundo, C ;
DeSantis, A ;
Vaccaro, U .
INFORMATION AND COMPUTATION, 1996, 131 (02) :111-139
[4]   On secret sharing schemes [J].
Blundo, C ;
De Santis, A ;
Vaccaro, U .
INFORMATION PROCESSING LETTERS, 1998, 65 (01) :25-32
[5]  
Blundo C., 1995, LECT NOTES COMPUTER, V950, P35, DOI 10.1007/BFb0053422
[6]  
Brickell E. F., 1991, Journal of Cryptology, V4, P123, DOI 10.1007/BF00196772
[7]  
Brickell E. F., 1992, Journal of Cryptology, V5, P153, DOI 10.1007/BF02451112
[8]  
Capocelli R. M., 1993, Journal of Cryptology, V6, P157, DOI 10.1007/BF00198463
[9]  
Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X
[10]  
Ito M., 1987, PROC IEEE GLOBAL TEL, P99
12