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
相关论文
共 50 条
  • [1] On secret sharing schemes
    Blundo, C
    De Santis, A
    Vaccaro, U
    INFORMATION PROCESSING LETTERS, 1998, 65 (01) : 25 - 32
  • [2] On secret reconstruction in secret sharing schemes
    Wang, Huaxiong
    Wong, Duncan S.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (01) : 473 - 480
  • [3] Lower bounds for robust secret sharing schemes
    Blundo, C
    DeSantis, A
    INFORMATION PROCESSING LETTERS, 1997, 63 (06) : 317 - 321
  • [4] Weighted threshold secret sharing schemes
    Morillo, P
    Padró, C
    Sáez, G
    Villar, JL
    INFORMATION PROCESSING LETTERS, 1999, 70 (05) : 211 - 216
  • [5] On the Optimization of Bipartite Secret Sharing Schemes
    Farras, Oriol
    Metcalf-Burton, Jessica Ruth
    Padro, Carles
    Vazquez, Leonor
    INFORMATION THEORETIC SECURITY, 2010, 5973 : 93 - +
  • [6] Veto is impossible in secret sharing schemes
    Obana, S
    Kurosawa, K
    INFORMATION PROCESSING LETTERS, 1996, 58 (06) : 293 - 295
  • [7] On the bound for anonymous secret sharing schemes
    Kishimoto, W
    Okada, K
    Kurosawa, K
    Ogata, W
    DISCRETE APPLIED MATHEMATICS, 2002, 121 (1-3) : 193 - 202
  • [8] A Linear Construction of Secret Sharing Schemes
    Marten van Dijk
    Designs, Codes and Cryptography, 1997, 12 (2) : 161 - 201
  • [9] On the optimization of bipartite secret sharing schemes
    Oriol Farràs
    Jessica Ruth Metcalf-Burton
    Carles Padró
    Leonor Vázquez
    Designs, Codes and Cryptography, 2012, 63 : 255 - 271
  • [10] On the optimization of bipartite secret sharing schemes
    Farras, Oriol
    Metcalf-Burton, Jessica Ruth
    Padro, Carles
    Vazquez, Leonor
    DESIGNS CODES AND CRYPTOGRAPHY, 2012, 63 (02) : 255 - 271
12345